A comparison of sequential Delaunay triangulation algorithms.
From MaRDI portal
Publication:2482895
Recommendations
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations
- scientific article; zbMATH DE number 4062599
- A fast algorithm for constructing Delaunay triangulations in the plane
- A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
- Fast Delaunay triangulation in three dimensions
Cites work
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations
- A new algorithm for three-dimensional Voronoi tessellation
- A sweepline algorithm for Voronoi diagrams
- Algorithms for parallel memory, I: Two-level memories
- Applications of random sampling in computational geometry. II
- Computing Dirichlet Tessellations in the Plane
- Convex hulls of finite sets of points in two and three dimensions
- Delaunay triangulation and the convex hull of n points in expected linear time
- Higher-dimensional Voronoi diagrams in linear expected time
- scientific article; zbMATH DE number 4062599 (Why is no real title available?)
- scientific article; zbMATH DE number 176491 (Why is no real title available?)
- scientific article; zbMATH DE number 3533716 (Why is no real title available?)
- IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
- On the randomized construction of the Delaunay tree
- Optimal Expected-Time Algorithms for Closest Point Problems
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Voronoi diagrams and arrangements
- Voronoi diagrams from convex hulls
Cited in
(20)- A faster divide-and-conquer algorithm for constructing Delaunay triangulations
- Fully dynamic Delaunay triangulation in logarithmic expected per operation
- DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\).
- Regular triangulations of dynamic sets of points
- Thread-parallel mesh improvement using face and edge swapping and vertex insertion
- An evaluation of point-insertion sequences for incremental Delaunay tessellations
- Interior boundary-aligned unstructured grid generation and cell-centered versus vertex-centered CVD-MPFA performance
- A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
- Three-dimensional unstructured gridding for complex wells and geological features in subsurface reservoirs, with CVD-MPFA discretization performance
- Fast reconstruction of Delaunay triangulations
- THE DELAUNAY HIERARCHY
- Constructing Delaunay Triangulations along Space-Filling Curves
- scientific article; zbMATH DE number 4062599 (Why is no real title available?)
- A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems
- Solutions to the Minimum Variance Problem Using Delaunay Triangulation
- scientific article; zbMATH DE number 5019916 (Why is no real title available?)
- An empirical comparison of techniques for updating Delaunay triangulations
- Parallel Delaunay triangulation in three dimensions
- RDELA -- a Delaunay-triangulation-based, location and covariance estimator with high breakdown point
- HCPO: an efficient insertion order for incremental Delaunay triangulation
This page was built for publication: A comparison of sequential Delaunay triangulation algorithms.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482895)
