Lectures on Discrete Geometry

· Graduate Texts in Mathematics Boek 212 · Springer Science & Business Media
E-boek
486
Bladsye
Graderings en resensies word nie geverifieer nie. Kom meer te wete

Meer oor hierdie e-boek

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.

Gradeer hierdie e-boek

Sê vir ons wat jy dink.

Lees inligting

Slimfone en tablette
Installeer die Google Play Boeke-app vir Android en iPad/iPhone. Dit sinkroniseer outomaties met jou rekening en maak dit vir jou moontlik om aanlyn of vanlyn te lees waar jy ook al is.
Skootrekenaars en rekenaars
Jy kan jou rekenaar se webblaaier gebruik om na oudioboeke wat jy op Google Play gekoop het, te luister.
E-lesers en ander toestelle
Om op e-inktoestelle soos Kobo-e-lesers te lees, moet jy ’n lêer aflaai en dit na jou toestel toe oordra. Volg die gedetailleerde hulpsentrumaanwysings om die lêers na ondersteunde e-lesers toe oor te dra.