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.

About the Author
Sariel Har-Peled, University of Illinois at Urbana-Champaign, IL


Book Information
ISBN 9780821849118
Author Sariel Har-Peled
Format Hardback
Page Count 358
Imprint American Mathematical Society
Publisher American Mathematical Society
Weight(grams) 820g