Bounding the number of k-faces in arrangements of hyperplanes
- 15 April 1991
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 31 (2) , 151-165
- https://doi.org/10.1016/0166-218x(91)90067-7
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Combinatorial face enumeration in arrangements and oriented matroidsDiscrete Applied Mathematics, 1991
- Combinatorial complexity bounds for arrangements of curves and spheresDiscrete & Computational Geometry, 1990
- An optimal algorithm for intersecting line segments in the planePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- A fast planar partition algorithm. IPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Constructing Arrangements of Lines and Hyperplanes with ApplicationsSIAM Journal on Computing, 1986
- The power of geometric dualityBIT Numerical Mathematics, 1985
- Convexity in oriented matroidsJournal of Combinatorial Theory, Series B, 1980
- Combinatorics and topology of complements of hyperplanesInventiones Mathematicae, 1980
- Orientability of matroidsJournal of Combinatorial Theory, Series B, 1978
- Partition of SpaceThe American Mathematical Monthly, 1943