Abstract
We show that, for any collection ℋ ofn hyperplanes in ℜ4, the combinatorial complexity of thevertical decomposition of the arrangementA(ℋ) of ℋ isO(n 4 logn). The proof relies on properties of superimposed convex subdivisions of 3-space, and we also derive some other results concerning them.
Article PDF
Similar content being viewed by others
References
B. Aronov, J. Matouŝek, and M. Sharir, On the sum of squares of cell complexities in hyperplane arrangements.J. Combin. Theory Ser. A 65 (1994), 311–321.
F. Aurenhammer, A criterion for the affine equivalence of cell complexes inR d and convex polyhedra inR d+1,Discrete Comput. Geom. 2 (1987), 49–64.
B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, A singly exponential stratification scheme for real semi-algebraic varieties and its applications.Theoret. Comput. Sci. 84 (1991), 77–105. Also inProc. 16th Internat. Colloq. on Automata, Languages and Programming, 1989, pp. 179–193.
K. Clarkson, A randomized algorithm for closest point queries.SIAM J. Comput. 17 (1988), 830–847.
Author information
Authors and Affiliations
Additional information
Work on this paper by Leonidas Guibas and Micha Sharir has been supported by a grant from the U.S.-Israeli Binational Science Foundation. Work by Leonidas Guibas was also supported by National Science Foundation Grant CCR-9215219. Work by Micha Sharir was also supported by National Science Foundation Grant CCR-91-22103, and by grants from the G.I.F.—the German Isreali Foundation for Scientific Research and Development, and the Fund for Basic Research administered by the Israeli Academy of Sciences. Work by Jiří Matouŝek was done while he was visiting Tel Aviv University, and its was partially supported by a Humboldt Research Fellowship. Work on this paper by Dan Halperin was carried out while he was at Tel Aviv University.
Rights and permissions
About this article
Cite this article
Guibas, L.J., Halperin, D., Matoušek, J. et al. Vertical decomposition of arrangements of hyperplanes in four dimensions. Discrete & Computational Geometry 14, 113–122 (1995). https://doi.org/10.1007/BF02570698
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02570698