Fast reconstruction of Delaunay triangulations
From MaRDI portal
Publication:2486080
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.
Cites work
- Linear-time reconstruction of Delaunay triangulations with applications
- Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes
- On the randomized construction of the Delaunay tree
- Optimal bit allocation in compressed 3D models
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Wrap \& Zip decompression of the connectivity of triangle meshes compressed with edgebreaker
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
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)