AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Combinatorial Geometry and Its Algorithmic Applications: The Alcalá Lectures
About this Title
János Pach, Courant Institute of Mathematical Sciences, New York, NY and Micha Sharir, Tel Aviv University, Tel Aviv, Israel
Publication: Mathematical Surveys and Monographs
Publication Year:
2009; Volume 152
ISBNs: 978-0-8218-4691-9 (print); 978-1-4704-1379-8 (online)
DOI: https://doi.org/10.1090/surv/152
MathSciNet review: MR2469102
MSC: Primary 05-02; Secondary 05C35, 05Cxx, 52-02, 52C35, 68R05, 68U05
Table of Contents
Download chapters as PDF
Front/Back Matter
Chapters
- 1. Sylvester-Gallai problem: The beginnings of combinatorial geometry
- 2. Arrangements of surfaces: Evolution of the basic theory
- 3. Davenport-Schinzel sequences: The inverse Ackermann function in geometry
- 4. Incidences and their relatives: From Szemerédi and Trotter to cutting lenses
- 5. Crossing numbers of graphs: Graph drawing and its applications
- 6. Extremal combinatorics: Repeated patterns and pattern recognition
- 7. Lines in space: From ray shooting to geometric transversals
- 8. Geometric coloring problems: Sphere packings and frequency allocation
- 9. From Sam Loyd and László Fejes Tóth: The 15 puzzle and motion planning