We review recent progress in the study of arrangements of surfaces in higher dimensions. This progress involves new and nearly tight bounds on the complexity of lower envelopes, single cells, zones, and other substructures in such arrangements, and the design of efficient algorithms (near optimal in the worst case) for constructing and manipulating these structures. We then present applications of the new results to a variety of problems in computational geometry and its applications, including motion planning, Voronoi diagrams, union of geometric objects, visibility, and geometric optimization. © Springer-Verlag Berlin Heidelberg 1999.
CITATION STYLE
Sharir, M. (1999). Recent developments in the theory of arrangements of surfaces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1738, pp. 1–21). Springer Verlag. https://doi.org/10.1007/3-540-46691-6_1
Mendeley helps you to discover research relevant for your work.