Almost tight upper bounds for the single cell and zone problems in three dimensions
- 1 December 1995
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 14 (4) , 385-410
- https://doi.org/10.1007/bf02570714
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- On the sum of squares of cell complexities in hyperplane arrangementsJournal of Combinatorial Theory, Series A, 1994
- On the complexity of a single cell in certain arrangements of surfaces related to motion planningDiscrete & Computational Geometry, 1994
- Computing a Face in an Arrangement of Line Segments and Related ProblemsSIAM Journal on Computing, 1993
- On the Zone Theorem for Hyperplane ArrangementsSIAM Journal on Computing, 1993
- Arrangements of curves in the plane—topology, combinatorics, and algorithmsTheoretical Computer Science, 1992
- Onk-sets in arrangements of curves and surfacesDiscrete & Computational Geometry, 1991
- On the two-dimensional davenport-schinzel problemJournal of Symbolic Computation, 1990
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequencesJournal of Combinatorial Theory, Series A, 1989
- Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemesCombinatorica, 1986
- The maximum numbers of faces of a convex polytopeMathematika, 1970