On levels in arrangements and Voronoi diagrams

Recommendations

Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
The complexity of many cells in arrangements of planes and related problems
On levels in arrangements of lines, segments, planes, and triangles
On levels in arrangements of surfaces in three dimensions
On levels in arrangements of surfaces in three dimensions

Cites work

scientific article; zbMATH DE number 43279 (Why is no real title available?)
scientific article; zbMATH DE number 3303655 (Why is no real title available?)
scientific article; zbMATH DE number 3407703 (Why is no real title available?)
Constructing Arrangements of Lines and Hyperplanes with Applications
Edge-skeletons in arrangements with applications
Halfspace range search: An algorithmic application of k-sets
More on k-sets of finite sets in the plane
New applications of random sampling in computational geometry
On k-Hulls and Related Problems
On k-Nearest Neighbor Voronoi Diagrams in the Plane
On the number of k-subsets of a set of n points in the plane
The number of small semispaces of a finite set of points in the plane
Voronoi diagrams and arrangements
Voronoi diagrams from convex hulls

Cited in

(24)

On the total weight of arrangements of halfplanes
scientific article; zbMATH DE number 7559262 (Why is no real title available?)
Unbounded regions of high-order Voronoi diagrams of lines and line segments in higher dimensions
A simple algorithm for higher-order Delaunay mosaics and alpha shapes
Randomized geometric algorithms and pseudorandom generators
A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis
The Clarkson–Shor Technique Revisited and Extended
The edge labeling of higher order Voronoi diagrams
Levelness of Order Polytopes
The Clarkson-Shor technique revisited and extended
\(k\)-violation linear programming
Arrangements of oriented hyperplanes
On the complexity of the \(k\)-level in arrangements of pseudoplanes
Dynamic half-space range reporting and its applications
The \(k\)-nearest-neighbor Voronoi diagram revisited
On geometric optimization with few violated constraints
scientific article; zbMATH DE number 1507307 (Why is no real title available?)
Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
On the arrangement of stochastic lines in \(\mathbb{R}^2\)
Approximating the k-Level in Three-Dimensional Plane Arrangements
An introduction to randomization in computational geometry
Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements
The impact of heterogeneity and geometry on the proof complexity of random satisfiability
Fully dynamic Delaunay triangulation in logarithmic expected per operation

This page was built for publication: On levels in arrangements and Voronoi diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804321)