An efficient expected time parallel algorithm for Voronoi construction
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Three-dimensional alpha shapes
ACM Transactions on Graphics (TOG)
A data-parallel algorithm for three-dimensional Delaunay triangulation and its implementation
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
A comparison of sequential Delaunay triangulation algorithms
Proceedings of the eleventh annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
Probabilistic analysis for combinatorial functions of moving points
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A condition guaranteeing the existence of higher-dimensional constrained Delaunay triangulations
Proceedings of the fourteenth annual symposium on Computational geometry
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations
Proceedings of the sixteenth annual symposium on Computational geometry
Nice point sets can have nasty Delaunay triangulations
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
The Delaunay tetrahedralization from Delaunay triangulated surfaces
Proceedings of the eighteenth annual symposium on Computational geometry
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Delaunay triangulation programs on surface data
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A linear bound on the complexity of the delaunay triangulation of points on polyhedral surfaces
Proceedings of the seventh ACM symposium on Solid modeling and applications
Fast Range Searching with Delaunay Triangulations
Geoinformatica
REGTET: A Program for Computing Regular Tetrahedralizations
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Incremental constructions con BRIO
Proceedings of the nineteenth annual symposium on Computational geometry
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes
Computational Geometry: Theory and Applications
Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions
Journal of Experimental Algorithmics (JEA)
Almost-Delaunay simplices: nearest neighbor relations for imprecise points
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Complexity of Delaunay triangulation for points on lower-dimensional polyhedra
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
Proceedings of the twenty-fifth annual symposium on Computational geometry
A faster circle-sweep Delaunay triangulation algorithm
Advances in Engineering Software
A GPU accelerated algorithm for 3D Delaunay triangulation
Proceedings of the 18th meeting of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games
| Hi-index | 0.01 |