HCPO: an efficient insertion order for incremental Delaunay triangulation

DOI10.1016/J.IPL.2004.09.020MaRDI QIDQ834986zbMATH OpenOpenAlexFDO

Authors Sheng Zhou, C. 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)

Cites work

• A comparison of sequential Delaunay triangulation algorithms.
• A fast algorithm for constructing Delaunay triangulations in the plane
• A faster divide-and-conquer algorithm for constructing Delaunay triangulations
• Adaptive precision floating-point arithmetic and fast robust geometric predicates
• Computing Dirichlet Tessellations in the Plane
• Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 3633698 (Why is no real title available?)
• scientific article; zbMATH DE number 1033560 (Why is no real title available?)
• Incremental constructions con BRIO
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Randomized incremental construction of Delaunay and Voronoi diagrams
• Walking in a triangulation

Cited in

(2)

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

Describes a project that uses

Uses Software

• Triangle

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834986)