Abstract
In Chapter 1 we covered three simple but basic theorems in the theory of convexity: Helly’s, Radon’s, and Carathéodory’s. For each of them we present one closely related but more difficult theorem in the current chapter. These more advanced relatives are selected, among the vast number of variations on the Helly-Radon-Carathéodory theme, because of their wide applicability and also because of nice techniques and tricks appearing in their proofs.
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
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Matoušek, J. (2002). Intersection Patterns of Convex Sets. In: Matoušek, J. (eds) Lectures on Discrete Geometry. Graduate Texts in Mathematics, vol 212. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-0039-7_8
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0039-7_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-95374-8
Online ISBN: 978-1-4613-0039-7
eBook Packages: Springer Book Archive