AMS Bookstore LOGO amslogo
AMS TextbooksAMS Applications-related Books
Geometric Approximation Algorithms
Sariel Har-Peled, University of Illinois at Urbana-Champaign, IL
cover
SEARCH THIS BOOK:

Mathematical Surveys and Monographs
2011; 362 pp; hardcover
Volume: 173
ISBN-10: 0-8218-4911-5
ISBN-13: 978-0-8218-4911-8
List Price: US$98
Member Price: US$78.40
Order Code: SURV/173
[Add Item]

Request Permissions

Exact algorithms for dealing with geometric objects are complicated, hard to implement in practice, and slow. Over the last 20 years a theory of geometric approximation algorithms has emerged. These algorithms tend to be simple, fast, and more robust than their exact counterparts.

This book is the first to cover geometric approximation algorithms in detail. In addition, more traditional computational geometry techniques that are widely used in developing such algorithms, like sampling, linear programming, etc., are also surveyed. Other topics covered include approximate nearest-neighbor search, shape approximation, coresets, dimension reduction, and embeddings. The topics covered are relatively independent and are supplemented by exercises. Close to 200 color figures are included in the text to illustrate proofs and ideas.

Readership

Graduate students and research mathematicians interested in the theory and practice of computational geometry.

Powered by MathJax

  AMS Home | Comments: webmaster@ams.org
© Copyright 2014, American Mathematical Society
Privacy Statement

AMS Social

AMS and Social Media LinkedIn Facebook Podcasts Twitter YouTube RSS Feeds Blogs Wikipedia