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

DOI10.1007/S00454-003-2870-4zbMATH Open1063.68100OpenAlexW2073751737MaRDI QIDQ701788FDOQ701788

Authors: D. Attali, Jean-Daniel Boissonnat 

Publication date: 16 December 2004

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-003-2870-4

Recommendations

• Complexity of the Delaunay triangulation of points on surfaces the smooth case (extended abstract)
• Complexity of the Delaunay triangulation of points on polyhedral surfaces
• Complexity of Delaunay triangulation for points on lower-dimensional polyhedra
• A tight bound for the Delaunay triangulation of points on a polyhedron
• Nice point sets can have nasty Delaunay triangulations

zbMATH Keywords

Voronoi diagrams

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer-aided design (modeling of curves and surfaces) (65D17) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Cited In (19)

• Multi-region Delaunay complex segmentation
• Voronoi diagrams, triangulations and surfaces
• Parallel Delaunay triangulation in three dimensions
• Title not available (Why is that?)
• Nice point sets can have nasty Delaunay triangulations
• Randomized incremental construction of Delaunay triangulations of nice point sets
• A tight bound for the Delaunay triangulation of points on a polyhedron
• The upper envelope of Voronoi surfaces and its applications
• Approximating the pathway axis and the persistence diagrams for a collection of balls in 3-space
• Delaunay triangulations of imprecise pointsin linear time after preprocessing
• Practical distribution-sensitive point location in triangulations
• Complexity of Delaunay triangulation for points on lower-dimensional polyhedra
• Complexity of the Delaunay triangulation of points on surfaces the smooth case (extended abstract)
• From spheres to spheropolyhedra: generalized distinct element methodology and algorithm analysis
• Improvements of explicit crack surface representation and update within the generalized finite element method with application to three-dimensional crack coalescence
• A short proof of the toughness of Delaunay triangulations
• Title not available (Why is that?)
• Complexity of the Delaunay triangulation of points on polyhedral surfaces
• Consistency method for measurements of the support function of a convex body in the metric of \(L_\infty\)

This page was built for publication: A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces

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