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

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)

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)

Cited In (19)

• Skeleton Clustering: Dimension-Free Density-Aided Clustering
• Delaunay triangulations in O (sort( n )) time and more
• Simplex-stochastic collocation method with improved scalability
• Persistent homology and the upper box dimension
• Randomized incremental construction of Delaunay triangulations of nice point sets
• Title not available (Why is that?)
• The Persistent Homology of Cyclic Graphs
• Title not available (Why is that?)
• A tight bound for the Delaunay triangulation of points on a polyhedron
• Title not available (Why is that?)
• 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
• Exact computation of Delaunay and power triangulations
• Title not available (Why is that?)
• A space-time adaptive method for reservoir flows: formulation and one-dimensional application
• Complexity of the Delaunay triangulation of points on polyhedral surfaces
• Convergence of Anisotropic Mesh Adaptation via Metric Optimization

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)