Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
A singly exponential stratification scheme for real semi-algebraic varieties and its applications
Theoretical Computer Science
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Voronoi diagrams of lines in 3-space under polyhedral convex distance functions
Journal of Algorithms - Special issue on SODA '95 papers
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
SIAM Journal on Computing
Almost Tight Upper Bounds for Vertical Decompositions in Four Dimensions
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We show that the complexity of the overlay of two envelopes of arrangements of n semi-algebraic surfaces or surface patches of constant description complexity in four dimensions is O(n4-1/⌈s/2⌉+ε), for any ε 0, where s is a constant related to the maximal degree of the surfaces. This is the first non-trivial (sub-quartic) bound for this problem, and for s = 1, 2 it almost matches the near-cubic lower bound. We discuss several applications of this result, including (i) an improved bound for the complexity of the region enclosed between two envelopes in four dimensions, (ii) an improved bound for the complexity of the space of all hyperplane transversals of a collection of simply-shaped convex sets in 4-space, (iii) an improved bound for the complexity of the space of all line transversals of a similar collection of sets in 3-space, and (iv) improved bounds for the complexity of the union of certain families of objects in four dimensions. The analysis technique we introduce is quite general, and has already proved useful in unrelated contexts.