Geometric Approximation Algorithms

Geometric Approximation Algorithms

Geometric Approximation Algorithms By Sariel Har-Peled
2011 | 358 Pages | ISBN: 0821849115 | PDF | 2 MB

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.




Alternate Link for Geometric Approximation Algorithms.rar When above links are dead

Hello Respective Visitor!

Please Login or Create a FREE Account to gain accesss to hidden contents.


Would you like to leave your comment? Please Login to your account to leave comments. Don't have an account? You can create a free account now.