The complexity of many cells in arrangements of planes and related problems
- 1 March 1990
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 5 (2) , 197-216
- https://doi.org/10.1007/bf02187785
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- New applications of random sampling in computational geometryDiscrete & Computational Geometry, 1987
- ɛ-nets and simplex range queriesDiscrete & Computational Geometry, 1987
- The complexity of cells in three-dimensional arrangementsDiscrete Mathematics, 1986
- Constructing Arrangements of Lines and Hyperplanes with ApplicationsSIAM Journal on Computing, 1986
- On the maximal number of edges of many faces in an arrangementJournal of Combinatorial Theory, Series A, 1986
- How to search in historyInformation and Control, 1985
- Fast detection of polyhedral intersectionTheoretical Computer Science, 1983
- Extremal problems in discrete geometryCombinatorica, 1983
- Finding the intersection of n half-spaces in time O(n log n)Theoretical Computer Science, 1979
- A theorem on arrangements of lines in the planeIsrael Journal of Mathematics, 1969