An empirical comparison of techniques for updating Delaunay triangulations

DOI10.1145/997817.997846zbMATH Open1375.68141OpenAlexW2108369594MaRDI QIDQ5361669FDOQ5361669

Authors: Daniel Russel, Leonidas Guibas 

Publication date: 29 September 2017

Published in: Proceedings of the twentieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/997817.997846

Recommendations

• Efficiently updating constrained Delaunay triangulations
• A comparison of sequential Delaunay triangulation algorithms.
• Self-improving algorithms for delaunay triangulations
• Updating and constructing constrained Delaunay and constrained regular triangulations by flips
• An evaluation of point-insertion sequences for incremental Delaunay tessellations
• Enhanced optimal Delaunay triangulation methods with connectivity regularization
• An algorithm for dynamic Delaunay triangulation of simple polygon

zbMATH Keywords

Delaunay triangulationmotionupdate algorithms

Mathematics Subject Classification ID

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

Cited In (4)

• Out-of-order event processing in kinetic data structures
• Sequential pursuit of multiple targets under external disturbances via Zermelo-Voronoi diagrams
• A package for exact kinetic data structures and sweepline algorithms
• A novel video compression scheme based on kinetic Delaunay triangulation

This page was built for publication: An empirical comparison of techniques for updating Delaunay triangulations

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