On the Zone Theorem for Hyperplane Arrangements
From MaRDI portal
Publication:4032948
DOI10.1137/0222031zbMath0778.52007OpenAlexW1984529618MaRDI QIDQ4032948
Raimund Seidel, Herbert Edelsbrunner, Micha Sharir
Publication date: 17 May 1993
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0222031
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)
Related Items
2-point site Voronoi diagrams, On stabbing lines for convex polyhedra in 3D, Castles in the air revisited, Point set pattern matching in \(d\)-dimensions, Better lower bounds on detecting affine and spherical degeneracies, Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications, Almost tight upper bounds for the single cell and zone problems in the three dimensions, Space–Query-Time Tradeoff for Computing the Visibility Polygon, Point location in zones of \(k\)-flats in arrangements, All-maximum and all-minimum problems under some measures, On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space, Nonparametric Maximum Likelihood Methods for Binary Response Models With Random Coefficients, Efficient algorithms for maximum regression depth, Zone theorem for arrangements in dimension three, On counting pairs of intersecting segments and off-line triangle range searching, A theorem on the average number of subfaces in arrangements and oriented matroids, The number of edges of many faces in a line segment arrangement, On the zone of a surface in a hyperplane arrangement, Algorithms for marketing-mix optimization, On the restricted 1-Steiner tree problem, Polygonal chains cannot lock in 4D, On lazy randomized incremental construction, Complexity and algorithms for finding a subset of vectors with the longest sum, A new technique for analyzing substructures in arrangements of piecewise linear surfaces, On the restricted \(k\)-Steiner tree problem, Robot motion planning and the single cell problem in arrangements, On the zone of the boundary of a convex body, Optimal Algorithms for Geometric Centers and Depth, On the sum of squares of cell complexities in hyperplane arrangements, Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes, Computing Shapley values in the plane
