Preprocessing imprecise points for Delaunay triangulation: simplified and extended
From MaRDI portal
Publication:644800
DOI10.1007/S00453-010-9430-0zbMATH Open1225.68263OpenAlexW2147026670MaRDI QIDQ644800FDOQ644800
Authors: Kevin Buchin, Maarten Löffler, Pat Morin, Wolfgang Mulzer 
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
Recommendations
- Delaunay Triangulation of Imprecise Points Simplified and Extended
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Delaunay triangulations of imprecise pointsin linear time after preprocessing
- scientific article; zbMATH DE number 6693709
- Preprocessing Imprecise Points and Splitting Triangulations
- Preprocessing Imprecise Points and Splitting Triangulations
- Almost-Delaunay simplices, nearest neighbor relations for imprecise points
- Correct Delaunay triangulation in the presence of inexact inputs and arithmetic
- Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL
- Delaunay triangulation of non-uniform point distributions by means of multi-grid insertion
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
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- On Approximating the Depth and Related Problems
- Sharp quantum versus classical query complexity separations
- 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
- Computing hereditary convex structures
- Largest bounding box, smallest diameter, and related problems on imprecise points
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Guarding scenes against invasive hypercubes.
- Preprocessing Imprecise Points and Splitting Triangulations
- ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS
- Delaunay Triangulations in O(sort(n)) Time and More
- Approximating the minimum weight Steiner triangulation
- Title not available (Why is that?)
- 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
- Well-separated pair decomposition in linear time?
- Triangulating input-constrained planar point sets
Cited In (20)
- Faster algorithms for growing prioritized disks and rectangles
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Dynamic connectivity in disk graphs
- Computability of partial Delaunay triangulation and Voronoi diagram (extended abstract)
- Delaunay Triangulation of Imprecise Points Simplified and Extended
- Fréchet Distance for Uncertain Curves
- Preclustering algorithms for imprecise points
- Delaunay triangulations of imprecise pointsin linear time after preprocessing
- Computing the Fréchet distance between uncertain curves in one dimension
- On algorithmic complexity of imprecise spanners
- Computing the Fréchet distance between uncertain curves in one dimension
- Title not available (Why is that?)
- Minimizing co-location potential of moving entities
- Preprocessing Imprecise Points and Splitting Triangulations
- Preprocessing Imprecise Points and Splitting Triangulations
- An algorithmic framework for the single source shortest path problem with applications to disk graphs
- Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
- Title not available (Why is that?)
- Minimizing the diameter of a spanning tree for imprecise points
- Preprocessing Ambiguous Imprecise Points
This page was built for publication: Preprocessing imprecise points for Delaunay triangulation: simplified and extended
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644800)
