A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces
From MaRDI portal
Publication:701788
DOI10.1007/s00454-003-2870-4zbMath1063.68100OpenAlexW2073751737MaRDI QIDQ701788
Jean-Daniel Boissonnat, Dominique Attali
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items (9)
Practical distribution-sensitive point location in triangulations ⋮ Approximating the pathway axis and the persistence diagrams for a collection of balls in 3-space ⋮ Improvements of explicit crack surface representation and update within the generalized finite element method with application to three-dimensional crack coalescence ⋮ From Spheres to Spheropolyhedra: Generalized Distinct Element Methodology and Algorithm Analysis ⋮ A tight bound for the Delaunay triangulation of points on a polyhedron ⋮ Consistency method for measurements of the support function of a convex body in the metric of \(L_\infty\) ⋮ Parallel Delaunay triangulation in three dimensions ⋮ Unnamed Item ⋮ Randomized incremental construction of Delaunay triangulations of nice point sets
This page was built for publication: A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces
