Discrete geometry investigates combinatorial properties of configurations of geometric objects. Its development in recent years has been stimulated by applications in combinatorial optimization and computational geometry. To a working mathematician or computer scientist, it offers sophisticated results and techniques of great diversity. This book is primarily a textbook introduction to various areas of discrete geometry. In each area, it explains several key results and techniques, in an accessible and concrete manner. The book also contains more advanced material in separate sections and thus it can also serve as a collection of up-to-date surveys in
Klappentext
The main topics in this introductory text to discrete geometry include basics on convex sets, convex polytopes and hyperplane arrangements, combinatorial complexity of geometric configurations, intersection patterns and transversals of convex sets, geometric Ramsey-type results, and embeddings of finite metric spaces into normed spaces. In each area, the text explains several key results and methods.
Inhalt
* Preface * Notation and Terminology * Convexity * Lattices and Minkowski's Theorem * Convex Independent Subsets * Incidence Problems * Convex Polytopes * Number of Faces in Arrangements * Lower Envelopes * More Theorems in Convexity * Geometric Selection Theorems * Transversals and Epsilon-Nets * Attempts to Count k-sets * Two Applications of High-Dimensional Polytopes * Volumes in High Dimension * Measure Concentration and Almost Spherical Sections * Embedding Finite Metric Spaces into Normed Spaces * What Was It About: An Informal Summary * Bibliography * Index