Computability of partial Delaunay triangulation and Voronoi diagram (extended abstract)
From MaRDI portal
Publication:4916186
DOI10.1016/S1571-0661(04)80381-5zbMATH Open1261.68131OpenAlexW1505540913MaRDI QIDQ4916186FDOQ4916186
Authors: Ali A. Khanban, Abbas Edalat, A. Lieutier
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
Recommendations
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Delaunay Triangulation of Imprecise Points Simplified and Extended
- New Computational Paradigms
- Computing planar Voronoi diagrams in double precision, a further example of degree-driven algorithm design
- scientific article; zbMATH DE number 1182913
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
- Title not available (Why is that?)
- Computability of partial Delaunay triangulation and Voronoi diagram (extended abstract)
- Title not available (Why is that?)
- Foundation of a computable solid modelling.
- Domain theory and differential calculus (functions of one variable)
- A domain-theoretic approach to computability on the real line
- Robustness of numerical methods in geometric computation when problem data is uncertain
- Exact computation of Delaunay and power triangulations
Cited In (9)
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems
- Computability of partial Delaunay triangulation and Voronoi diagram (extended abstract)
- New Computational Paradigms
- A theoretical structure for computational geometry: regions of point-free overlapping circles
- A short proof of the toughness of Delaunay triangulations
- Exact computation of Delaunay and power triangulations
- Transactions on Computational Science XX. Special issue on Voronoi diagrams and their applications
- Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
Uses Software
This page was built for publication: Computability of partial Delaunay triangulation and Voronoi diagram (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916186)