Geometric Approximation Algorithms
Book information
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.
Similar books
Algorithms
2019 · PDF
Geometric approximation algorithms
2011 · PDF
Cosmical Electrodynamics, 2nd Ed. (International Series of Monographs on Physics)
1963 · DJVU
Theory of Knowledge: An Introduction
1976 · DJVU
Introduction to Stochastic Processes with Special Reference to Methods and Applications
DJVU
Dynamical Theory of Crystal Lattices (The International series of monographs on physics)
1998 · DJVU
Communism and China: Ideology in Flux
1970 · DJVU
American Piety: The Nature of Religious Commitment (Patterns of Religious Commitment)
1970 · DJVU