Cell complexities in hyperplane arrangements
DOI10.1007/S00454-003-0854-ZzbMATH Open1072.52019OpenAlexW2029272180MaRDI QIDQ701778FDOQ701778
Authors: Boris Aronov, Micha Sharir 
Publication date: 16 December 2004
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-003-0854-z
Recommendations
Analysis of algorithms and problem complexity (68Q25) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)
Cited In (17)
- Title not available (Why is that?)
- A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search
- Cells in $n$-fold hyperspaces
- Thinning on cell complexes from polygonal tilings
- Title not available (Why is that?)
- Sharp bounds for vertical decompositions of linear arrangements in four dimensions
- Title not available (Why is that?)
- The complexity of many cells in arrangements of planes and related problems
- On the zone of a surface in a hyperplane arrangement
- Classification of arrangements by the number of their cells
- The complexity of cells in three-dimensional arrangements
- Title not available (Why is that?)
- Cells with many facets in arrangements of hyperplanes
- Enumerating colorings, tensions and flows in cell complexes
- Vertical decomposition of arrangements of hyperplanes in four dimensions
- Enumerating regular mixed-cell configurations
- Semispaces of configurations, cell complexes of arrangements
This page was built for publication: Cell complexities in hyperplane arrangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q701778)
