A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces

Proceedings of the Symposium on Solid Modeling and Applications

Volumn , Issue , 2002, Pages 139-146

  Attali, Dominique ^a   Boissonnat, Jean Daniel ^a  

^a ENSIEG   (France)

Author keywords

Complexity; Delaunay triangulation; Polyhedral surfaces; Reconstruction; Sample; Surface modeling; Voronoi diagram

Indexed keywords

ALGORITHMS; COMPUTER GRAPHICS; COMPUTER SIMULATION; DATA STRUCTURES; IMAGE RECONSTRUCTION;

POLYHEDRAL SURFACES; SURFACE MESH GENERATION; VORONOI DIAGRAMS;

COMPUTATIONAL GEOMETRY;

EID: 0036037960     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/566282.566304     Document Type: Conference Paper

References (22)

1. A new Voronoi-based surface reconstruction algorithm
2. A simple algorithm for homeomorphic surface reconstruction
3. Surface reconstruction by Voronoi filtering
4. Accurate and efficient unions of balls
5. Automatic reconstruction of 3D CAD models from digital scans. Internat
6. The ball-pivoting algorithm for surface reconstruction
7. Smooth surface reconstruction via natural neighbour interpolation of distance functions
8. Natural neighbour coordinates of points on a surface
9. Primal dividing and dual priming: Output-sensitive construction of 4-d polytopes and 3-d Voronoi diagrams
10. Guaranteed-quality mesh generation for curved surfaces
11. Delaunay triangulation programs on surface data
12. Higher-dimensional voronoi diagram in linear expected time
13. The expected number of k-faces of a voronoi diagram
14. Deformable smooth surface design
15. Nice point sets can have nasty Delaunay triangulations
16. Dense point sets have sparse delaunay triangulations
17. On the average complexity of 3d-voronoi diagrams of random points on convex polytopes
18. The probabilistic complexity of the voronoi diagram of points on a polyhedron
19. Computing the medial surface of a solid from a domain delaunay triangulation