On the Zone Theorem for Hyperplane Arrangements

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Recommendations

scientific article; zbMATH DE number 637316
Arrangements of curves in the plane --- topology, combinatorics, and algorithms
scientific article; zbMATH DE number 177534
On the zone of a surface in a hyperplane arrangement
On the zone of the boundary of a convex body

Cited in

(37)

The complexity of order type isomorphism
Unbounded regions of high-order Voronoi diagrams of lines and line segments in higher dimensions
Zone theorem for arrangements in dimension three
On counting pairs of intersecting segments and off-line triangle range searching
On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space
On the sum of squares of cell complexities in hyperplane arrangements
Robot motion planning and the single cell problem in arrangements
2-point site Voronoi diagrams
Computing Shapley values in the plane
Space–Query-Time Tradeoff for Computing the Visibility Polygon
scientific article; zbMATH DE number 177534 (Why is no real title available?)
Minimum-width double-slabs and widest empty slabs in high dimensions
On lazy randomized incremental construction
Point location in zones of \(k\)-flats in arrangements
A new technique for analyzing substructures in arrangements of piecewise linear surfaces
Algorithms for marketing-mix optimization
On the restricted \(k\)-Steiner tree problem
All-maximum and all-minimum problems under some measures
Castles in the air revisited
Complexity and algorithms for finding a subset of vectors with the longest sum
Arrangements of curves in the plane --- topology, combinatorics, and algorithms
A theorem on the average number of subfaces in arrangements and oriented matroids
Almost tight upper bounds for the single cell and zone problems in the three dimensions
Nonparametric Maximum Likelihood Methods for Binary Response Models With Random Coefficients
Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes
On stabbing lines for convex polyhedra in 3D
Better lower bounds on detecting affine and spherical degeneracies
Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
On the zone of the boundary of a convex body
On the restricted 1-Steiner tree problem
Efficient algorithms for maximum regression depth
Convex hulls of random order types
Point set pattern matching in \(d\)-dimensions
The number of edges of many faces in a line segment arrangement
On the zone of a surface in a hyperplane arrangement
Polygonal chains cannot lock in 4D
Optimal algorithms for geometric centers and depth

This page was built for publication: On the Zone Theorem for Hyperplane Arrangements

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