Lectures on Discrete Geometry

Jiri Matousek

ISBN 10: 0387953744 / ISBN 13: 9780387953748

Editore: Springer New York Mai 2002, 2002

Riguardo questo articolo

This item is printed on demand - it takes 3-4 days longer - Neuware -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. 504 pp. Englisch.

Codice articolo 9780387953748

Dati bibliografici

• Titolo: Lectures on Discrete Geometry
• Editore: Springer New York Mai 2002
• Data di pubblicazione: 2002
• Lingua: Inglese
• ISBN 10: 0387953744
• ISBN 13: 9780387953748
• Rilegatura: Taschenbuch
• Condizione: Neu
• Dimensioni: 235 L x 155 A x 28 P (millimetri) 235 millimetri di larghezza per 155 millimetri di altezza per 28 millimetri di profondità
• Peso: 756 grammi

Descrizione articolo

Riassunto

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.

Dalla quarta di copertina

Discrete geometry investigates combinatorial properties of configurations of geometric objects. To a working mathematician or computer scientist, it offers sophisticated results and techniques of great diversity and it is a foundation for fields such as computational geometry or combinatorial optimization.

This book is primarily a textbook introduction to various areas of discrete geometry. In each area, it explains several key results and methods, in an accessible and concrete manner. It also contains more advanced material in separate sections and thus it can serve as a collection of surveys in several narrower subfields. The main topics 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; polyhedral combinatorics and high-dimensional convexity; and lastly, embeddings of finite metric spaces into normed spaces.

Jiri Matousek is Professor of Computer Science at Charles University in Prague. His research has contributed to several of the considered areas and to their algorithmic applications. This is his third book.