The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Geometric Approximation Algorithms
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Computational Geometry: Algorithms and Applications
de Berg, M., Cheong, O., van Kreveld, M. J., & Overmars, M. H. (1997) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,450
Voronoi diagrams—a survey of a fundamental geometric data structure
Aurenhammer, F. (1991) · ACM Computing Surveys · doi:10.1145/116873.116880 · Cited by 4,340
Spencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
Geometric Algorithms and Combinatorial Optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1988) · Algorithms and Combinatorics · doi:10.1007/978-3-642-97881-4 · Cited by 3,431
A Note on the Generation of Random Normal Deviates
Box, G. E. P., & Muller, M. E. (1958) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706645 · Cited by 3,401
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (2015) · Measures of Complexity · doi:10.1007/978-3-319-21852-6_3 · Cited by 3,105
Locality-sensitive hashing scheme based on p-stable distributions
Datar, M., Immorlica, N., Indyk, P., & Mirrokni, V. S. (2004) · Proceedings of the twentieth annual symposium on Computational geometry · doi:10.1145/997817.997857 · Cited by 2,936
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Arya, S., Mount, D. M., Netanyahu, N. S., Silverman, R., & Wu, A. Y. (1998) · Journal of the ACM · doi:10.1145/293347.293348 · Cited by 2,300
Clustering to minimize the maximum intercluster distance
Gonzalez, T. F. (1985) · Theoretical Computer Science · doi:10.1016/0304-3975(85)90224-5 · Cited by 1,717
Neural network learning theoretical foundations
Anthony, M., & Bartlett, P. L. (2009) · Cited by 1,310
An Introduction to Probability Theory and Its Applications, Volume II
Grubbs, F. E., & Feller, W. (1967) · Technometrics · doi:10.2307/1266435 · Cited by 1,097
Linear Programming: Foundations and Extensions
Vanderbei, R. J. (1998) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600987 · Cited by 921
The Brunn-Minkowski inequality
Gardner, R. J. (2002) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-02-00941-2 · Cited by 894
ɛ-nets and simplex range queries
Haussler, D., & Welzl, E. (1987) · Discrete & Computational Geometry · doi:10.1007/bf02187876 · Cited by 723
Mammone, A., Turchi, M., & Cristianini, N. (2009) · WIREs Computational Statistics · doi:10.1002/wics.49 · Cited by 699
Database-friendly random projections
Achlioptas, D. (2001) · Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/375551.375608 · Cited by 699
A tight bound on approximating arbitrary metrics by tree metrics
Fakcharoenphol, J., Rao, S. B., & Talwar, K. (2003) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/780542.780608 · Cited by 566
Callahan, P. B., & Kosaraju, S. R. (1995) · Journal of the ACM · doi:10.1145/200836.200853 · Cited by 543
Solving geometric problems with the rotating calipers
Toussaint, G. T. (1983) · Cited by 514
An Elementary Introduction to Modern Convex Geometry
Ball, K. (1997) · Cambridge University Press eBooks · doi:10.1017/9781009701853.002 · Cited by 483
(2020) · Linear Algebra and Matrix Computations with MATLAB® · doi:10.1515/9783110666991-007 · Cited by 482
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
Arora, S. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548458 · Cited by 449
Optimal algorithms for approximate clustering
Feder, T., & Greene, D. (1988) · doi:10.1145/62212.62255 · Cited by 437
Voronoi Diagrams and Delaunay Triangulations
Fortune, S. (2004) · Discrete mathematics and its applications · doi:10.1201/9781420035315.ch23 · Cited by 399
Bern, M. W., Eppstein, D., & Gilbert, J. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80059-5 · Cited by 350
The discrepancy method: randomness and complexity
(2002) · Choice Reviews Online · doi:10.5860/choice.40-2215 · Cited by 347
A Graph-Theoretic Game and Its Application to the k -Server Problem
Alon, N., Karp, R. M., Peleg, D., & West, D. B. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792224474 · Cited by 303
The Johnson-Lindenstrauss lemma and the sphericity of some graphs
Frankl, P., & Maehara, H. (1988) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(88)90043-3 · Cited by 299
Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
Barequet, G., & Har-Peled, S. (2001) · Journal of Algorithms · doi:10.1006/jagm.2000.1127 · Cited by 287
Self-citationAlgorithmic applications of low-distortion geometric embeddings
Indyk, P. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959878 · Cited by 253
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
Kushilevitz, E., Ostrovsky, R., & Rabani, Y. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539798347177 · Cited by 245
Finding minimal enclosing boxes
O'Rourke, J. (1985) · International Journal of Computer & Information Sciences · doi:10.1007/bf00991005 · Cited by 238
ANN: library for approximate nearest neighbor searching
Arya, S., & Mount, D. M. (1998) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · Cited by 209
Nearest Neighbors in High-Dimensional Spaces
Indyk, P. (2004) · Discrete Mathematics and Its Applications · doi:10.1201/9781420035315.ch39 · Cited by 207
Metric Entropy of Some Classes of Sets with Differentiable Boundaries
Dudley, R. M. (2010) · Springer eBooks · doi:10.1007/978-1-4419-5821-1_26 · Cited by 189
A replacement for Voronoi diagrams of near linear size
Har-Peled, S. (2001) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959884 · Cited by 147
Self-citationAn algorithm for approximate closest-point queries
Clarkson, K. L. (1994) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/177424.177609 · Cited by 133
A new and simple algorithm for quality 2-dimensional mesh generation
Ruppert, J. (1993) · UC Berkeley · doi:10.5555/313559.313615 · Cited by 133
Coresets for $k$-Means and $k$-Median Clustering and their ApplicationsPreprint
Har-Peled, S., & Mazumdar, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.12826 · Cited by 95
Self-citationApproximate Nearest Neighbor Queries Revisited
Chan, T. M. (1998) · Discrete & Computational Geometry · doi:10.1007/pl00009390 · Cited by 80
Magen, A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45726-7_19 · Cited by 63
Space-efficient approximate Voronoi diagrams
Arya, S., Malamatos, T., & Mount, D. M. (2002) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/509907.510011 · Cited by 51
Linear-size approximate voronoi diagrams
Arya, S., & Malamatos, T. (2002) · doi:10.5555/545381.545400 · Cited by 46
A Time Efficient Delaunay Refinement Algorithm
Miller, G. L. (2018) · Figshare · doi:10.1184/r1/6602795 · Cited by 25
Metadata
- Authors
- Har-Peled, S.
- Venue
- Mathematical Surveys and Monographs
- Publisher
- American Mathematical Society
- Published
- 2011-06-15
- ISSN
- 0885-4653 (ISSN-L)
- 0076-5376
- 2331-7159
- OpenAlex
- W596522316
- Cited by
- 315
- References
- 48
- FWCI
- 50.13
- Type
- book
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.