Higher-dimensional Voronoi diagrams in linear expected time
Discrete & Computational Geometry
Three-dimensional alpha shapes
ACM Transactions on Graphics (TOG)
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Selecting Heavily Covered Points
SIAM Journal on Computing
Automatic reconstruction of surfaces and scalar fields from 3D scans
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Realistic input models for geometric algorithms
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Tetrahedral mesh generation by Delaunay refinement
Proceedings of the fourteenth annual symposium on Computational geometry
A new Voronoi-based surface reconstruction algorithm
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
The crust and the &Bgr;-Skeleton: combinatorial curve reconstruction
Graphical Models and Image Processing
r-regular shape reconstruction from unorganized points
Computational Geometry: Theory and Applications - special issue on applied computational geometry
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Crust and anti-crust: a one-step boundary and skeleton extraction algorithm
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Smoothing and cleaning up slivers
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A simple algorithm for homeomorphic surface reconstruction
Proceedings of the sixteenth annual symposium on Computational geometry
Smooth surface reconstruction via natural neighbour interpolation of distance functions
Proceedings of the sixteenth annual symposium on Computational geometry
Voronoi-based interpolation with higher continuity
Proceedings of the sixteenth annual symposium on Computational geometry
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The power crust, unions of balls, and the medial axis transform
Computational Geometry: Theory and Applications
Collision detection for deforming necklaces
Proceedings of the eighteenth annual symposium on Computational geometry
The Delaunay tetrahedralization from Delaunay triangulated surfaces
Proceedings of the eighteenth annual symposium on Computational geometry
The probabilistic complexity of the Voronoi diagram of points on a polyhedron
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
Shape dimension and approximation from samples
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Smooth-surface reconstruction in near-linear time
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
Modified DAG Location for Delaunay Triangulation
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
On conflict-free coloring of points and simple regions in the plane
Proceedings of the nineteenth annual symposium on Computational geometry
Local polyhedra and geometric graphs
Proceedings of the nineteenth annual symposium on Computational geometry
Complexity of the delaunay triangulation of points on surfaces the smooth case
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
Provably good surface sampling and approximation
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
A geometric convection approach of 3-D reconstruction
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Sampling and meshing a surface with guaranteed topology and geometry
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Collision detection for deforming necklaces
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometrySoCG2002
Journal of Computer and System Sciences
Quality mesh generation for molecular skin surfaces using restricted union of balls
Computational Geometry: Theory and Applications
Topological inference via meshing
Proceedings of the twenty-sixth annual symposium on Computational geometry
Interior Medial Axis Transform computation of 3D objects bound by free-form surfaces
Computer-Aided Design
A fast and simple surface reconstruction algorithm
Proceedings of the twenty-eighth annual symposium on Computational geometry
New Bounds on the Size of Optimal Meshes
Computer Graphics Forum
A pseudopolynomial time O(log n)-approximation algorithm for art gallery problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Hi-index | 0.00 |
We consider the complexity of Delaunay triangulations of sets of point s in $\Real^3$ under certain practical geometric constraints. The \emph{spread} of a set of points is the ratio between the longest and shortest pairwise distances. We show that in the worst case, the Delaunay triangulation of $n$ points in~$\Real^3$ with spread $\Delta$ has complexity $\Omega(\min\set{\Delta^3, n\Delta, n^2})$ and $O(\min\set{\Delta^4, n^2})$. For the case $\Delta = \Theta(\sqrt{n})$, our lower bound construction consists of a uniform sample of a smooth convex surface with bounded curvature. We also construct a family of smooth connected surfaces such that the Delaunay triangulation of any good point sample has near-quadratic complexity.