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.
Lectures on Discrete Geometry
and over one million other books are available for Amazon Kindle.
Learn more
FREE Two-Day Shipping for Students. Learn more |
| ||||||||||||||||||||
 Sell Back Your Copy for $3.96
Whether you buy it used on Amazon for $43.00 or somewhere else, you can sell it back through our Book Trade-In Program at the current price of $3.96.
Used Price$43.00
Trade-in Price$3.96
Price after
Trade-in$39.04 |
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Frequently Bought Together
Editorial Reviews
Review
From the reviews: "Discrete geometry is not quite a newcomer on the stage of mathematics. … The book under review covers … a gap in the pedagogical literature, providing an expository treatment of a wide range of topics in discrete geometry, without assuming too many prerequisites from the reader. … it will be ideal to be used both as a textbook and for self-study. … In fact … this book can be used as a ‘mathematical companion’ to a textbook on computational geometry … ." (Paul A. Blaga, Studia Universitatis Babes-Bolyai Mathematica, Vol. XLVIII (1), March, 2004) "Matoušek’s excellent new book concerns discrete geometry. … The style is clear and pleasant; things are streamlined and collected in one place, and are explained on simple, concrete examples. … a final chapter on ‘What was it about? An informal summary’ was an innovation that I found to be an excellent idea. Lectures on discrete geometry is a splendid book. I recommend it both to students and researchers in the field, as well as to those who like mathematics for its own inherent beauty." (Imre Bárány, Bulletin of the London Mathematical Society, Issue 35, 2003) "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." (L’ENSEIGNEMENT MATHEMATIQUE, Vol. 48 (3-4), 2002) "This is an introduction to the field of discrete geometry understood as the investigation of combinatorial properties of configurations of (usually finitely many) geometric objects … . The book is written in a lively and stimulating but very precise style and contains many figures. It gives a good impression of the richness and the relevance of the field." (Johann Linhart, Zentralblatt Math, Vol. 999 (24), 2002)
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.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
0 of 11 people found the following review helpful:
5.0 out of 5 stars
excellent product and service,
By
Amazon Verified Purchase(What's this?)
This review is from: Lectures on Discrete Geometry (Graduate Texts in Mathematics) (Paperback)
hi,
i'd like to thank you for excellent product and service. i got the book very shortly after ordering it, and much time(!) before your commitment. i found this book very helpful for my studies. thanks again, shai
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
First Sentence:
Linear subspaces. Let Rd denote the d-dimensional Euclidean space. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
first selection lemma, halving edges, cutting lemma, convex independent subset, flattening lemma, centerpoint theorem, crossing number theorem, shatter function lemma, weak perfect graph conjecture, interleaving lemma, fractional transversal, algebraic surface patches, order polytope, intersecting convex hulls, nonrepetitive segments, pseudoline arrangements, zone theorem, transversal number, spherical polytope, enclosing ellipsoid, cyclic polytope, net theorem, blue facets, hyperplane transversals, regularity lemma Key Phrases - Capitalized Phrases (CAPs): (learn more)
Davenport Schinzel, Exercises Let, Johnson Lindenstrauss, Approximating Convex Bodies, General Preliminaries, Handbook of Convex Geometry, Use Ramsey New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Linear subspaces. Let Rd denote the d-dimensional Euclidean space. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
first selection lemma, halving edges, cutting lemma, convex independent subset, flattening lemma, centerpoint theorem, crossing number theorem, shatter function lemma, weak perfect graph conjecture, interleaving lemma, fractional transversal, algebraic surface patches, order polytope, intersecting convex hulls, nonrepetitive segments, pseudoline arrangements, zone theorem, transversal number, spherical polytope, enclosing ellipsoid, cyclic polytope, net theorem, blue facets, hyperplane transversals, regularity lemma Key Phrases - Capitalized Phrases (CAPs): (learn more)
Davenport Schinzel, Exercises Let, Johnson Lindenstrauss, Approximating Convex Bodies, General Preliminaries, Handbook of Convex Geometry, Use Ramsey New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 100
books:
See all 100 books this book cites
31
books
cite this book:
See all 31 books citing this book
- Linear Algebra (Undergraduate Texts in Mathematics) by Serge Lang in Front Matter, and Back Matter
- Combinatorial Geometry by J?nos Pach in Front Matter, and Back Matter
- Computer Science by C.S. French in Back Matter (1), and Back Matter (2)
- Elliptic Curves: Diophantine Analysis (Grundlehren der mathematischen Wissenschaften) by S. Lang in Back Matter (1), and Back Matter (2)
- Handbook of Discrete and Computational Geometry, Second Edition (Discrete Mathematics and Its Applications) by Jacob E. Goodman in Front Matter, and Back Matter
See all 100 books this book cites
- Convex Polytopes (Graduate Texts in Mathematics) by Branko Grunbaum in Back Matter (1), and Back Matter (2)
- FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science by Manindra Agrawal on page 310
- Additive Combinatorics (Cambridge Studies in Advanced Mathematics) by Terence Tao in Back Matter
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques: 8th International Workshop on Approximation Algorithms for ... Computer Science and General Issues) by Chandra Chekuri on page 122
- Dynamics of Infinite-dimensional Groups: The Ramsey-Dvoretzky-Milman Phenomenon (University Lecture Series) by Vladimir Pestov in Back Matter
See all 31 books citing this book
Books on Related Topics
(learn more)
|
What Other Items Do Customers Buy After Viewing This Item?
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
