On the Zone Theorem for Hyperplane Arrangements

DOI10.1137/0222031zbMATH Open0778.52007OpenAlexW1984529618MaRDI QIDQ4032948FDOQ4032948

Authors: 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

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

zbMATH Keywords

computational geometryarrangements of hyperplaneszone theorempseudohyperplane arrangements

Mathematics Subject Classification ID

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

Cited In (37)

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

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)