Surveys On Discrete And Computational Geometry
Download Surveys On Discrete And Computational Geometry PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Surveys On Discrete And Computational Geometry book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Surveys on Discrete and Computational Geometry
Author: Jacob E. Goodman
language: en
Publisher: American Mathematical Soc.
Release Date: 2008
This volume contains nineteen survey papers describing the state of current research in discrete and computational geometry as well as a set of open problems presented at the 2006 AMS-IMS-SIAM Summer Research Conference Discrete and Computational Geometry--Twenty Years Later, held in Snowbird, Utah, in June 2006. Topics surveyed include metric graph theory, lattice polytopes, the combinatorial complexity of unions of geometric objects, line and pseudoline arrangements, algorithmic semialgebraic geometry, persistent homology, unfolding polyhedra, pseudo-triangulations, nonlinear computational geometry, $k$-sets, and the computational complexity of convex bodies.
Lectures on Discrete Geometry
Author: Jiri Matousek
language: en
Publisher: Springer Science & Business Media
Release Date: 2013-12-01
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.
Research Problems in Discrete Geometry
Author: Peter Brass
language: en
Publisher: Springer Science & Business Media
Release Date: 2006-01-27
This book is the result of a 25-year-old project and comprises a collection of more than 500 attractive open problems in the field. The largely self-contained chapters provide a broad overview of discrete geometry, along with historical details and the most important partial results related to these problems. This book is intended as a source book for both professional mathematicians and graduate students who love beautiful mathematical questions, are willing to spend sleepless nights thinking about them, and who would like to get involved in mathematical research.