Preprocessing imprecise points for Delaunay triangulation: simplified and extended
From MaRDI portal
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
- scientific article; zbMATH DE number 1786519 (Why is no real title available?)
- 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
- Almost-Delaunay simplices, nearest neighbor relations for imprecise points
- Approximating the minimum weight Steiner triangulation
- Computational geometry. Algorithms and applications.
- Computing hereditary convex structures
- Constructing strongly convex approximate hulls with inaccurate primitives
- Delaunay Triangulations in O(sort(n)) Time and More
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Efficient update strategies for geometric computing with uncertainty
- Guarding scenes against invasive hypercubes.
- Largest bounding box, smallest diameter, and related problems on imprecise points
- Linear size binary space partitions for uncluttered scenes
- ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS
- On Approximating the Depth and Related Problems
- PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS
- Preprocessing Imprecise Points and Splitting Triangulations
- Provably good mesh generation
- Self-improving algorithms for delaunay triangulations
- Sharp quantum versus classical query complexity separations
- Splitting a Delaunay triangulation in linear time
- The complexity of the free space for motion planning amidst fat obstacles
- Triangulating a simple polygon in linear time
- Triangulating input-constrained planar point sets
- Well-separated pair decomposition in linear time?
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
- Triangles and girth in disk graphs and transmission graphs
- 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
- scientific article; zbMATH DE number 6693709 (Why is no real title available?)
- 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
- 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)
