Preprocessing imprecise points for Delaunay triangulation: simplified and extended
From MaRDI portal
Publication:644800
DOI10.1007/s00453-010-9430-0zbMath1225.68263OpenAlexW2147026670MaRDI QIDQ644800
Maarten Löffler, Pat Morin, Wolfgang Mulzer, Kevin Buchin
Publication date: 7 November 2011
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-010-9430-0
Related Items (13)
Preclustering algorithms for imprecise points ⋮ Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties ⋮ Fréchet Distance for Uncertain Curves ⋮ On algorithmic complexity of imprecise spanners ⋮ An algorithmic framework for the single source shortest path problem with applications to disk graphs ⋮ Dynamic connectivity in disk graphs ⋮ Minimizing the diameter of a spanning tree for imprecise points ⋮ Computing the Fréchet distance between uncertain curves in one dimension ⋮ Computing the Fréchet distance between uncertain curves in one dimension ⋮ Unnamed Item ⋮ Preprocessing Ambiguous Imprecise Points ⋮ Minimizing Co-location Potential of Moving Entities ⋮ Faster algorithms for growing prioritized disks and rectangles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing hereditary convex structures
- Efficient update strategies for geometric computing with uncertainty
- Well-separated pair decomposition in linear time?
- Triangulating input-constrained planar point sets
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Triangulating a simple polygon in linear time
- Approximating the minimum weight Steiner triangulation
- Provably good mesh generation
- Guarding scenes against invasive hypercubes.
- Linear size binary space partitions for uncluttered scenes
- The complexity of the free space for motion planning amidst fat obstacles
- Splitting a Delaunay triangulation in linear time
- Sharp quantum versus classical query complexity separations
- Largest bounding box, smallest diameter, and related problems on imprecise points
- Constructing strongly convex approximate hulls with inaccurate primitives
- Preprocessing Imprecise Points and Splitting Triangulations
- Self-improving algorithms for delaunay triangulations
- On Approximating the Depth and Related Problems
- A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS
- ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS
- Delaunay Triangulations in O(sort(n)) Time and More
This page was built for publication: Preprocessing imprecise points for Delaunay triangulation: simplified and extended
