The predicates for the Voronoi diagram of ellipses
Proceedings of the twenty-second annual symposium on Computational geometry
Complexity of Delaunay triangulation for points on lower-dimensional polyhedra
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the pathway axis and the persistence diagram of a collection of balls in 3-space
Proceedings of the twenty-fourth annual symposium on Computational geometry
Point cloud surfaces using geometric proximity graphs
Computers and Graphics
Spherical harmonics and distance transform for image representation and retrieval
IDEAL'09 Proceedings of the 10th international conference on Intelligent data engineering and automated learning
Spectral shape descriptor using spherical harmonics
Integrated Computer-Aided Engineering
Novel spectral descriptor for object shape
PCM'10 Proceedings of the 11th Pacific Rim conference on Advances in multimedia information processing: Part I
Delaunay triangulations in O(sort(n)) time and more
Journal of the ACM (JACM)
Efficient maximal poisson-disk sampling
ACM SIGGRAPH 2011 papers
Vietoris-rips complexes also provide topologically correct reconstructions of sampled shapes
Proceedings of the twenty-seventh annual symposium on Computational geometry
Efficient and good Delaunay meshes from random points
Computer-Aided Design
TerraNNI: natural neighbor interpolation on a 3D grid using a GPU
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
A Simple Algorithm for Maximal Poisson-Disk Sampling in High Dimensions
Computer Graphics Forum
Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes
Computational Geometry: Theory and Applications
Practical distribution-sensitive point location in triangulations
Computer Aided Geometric Design
| Hi-index | 0.00 |
Delaunay triangulations and Voronoi diagrams have found numerous applications in surface modeling, surface mesh generation, deformable surface modeling and surface reconstruction. Many algorithms in these applications begin by constructing the three-dimensional Delaunay triangulation of a finite set of points scattered over a surface. Their running-time therefore depends on the complexity of the Delaunay triangulation of such point sets.Although the complexity of the Delaunay triangulation of points in R3 may be quadratic in the worst case, we show in this paper that it is only linear when the points are distributed on a fixed set of well-sampled facets of R3 (e.g. the planar polygons in a polyhedron). Our bound is deterministic and the constants are explicitly given.