Delaunay Triangulation of Imprecise Points Simplified and Extended
From MaRDI portal
Publication:3183447
DOI10.1007/978-3-642-03367-4_12zbMath1253.68329OpenAlexW2147499882MaRDI QIDQ3183447
Kevin Buchin, Wolfgang Mulzer, Maarten Löffler, Pat Morin
Publication date: 20 October 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03367-4_12
Cites Work
- Unnamed Item
- Unnamed Item
- Computing hereditary convex structures
- Efficient update strategies for geometric computing with uncertainty
- Triangulating input-constrained planar point sets
- Triangulating a simple polygon in linear time
- Provably good mesh generation
- Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
- Guarding scenes against invasive hypercubes.
- Linear size binary space partitions for uncluttered scenes
- Splitting a Delaunay triangulation in linear time
- Realistic input models for geometric algorithms
- Constructing strongly convex approximate hulls with inaccurate primitives
- Preprocessing Imprecise Points and Splitting Triangulations
- Self-improving algorithms for delaunay triangulations
- Delaunay triangulations of imprecise pointsin linear time after preprocessing
- On Approximating the Depth and Related Problems
- A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS
- PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS
- ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS
This page was built for publication: Delaunay Triangulation of Imprecise Points Simplified and Extended
