Abstract
A non-vertical hyperplane h, disjoint from a finite set P of points, partitions P into two sets P+ = P∩h+ and P- = P∩h- called semispaces of P, where h+ is the open half-space above hyperplane h and h- is the open half-space below h. Note that this definition includes the empty set and P itself as semispaces of P. Using geometric transformations and the face counting formulas for arrangements of hyper planes presented in Chapter 1, it is not hard to find tight upper bounds on the number of semispaces of P that depend solely on the cardinality of P. Unfortunately, little is known about the maximum number of semispaces with some fixed cardinality. This chapter addresses the latter counting problem and derives non-trivial upper and lower bounds.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). Semispaces of Configurations. 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_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-61568-9_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64873-1
Online ISBN: 978-3-642-61568-9
eBook Packages: Springer Book Archive