scientific article; zbMATH DE number 6693709
From MaRDI portal
Publication:2968075
Recommendations
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Delaunay triangulations of imprecise pointsin linear time after preprocessing
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Delaunay Triangulation of Imprecise Points Simplified and Extended
- Preprocessing Imprecise Points and Splitting Triangulations
- Preprocessing Imprecise Points and Splitting Triangulations
- Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
- Fast Delaunay triangulation in three dimensions
- Fast range searching with Delaunay triangulations
- A fast algorithm for well-spaced points and approximate Delaunay graphs
Cited in
(12)- Delaunay triangulation of imprecise points in linear time after preprocessing
- Delaunay Triangulation of Imprecise Points Simplified and Extended
- Dense point sets have sparse Delaunay triangulations or ``\dots but not too nasty
- Delaunay triangulations of imprecise pointsin linear time after preprocessing
- Unions of onions: preprocessing imprecise points for fast onion layer decomposition
- Preprocessing Imprecise Points and Splitting Triangulations
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Preprocessing Imprecise Points and Splitting Triangulations
- 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
- Unions of onions: preprocessing imprecise points for fast onion decomposition
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2968075)
