Computability of Partial Delaunay Triangulation and Voronoi Diagram [Extended Abstract]
From MaRDI portal
Publication:4916186
DOI10.1016/S1571-0661(04)80381-5zbMath1261.68131OpenAlexW1505540913MaRDI QIDQ4916186
Ali A. Khanban, André Lieutier, Abbas Edalat
Publication date: 19 April 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80381-5
Related Items
Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties, Computability of Partial Delaunay Triangulation and Voronoi Diagram [Extended Abstract], Delaunay triangulation of imprecise points in linear time after preprocessing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robustness of numerical methods in geometric computation when problem data is uncertain
- A domain-theoretic approach to computability on the real line
- Foundation of a computable solid modelling.
- Exact computation of Delaunay and power triangulations
- A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
- Domain theory and differential calculus (functions of one variable)
- Computability of Partial Delaunay Triangulation and Voronoi Diagram [Extended Abstract]