A faster circle-sweep Delaunay triangulation algorithm
DOI10.1016/J.ADVENGSOFT.2011.09.003zbMATH Open1239.68075OpenAlexW2081458114MaRDI QIDQ427141FDOQ427141
Authors: Ahmad Biniaz, Gholamhossein Dastghaibyfard 
Publication date: 13 June 2012
Published in: Advances in Engineering Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.advengsoft.2011.09.003
Recommendations
- Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix
- A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems
- DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\).
- A fast algorithm for constructing Delaunay triangulations in the plane
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations
computational geometryDelaunay triangulationin-circle testrecursive edge-flippingsweep-circlesweep-line
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A sweepline algorithm for Voronoi diagrams
- Voronoi diagrams from convex hulls
- Title not available (Why is that?)
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Two algorithms for constructing a Delaunay triangulation
- Title not available (Why is that?)
- General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties
- Title not available (Why is that?)
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Higher order Delaunay triangulations
- Generating realistic terrains with higher-order Delaunay triangulations
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations
- Constrained higher order Delaunay triangulations
- Three-dimensional Delaunay mesh generation
- Title not available (Why is that?)
- Delaunay triangulation and the convex hull of n points in expected linear time
- Higher-dimensional Voronoi diagrams in linear expected time
- A weak characterisation of the Delaunay triangulation
Cited In (6)
- A functional language to implement the divide-and-conquer Delaunay triangulation algorithm
- On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\)
- Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix
- A Robust Implementation for Three-Dimensional Delaunay Triangulations
- A triangulation algorithm based on edge-pointer search and region-division
- \textit{OFC}-Delaunay triangulation: a new efficient algorithm for merging two adjacent Delaunay triangulations
Uses Software
This page was built for publication: A faster circle-sweep Delaunay triangulation algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427141)
