Geometric Approximation Algorithms - Couverture rigide

Har-Peled, Sariel

Couverture rigide

ISBN 10 : 0821849115 ISBN 13 : 9780821849118

Editeur : American Mathematical Society, 2011

Synopsis

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.

A propos du livre

À propos de l?auteur

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

Détails de l'édition

• Éditeur: American Mathematical Society
• Date d'édition: 2011
• Langue: anglais
• ISBN 10: 0821849115
• ISBN 13: 9780821849118
• Reliure: Relié
• Nombre de pages: 358
• Coordonnées du fabricant: non disponible