Preferred directions for resolving the non-uniqueness of Delaunay triangulations

DOI10.1016/J.COMGEO.2005.08.004MaRDI QIDQ2489018zbMATH OpenOpenAlexFDO

Authors Christopher Dyken, Michael S. Floater

Publication date 16 May 2006

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2005.08.004

zbMATH Keywords

Delaunay triangulationEdge-swappingInteger arithmeticUniqueness

Mathematics Subject Classification ID

Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Computer-aided design (modeling of curves and surfaces) (65D17)

Recommendations

• A simple method for resolving degeneracies in Delaunay triangulations
• scientific article; zbMATH DE number 917637
• scientific article; zbMATH DE number 1182915
• Properties of n-dimensional triangulations
• Generalized Delaunay triangulation for planar graphs

Cites work

• A Robust Implementation for Three-Dimensional Delaunay Triangulations
• A storage-efficient method for construction of a Thiessen triangulation
• Computational Geometry in C
• scientific article; zbMATH DE number 3633698 (Why is no real title available?)
• scientific article; zbMATH DE number 2079354 (Why is no real title available?)
• scientific article; zbMATH DE number 2147469 (Why is no real title available?)
• Removing degeneracies by perturbing the problem or perturbing the world
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• The nature and meaning of perturbations in geometric computing

Cited in

(2)

• The adaptive Delaunay tessellation: A neighborhood covering meshing technique
• Thread-parallel mesh improvement using face and edge swapping and vertex insertion

This page was built for publication: Preferred directions for resolving the non-uniqueness of Delaunay triangulations

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