Complexity of Delaunay triangulation for points on lower-dimensional polyhedra

zbMATH Open1302.68272MaRDI QIDQ2934705FDOQ2934705

Authors Nina Amenta, Olivier Devillers, D. Attali 

Publication date 18 December 2014

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Recommendations

• A tight bound for the Delaunay triangulation of points on a polyhedron
• Complexity of the Delaunay triangulation of points on polyhedral surfaces
• Construction of three-dimensional Delaunay triangulations using local transformations
• A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces
• Complexity of the Delaunay triangulation of points on surfaces the smooth case (extended abstract)

Cited In (25)

• Skeleton Clustering: Dimension-Free Density-Aided Clustering
• Multi-region Delaunay complex segmentation
• Delaunay triangulations in O (sort( n )) time and more
• Simplex-stochastic collocation method with improved scalability
• Persistent homology and the upper box dimension
• Convergence of anisotropic mesh adaptation via metric optimization
• Randomized incremental construction of Delaunay triangulations of nice point sets
• Title not available (Why is no real title available?)
• The Persistent Homology of Cyclic Graphs
• Delaunay triangulations with disconnected realization spaces
• Title not available (Why is no real title available?)
• A tight bound for the Delaunay triangulation of points on a polyhedron
• Title not available (Why is no real title available?)
• Space complexity of exact discrete geodesic algorithms on regular triangulations
• A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces
• RDELA -- a Delaunay-triangulation-based, location and covariance estimator with high breakdown point
• Large deviation principle for geometric and topological functionals and associated point processes
• Practical distribution-sensitive point location in triangulations
• Complexity of the Delaunay triangulation of points on surfaces the smooth case (extended abstract)
• A probabilistic approach to reducing algebraic complexity of Delaunay triangulations
• Exact computation of Delaunay and power triangulations
• Title not available (Why is no real title available?)
• A space-time adaptive method for reservoir flows: formulation and one-dimensional application
• Dushnik-Miller dimension of TD-Delaunay complexes
• Complexity of the Delaunay triangulation of points on polyhedral surfaces

This page was built for publication: Complexity of Delaunay triangulation for points on lower-dimensional polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934705)