On the complexity of d-dimensional Voronoi diagrams
From MaRDI portal
Publication:599355
Cites work
- scientific article; zbMATH DE number 3153257 (Why is no real title available?)
- scientific article; zbMATH DE number 3282420 (Why is no real title available?)
- Polytope pairs and their relationship to linear programming
- Some semicontinuity theorems for convex polytopes and cell-complexes
- The complexity of linear programming
- The maximum numbers of faces of a convex polytope
Cited in
(16)- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
- Unbounded regions of high-order Voronoi diagrams of lines and line segments in higher dimensions
- Voronoi Diagrams of Moving Points
- Tetrahedrizing point sets in three dimensions
- Arbitrarily large neighborly families of symmetric convex polytopes
- Simplex based space filling designs
- On the randomized construction of the Delaunay tree
- Representing stereo data with the Delaunay triangulation
- Stratifying high-dimensional data based on proximity to the convex hull boundary
- An approximate algorithm for computing multidimensional convex hulls
- Illuminating high-dimensional convex sets
- Kernel interpolation
- Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems
- The impact of heterogeneity and geometry on the proof complexity of random satisfiability
- scientific article; zbMATH DE number 7561744 (Why is no real title available?)
- On some proximity problems of colored sets
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)
