On the zone of a surface in a hyperplane arrangement
From MaRDI portal
Publication:1209841
DOI10.1007/BF02189317zbMath0773.52007OpenAlexW2080052061MaRDI QIDQ1209841
Boris Aronov, Micha Sharir, Marco Pellegrini
Publication date: 16 May 1993
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131243
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)
Related Items
On range searching with semialgebraic sets ⋮ On joints in arrangements of lines in space and related problems ⋮ On stabbing lines for convex polyhedra in 3D ⋮ Castles in the air revisited ⋮ 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 ⋮ Point location in zones of \(k\)-flats in arrangements ⋮ A note on visibility-constrained Voronoi diagrams ⋮ On the zone of a circle in an arrangement of lines ⋮ On the zone of a circle in an arrangement of lines ⋮ Diameter, width, closest line pair, and parametric searching ⋮ A new technique for analyzing substructures in arrangements of piecewise linear surfaces ⋮ On range searching with semialgebraic sets ⋮ Clamshell casting ⋮ 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
Cites Work
- On the sum of squares of cell complexities in hyperplane arrangements
- Efficient ray shooting and hidden surface removal
- Castles in the air revisited
- On the Zone Theorem for Hyperplane Arrangements
- On range searching with semialgebraic sets
- On the Betti Numbers of Real Varieties
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
