Approximation algorithms for clustering uncertain data
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A unified approach to approximate proximity searching
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
On multiplicative λ-approximations and some geometric applications
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Jaywalking your dog: computing the Fréchet distance with shortcuts
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximate nearest neighbor search for low dimensional queries
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Nearest-neighbor searching under uncertainty
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Approximate bregman near neighbors in sublinear time: beyond the triangle inequality
Proceedings of the twenty-eighth annual symposium on Computational geometry
On the set multicover problem in geometric settings
ACM Transactions on Algorithms (TALG)
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
A self-adjusting data structure for multidimensional point sets
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
GD'12 Proceedings of the 20th international conference on Graph Drawing
Small-size relative (p,ε)-approximations for well-behaved range spaces
Proceedings of the twenty-ninth annual symposium on Computational geometry
Range counting coresets for uncertain data
Proceedings of the twenty-ninth annual symposium on Computational geometry
Nearest neighbor searching under uncertainty II
Proceedings of the 32nd symposium on Principles of database systems
Quality and efficiency for kernel density estimates in large data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Output-sensitive well-separated pair decompositions for dynamic point sets
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
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.