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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerGratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerAnbieter: Buchpark, Trebbin, Deutschland
Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 486 | Sprache: Englisch | Produktart: Bücher. Artikel-Nr. 1037038/2
Anzahl: 1 verfügbar
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Softcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 52 MAT 9780387953731 Sprache: Englisch Gewicht in Gramm: 550. Artikel-Nr. 2502282
Anzahl: 1 verfügbar
Anbieter: Books From California, Simi Valley, CA, USA
hardcover. Zustand: Very Good. Artikel-Nr. mon0003635382
Anzahl: 2 verfügbar
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Hardcover. XVI, 481 p. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. C-04688 9780387953731 Sprache: Englisch Gewicht in Gramm: 1150. Artikel-Nr. 2490927
Anzahl: 1 verfügbar
Anbieter: moluna, Greven, Deutschland
Gebunden. Zustand: New. - Quickly leads the reader to the edge of current research- Introduces many important oncepts and techniques on carefully chosen results where technicalities are used- Book does not require any special background beyond undergraduate mathematics. Artikel-Nr. 5912501
Anzahl: Mehr als 20 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Artikel-Nr. ria9780387953731_new
Anzahl: Mehr als 20 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Neuware - 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. Artikel-Nr. 9780387953731
Anzahl: 2 verfügbar