HCPO: an efficient insertion order for incremental Delaunay triangulation

DOI10.1016/j.ipl.2004.09.020zbMath1173.68778OpenAlexW2038673275MaRDI QIDQ834986

Sheng Zhou, Christopher B. Jones

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.09.020

zbMATH Keywords

computational geometryincremental Delaunay triangulationinsertion order

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

An evaluation of point-insertion sequences for incremental Delaunay tessellations ⋮ Parallel Delaunay triangulation in three dimensions

Uses Software

• Triangle

Cites Work

• A faster divide-and-conquer algorithm for constructing Delaunay triangulations
• Randomized incremental construction of Delaunay and Voronoi diagrams
• Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
• Adaptive precision floating-point arithmetic and fast robust geometric predicates
• A comparison of sequential Delaunay triangulation algorithms.
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• A fast algorithm for constructing Delaunay triangulations in the plane
• Computing Dirichlet Tessellations in the Plane
• Walking in a triangulation
• Incremental constructions con BRIO
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: HCPO: an efficient insertion order for incremental Delaunay triangulation