Abstract
In this chapter, we investigate the complexity of the boundary of a certain collection of cells in an arrangement of hyperplanes. We formalize the problem by introducing the notion of a so-called zone which is defined relative to some chosen hyperplane in the arrangement. Intuitively, the zone of a hyperplane h contains all faces in the boundaries of those cells which are supported by h. The introduction of this concept is motivated by an algorithm that constructs an arrangement incrementally, that is, the hyperplanes are inserted one after another (see Chapter 7). A more formal definition of the zone of a hyper plane in terms of visibility is as follows.
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). Zones 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_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-61568-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64873-1
Online ISBN: 978-3-642-61568-9
eBook Packages: Springer Book Archive