This book offers a modern approach to computational geo-metry, an area thatstudies the computational complexity ofgeometric problems. Combinatorial investigations play animportant role in this study.
I Combinatorial Geometry.- 1 Fundamental Concepts in Combinatorial Geometry.- 2 Permutation Tables.- 3 Semispaces of Configurations.- 4 Dissections of Point Sets.- 5 Zones in Arrangements.- 6 The Complexity of Families of Cells.- II Fundamental Geometric Algorithms.- 7 Constructing Arrangements.- 8 Constructing Convex Hulls.- 9 Skeletons in Arrangements.- 10 Linear Programming..- 11 Planar Point Location Search.- III Geometric and Algorithmic Applications.- 12 Problems for Configurations and Arrangements.- 13 Voronoi Diagrams.- 14 Separation and Intersection in the Plane.- 15 Paradigmatic Design of Algorithms.- References.- Appendix A Definitions.- Appendix B Notational Conventions.