Delaunay Triangulation of Imprecise Points Simplified and Extended
From MaRDI portal
Publication:3183447
DOI10.1007/978-3-642-03367-4_12zbMATH Open1253.68329OpenAlexW2147499882MaRDI QIDQ3183447FDOQ3183447
Authors: Kevin Buchin, Maarten Löffler, Pat Morin, Wolfgang Mulzer 
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
Recommendations
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- scientific article; zbMATH DE number 6693709
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Delaunay triangulations of imprecise pointsin linear time after preprocessing
- Preprocessing Imprecise Points and Splitting Triangulations
Cites Work
- Computational geometry. Algorithms and applications.
- Triangulating a simple polygon in linear time
- Provably good mesh generation
- Constructing strongly convex approximate hulls with inaccurate primitives
- Efficient update strategies for geometric computing with uncertainty
- Delaunay triangulations of imprecise pointsin linear time after preprocessing
- On Approximating the Depth and Related Problems
- Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
- Realistic input models for geometric algorithms
- Linear size binary space partitions for uncluttered scenes
- Splitting a Delaunay triangulation in linear time
- Computing hereditary convex structures
- Guarding scenes against invasive hypercubes.
- Preprocessing Imprecise Points and Splitting Triangulations
- ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS
- Self-improving algorithms for delaunay triangulations
- A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS
- PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS
- Almost-Delaunay simplices, nearest neighbor relations for imprecise points
- Triangulating input-constrained planar point sets
Cited In (11)
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Computability of partial Delaunay triangulation and Voronoi diagram (extended abstract)
- Delaunay triangulations of imprecise pointsin linear time after preprocessing
- Algorithm 1012
- Nice point sets can have nasty Delaunay triangulations
- Interior improvement of piecewise linear interpolants defined over Delaunay triangulations
- Title not available (Why is that?)
- Preprocessing Imprecise Points and Splitting Triangulations
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Minimal roughness property of the Delaunay triangulation: A shorter approach
- Almost-Delaunay simplices, nearest neighbor relations for imprecise points
This page was built for publication: Delaunay Triangulation of Imprecise Points Simplified and Extended
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183447)
