On the complexity of d-dimensional Voronoi diagrams
From MaRDI portal
Publication:599355
DOI10.1007/BF01224932zbMATH Open0414.52004OpenAlexW2332151900MaRDI QIDQ599355FDOQ599355
Authors: Victor Klee
Publication date: 1980
Published in: Archiv der Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01224932
Cites Work
Cited In (17)
- On some proximity problems of colored sets
- An approximate algorithm for computing multidimensional convex hulls
- The impact of heterogeneity and geometry on the proof complexity of random satisfiability
- Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems
- Tetrahedrizing point sets in three dimensions
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
- On the randomized construction of the Delaunay tree
- Title not available (Why is that?)
- Voronoi Diagrams of Moving Points
- Representing stereo data with the Delaunay triangulation
- Illuminating high-dimensional convex sets
- Kernel interpolation
- Unbounded regions of high-order Voronoi diagrams of lines and line segments in higher dimensions
- A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations
- Stratifying high-dimensional data based on proximity to the convex hull boundary
- Simplex based space filling designs
- Arbitrarily large neighborly families of symmetric convex polytopes
This page was built for publication: On the complexity of d-dimensional Voronoi diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q599355)