Lectures on Discrete Geometry (Graduate Texts in Mathematics, 212) - Hardcover

Matousek, Jiri

  • 3.80 out of 5 stars
    5 ratings by Goodreads
 
9780387953731: Lectures on Discrete Geometry (Graduate Texts in Mathematics, 212)
Hardcover
ISBN 10: 0387953736 ISBN 13: 9780387953731
Publisher: Springer, 2002

Synopsis

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.

"synopsis" may belong to another edition of this title.

From the Back Cover

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.

"About this title" may belong to another edition of this title.

Publisher
Springer
Publication date
2002
Language
English
ISBN 10 
0387953736
ISBN 13 
9780387953731
Binding
Hardcover
Number of pages
502
Rating
  • 3.80 out of 5 stars
    5 ratings by Goodreads

Other Popular Editions of the Same Title

9780387953748: Lectures on Discrete Geometry (Graduate Texts in Mathematics, 212)

Featured Edition

ISBN 10:  0387953744 ISBN 13:  9780387953748
Publisher: Springer, 2002
Softcover