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.

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

In this textbook we have tried to make these modem algorithmic solutions accessible to a large audience. The book has been written as a textbook for a course in computational geometry, but it can also be used for self-study.

Covering both volume and surface meshes, the authors fully explain how and why these meshing algorithms work. The book is one of the first to integrate a vast amount of cutting-edge material on Delaunay triangulations.

This book will provide a unique and invaluable source for researchers and graduate students. From the Reviews: "This book is definitely a milestone in the literature of integer programming and combinatorial optimization.

This volume is designed for students and teachers who love mathematics, and can expand on local school curriculum subjects. This first volume addresses various topics in number theory.

The purpose of the book is to present some of the most important techniques and results, mostly on bilipschitz and coarse embeddings.