 |
GetTextbooks.com
Compare Prices & Save up to 90% |
|
|
|
| Login | Sign up | My Wish List |
 | | Algorithmic Geometry by Jean-Daniel Boissonnat, Mariette Yvinec, Herve Bronniman (Translator) ISBN-10: 9780521563222 ISBN-10: 0-521-56322-4 ISBN-13: 9780521563222 ISBN-13: 978-0-521-56322-2 Hardcover 1998-03-13 Cambridge University Press Find Lowest Price |
Editorials | ||
Product Description The design and analysis of geometric algorithms has seen remarkable growth in recent years, due to their application in computer vision, graphics, medical imaging, and CAD. Geometric algorithms are built on three pillars: geometric data structures, algorithmic data structuring techniques and results from combinatorial geometry. This comprehensive presents a coherent and systematic treatment of the foundations and gives simple, practical algorithmic solutions to problems. An accessible approach to the subject, Algorithmic Geometry is an ideal guide for instructors or for beginning graduate courses in computational geometry. | ||
Reviews | ||
A great graduate book to complement the textbooks! If you've read computational geometry textbooks (like the Preparata-Shamos, or the recent and great "Dutch" book by de Berg et al.), and liked the material, here's your chance to delve into the more mathematical and analytical aspect of the topic. This book is not for an undergraduate class, but its thorough yet readable treatment of arrangements or Voronoi diagrams will bring you up to speed for reading technical articles or more elaborate references (like Edelsbrunner's monograph). The scope is wider than Edelsbrunner's, even though fewer or less technical results appear. For instance, there is an analysis of the complexity of the union of triangles in space (based on recent research results). The book takes the viewpoint of randomized algorithms, which are very simple to describe and implement, and provides general tools for their analysis (on-line or off-line dynamic algorithm). It is based in five parts around geometric structures (polytopes, arrangements, Voronoi diagrams) with two introductory parts (algorithms, randomized analysis -- general theorems). Many of the algorithms and problems stem from robotics and motion planning. There are many exercises, with either an "algorithmic" interface, or a concrete problem-solving presentation. | ||