The overlay of minimization diagrams in a randomized incremental construction
From MaRDI portal
(Redirected from Publication:633216)
Recommendations
- On overlays and minimization diagrams
- Complexity dichotomies for the minimum \(\mathcal{F}\)-overlay problem
- Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem
- Randomized incremental construction of abstract Voronoi diagrams
- scientific article; zbMATH DE number 177830
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Approximating Minimization Diagrams and Generalized Proximity Search
- Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended
- Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended
- Random multi-overlap structures for optimization problems
Cites work
- Applications of random sampling in computational geometry. II
- Approximate halfspace range counting
- Constructing Planar Cuttings in Theory and Practice
- Cylindrical static and kinetic binary space partitions
- scientific article; zbMATH DE number 1220053 (Why is no real title available?)
- scientific article; zbMATH DE number 1303547 (Why is no real title available?)
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- Lectures on Polytopes
- On approximate halfspace range counting and relative epsilon-approximations
- On approximate range counting and depth
- On Approximating the Depth and Related Problems
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting
- Range minima queries with respect to a random permutation, and approximate range counting
- Size-estimation framework with applications to transitive closure and reachability
- Voronoi diagrams and arrangements
Cited in
(8)- On overlays and minimization diagrams
- On the complexity of randomly weighted multiplicative Voronoi diagrams
- An Efficient, Practical Algorithm and Implementation for Computing Multiplicatively Weighted Voronoi Diagrams
- On approximate range counting and depth
- scientific article; zbMATH DE number 7765386 (Why is no real title available?)
- Range minima queries with respect to a random permutation, and approximate range counting
- Relative (p, )-approximations in geometry
- A general approach for cache-oblivious range reporting and approximate range counting
This page was built for publication: The overlay of minimization diagrams in a randomized incremental construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633216)
