Combinatorial Geometry and Its Algorithmic Applications
Regular price
€122.99
14 days return policy
Shipping & Delivery
A01=American Mathematical Society
Author_American Mathematical Society
Category=PBV
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Product details
- ISBN 9780821846919
- Weight: 607g
- Publication Date: 30 Jan 2009
- Publisher: American Mathematical Society
- Publication City/Country: US
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
Based on a lecture series given by the authors at a satellite meeting of the 2006 International Congress of Mathematicians and on many articles written by them and their collaborators, this volume provides a comprehensive up-to-date survey of several core areas of combinatorial geometry. It describes the beginnings of the subject, going back to the nineteenth century (if not to Euclid), and explains why counting incidences and estimating the combinatorial complexity of various arrangements of geometric objects became the theoretical backbone of computational geometry in the 1980s and 1990s. The combinatorial techniques outlined in this book have found applications in many areas of computer science from graph drawing through hidden surface removal and motion planning to frequency allocation in cellular networks. ""Combinatorial Geometry and Its Algorithmic Applications"" is intended as a source book for professional mathematicians and computer scientists as well as for graduate students interested in combinatorics and geometry. Most chapters start with an attractive, simply formulated, but often difficult and only partially answered mathematical question, and describes the most efficient techniques developed for its solution. The text includes many challenging open problems, figures, and an extensive bibliography.
