Abstract
We have seen in Chapters 7 and 8 that there are optimal algorithms known for constructing a complete arrangement of hyperplanes (Chapter 7) and for constructing a single cell in an arrangement provided the number of dimensions is even or equal to three (Chapter 8). Less satisfying methods are available if a structure in an arrangement is to be computed that is more complicated than a single cell. There are two obvious strategies for such computations, which are not without disadvantages, however.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Edelsbrunner, H. (1987). Skeletons in Arrangements. In: Algorithms in Combinatorial Geometry. EATCS Monographs in Theoretical Computer Science, vol 10. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61568-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-61568-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64873-1
Online ISBN: 978-3-642-61568-9
eBook Packages: Springer Book Archive