Fast reconstruction of Delaunay triangulations
DOI10.1016/J.COMGEO.2004.12.006zbMATH Open1115.68158OpenAlexW2024810302MaRDI QIDQ2486080FDOQ2486080
Authors: Christian Sohler 
Publication date: 5 August 2005
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.12.006
Recommendations
- Linear-time reconstruction of Delaunay triangulations with applications
- DELAUNAY TRIANGULATIONS IN THE PLANE WITH ${\mathcal O} (\sqrt{N} \log N)$ STORAGE REQUIREMENTS
- A fast algorithm for constructing Delaunay triangulations in the plane
- Fast Delaunay triangulation in three dimensions
- A comparison of sequential Delaunay triangulation algorithms.
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Wrap \& Zip decompression of the connectivity of triangle meshes compressed with edgebreaker
- Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes
- On the randomized construction of the Delaunay tree
- Linear-time reconstruction of Delaunay triangulations with applications
- Optimal bit allocation in compressed 3D models
Cited In (6)
- Linear-time reconstruction of Delaunay triangulations with applications
- Star splaying
- Thread-parallel mesh improvement using face and edge swapping and vertex insertion
- Speeding up the incremental construction of the union of geometric objects in practice.
- Fast and robust Delaunay tessellation in periodic domains
- Constructing Delaunay Triangulations along Space-Filling Curves
Uses Software
This page was built for publication: Fast reconstruction of Delaunay triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486080)
