Free Delivery Over $100
|
|
|||
|
||||
OverviewExact 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. Full Product DetailsAuthor: Sariel Har-PeledPublisher: American Mathematical Society Imprint: American Mathematical Society Volume: No.173 Weight: 0.820kg ISBN: 9780821849118ISBN 10: 0821849115 Pages: 358 Publication Date: 30 June 2011 Audience: Professional and scholarly , Professional & Vocational Format: Hardback Publisher's Status: Active Availability: Temporarily unavailable  The supplier advises that this item is temporarily unavailable. It will be ordered for you and placed on backorder. Once it does come back in stock, we will ship it out to you. Table of ContentsReviewsAuthor InformationSariel Har-Peled, University of Illinois at Urbana-Champaign, IL Tab Content 6Author Website:Countries AvailableAll regions |
||||
