Lectures Discrete Geometry by Jiri (34 results)

Soft cover. Condition: Near Fine. Near fine soft cover, unmarked, price sticker on the back cover.

Paperback. Condition: Good. It's a preowned item in good condition and includes all the pages. It may have some general signs of wear and tear, such as markings, highlighting, slight damage to the cover, minimal wear to the binding, etc., but they will not affect the overall reading experience. Softcover reprint of the original 1st ed. 2002.

Condition: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,800grams, ISBN:9780387953748.

Condition: New.

Paperback. Condition: new. Paperback. 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. Discrete geometry investigates combinatorial properties of configurations of geometric objects. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Condition: New.

Condition: New. In.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New.

hardcover. Condition: VeryGood. A copy that may have been read, very minimal wear and tear. May have a remainder mark.

Condition: New.

Hardcover. Condition: new. Hardcover. 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. Discrete geometry investigates combinatorial properties of configurations of geometric objects. This book is primarily a textbook introduction to various areas of discrete geometry. In each area, it explains several key results and techniques. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Condition: As New. Unread book in perfect condition.

Condition: New. In.

Condition: New. 2002. Paperback. . . . . .

Condition: New.

Paperback. Condition: Like New. Like New. book.

Condition: As New. Unread book in perfect condition.

paperback. Condition: New. In shrink wrap. Looks like an interesting title!

Taschenbuch. Condition: 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 504 pp. Englisch.

Condition: New. 2002. Paperback. . . . . . Books ship from the US and Ireland.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Condition: 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.

Condition: Gut. Zustand: Gut | Sprache: Englisch | Produktart: Bücher.

Condition: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher.

Paperback. Condition: new. Paperback. 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. Discrete geometry investigates combinatorial properties of configurations of geometric objects. 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Buch. Condition: 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.

Hardcover. Condition: new. Hardcover. 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. Discrete geometry investigates combinatorial properties of configurations of geometric objects. This book is primarily a textbook introduction to various areas of discrete geometry. In each area, it explains several key results and techniques. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

XVI, 481 pp. Soft cover. A near fine copy. (Graduate Texts in Mathematics, 212.).