Preferred directions for resolving the non-uniqueness of Delaunay triangulations
From MaRDI portal
Publication:2489018
DOI10.1016/j.comgeo.2005.08.004zbMath1140.52014OpenAlexW1977702275MaRDI QIDQ2489018
Michael S. Floater, Christopher Dyken
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
Computer-aided design (modeling of curves and surfaces) (65D17) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)
Related Items (2)
Thread-parallel mesh improvement using face and edge swapping and vertex insertion ⋮ The adaptive Delaunay tessellation: A neighborhood covering meshing technique
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A storage-efficient method for construction of a Thiessen triangulation
- The nature and meaning of perturbations in geometric computing
- Removing degeneracies by perturbing the problem or perturbing the world
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Computational Geometry in C
- A Robust Implementation for Three-Dimensional Delaunay Triangulations
This page was built for publication: Preferred directions for resolving the non-uniqueness of Delaunay triangulations
