The complexity of many cells in arrangements of planes and related problems

34Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We consider several problems involving points and planes in three dimensions. Our main results are: (i) The maximum number of faces bounding m distinct cells in an arrangement of n planes is O(m2/3n log n +n2); we can calculate m such cells specified by a point in each, in worst-case time O(m2/3n log3n+n2 log n). (ii) The maximum number of incidences between n planes and m vertices of their arrangement is O(m2/3n log n+n2), but this number is only O(m3/5-δn4/5+2 δ+m+n log m), for any δ>0, for any collection of points no three of which are collinear. (iii) For an arbitrary collection of m points, we can calculate the number of incidences between them and n planes by a randomized algorithm whose expected time complexity is O((m3/4-δn3/4+3 δ+m) log2n+n log n log m) for any δ>0. (iv) Given m points and n planes, we can find the plane lying immediately below each point in randomized expected time O([m3/4-δn3/4+3 δ+m] log2n+n log n log m) for any δ>0. (v) The maximum number of facets (i.e., (d-1)-dimensional faces) bounding m distinct cells in an arrangement of n hyperplanes in d dimensions, d>3, is O(m2/3nd/3 log n+nd-1). This is also an upper bound for the number of incidences between n hyperplanes in d dimensions and m vertices of their arrangement. The combinatorial bounds in (i) and (v) and the general bound in (ii) are almost tight. © 1990 Springer-Verlag New York Inc.

Cite

CITATION STYLE

APA

Edelsbrunner, H., Guibas, L., & Sharir, M. (1990). The complexity of many cells in arrangements of planes and related problems. Discrete & Computational Geometry, 5(1), 197–216. https://doi.org/10.1007/BF02187785

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free