Nice point sets can have nasty delaunay triangulations

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2001, Pages 96-105

  Erickson, J ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Delaunay triangulation; Lower bounds; Sample measure; Spread; Surface reconstruction; sample

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; SET THEORY; THEOREM PROVING;

DELAUNAY TRIANGULATION;

COMPUTATIONAL GEOMETRY;

EID: 0034832768     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378583.378636     Document Type: Conference Paper

References (29)

1. Surface reconstruction by Voronoi filtering
2. The crust and the β-skeleton: Combinatorial curve reconstruction
3. A new Voronoi-based surface reconstruction algorithm
4. A simple algorithm for homeomorphic surface reconstruction
5. The power crust, unions of balls, and the medial axis transform
6. r-regular shape reconstruction from unorganized points
7. Automatic reconstruction of surface and scalar fields from 3d scans
8. Realistic input models for geometric algorithms
9. Sampling and reconstructing manifolds using alpha-shapes
10. Provably good mesh generation
11. Representing 2d and 3d shapes with the Delaunay triangulation
12. Smooth surface reconstruction via natural neighbour interpolation of distance functions
13. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields
14. Selecting heavily covered points
15. Dynamic skin triangulation
16. Sliver exudation
17. Nearest neighbor queries in metric spaces
18. The expected number of k-faces of a Voronoi diagram
19. Higher-dimensional Voronoi diagrams in linear expected time
20. Smoothing and cleaning up slivers
21. Three-dimensional alpha shapes
22. Crust and anti-crust: A one-step boundary and skeleton extraction algorithm
23. On the average complexity of 3d-Voronoi diagrams of random points on convex polytopes
24. Surface reconstruction using alpha shapes
25. Voronoi-based interpolation with higher continuity
26. Generating sliver-free three dimensional meshes
27. Tetrahedral mesh generation by Delaunay refinement