Geometric approximation algorithms
Author(s)
Bibliographic Information
Geometric approximation algorithms
（Mathematical surveys and monographs, v. 173）
American Mathematical Society, c2011
Available at / 36 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
S||MSM||173200021320636
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. 349-356) and index
Description and Table of Contents
Description
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.
by "Nielsen BookData"