Almost tight upper bounds for the single cell and zone problems in three dimensions

Discrete & Computational Geometry

Volumn 14, Issue 1, 1995, Pages 385-410

  Halperin, D ^a   Sharif, M ^b,c  

^a STANFORD UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21844493276     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/BF02570714     Document Type: Article

References (27)

1. Sharp upper and lower bounds for the length of general Davenport-Schinzel sequences
2. On the sum of squares of cell complexities in hyperplane arrangements
3. On the zone of a surface in a hyperplane arrangement
4. Triangles in space, or building (and analyzing) castles in the air
5. Castles in the air revisited
6. Computing a face in an arrangement of line segments and related problems
7. Applications of random sampling in computational geometry, II
8. Arrangements of curves in the plane-tology, combinatorics, and algorithms
9. On the zone theorem in hyperplane arrangements
10. On the general motion planning problem with two degrees of freedom
11. On the complexity of a single cell in certain arrangements of surfaces related to motion planning
12. New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
13. Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
14. The maximum number of faces of a convex polytope
15. The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: combinatorial analysis
16. On the number of cells defined by a set of polynomials
17. On the two-dimensional Davenport-Schinzel problem
18. On k-sets in arrangements of curves and surfaces
19. Almost tight upper bounds for lower envelopes in higher dimensions