The DOI matches its Crossref record; 81 of the 81 references it cites were found in a registry or an index.
Efficient algorithms for geometric optimization
Open accessAbstract
We review the recent progress in the design of efficient algorithms for various problems in geometric optimization. We present several techniques used to attack these problems, such as parametric searching, geometric alternatives to parametric searching, prune-and-search techniques for linear programming and related problems, and LP-type problems and their efficient solution. We then describe a wide range of applications of these and other techniques to numerous problems in geometric optimization, including facility location, proximity problems, statistical estimators and metrology, placement and intersection of polygons and polyhedra, and ray shooting and other query-type problems.
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
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Finding Groups in Data: An Introduction to Cluster Analysis
Kaufman, L., & Rousseeuw, P. J. (1990) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316801 · Cited by 7,344
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
Computer graphics: principles and practice
(2014) · Choice Reviews Online · doi:10.5860/choice.51-2713 · Cited by 4,651
Comparing images using the Hausdorff distance
Huttenlocher, D. P., Klanderman, G. A., & Rucklidge, W. J. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.232073 · Cited by 4,545
Spencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
Approximation Algorithms for NP-Hard Problems
(1997) · ACM SIGACT News · doi:10.1145/261342.571216 · Cited by 3,103
Automatic subspace clustering of high dimensional data for data mining applications
Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276314 · Cited by 2,412
Polynomial algorithms in linear programming
Khachiyan, L. G. (1980) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(80)90061-0 · Cited by 1,992
Algorithms in Combinatorial Geometry.
Goodman, J. E., & Edelsbrunner, H. (1989) · The American Mathematical Monthly · doi:10.2307/2325168 · Cited by 1,788
Knuth, D. E. (1973) · Cumulative Index of Computer Aided Architectural Design · Cited by 1,719
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
Algorithms in Combinatorial Geometry
Edelsbrunner, H. (1987) · Springer eBooks · doi:10.1007/978-3-642-61568-9 · Cited by 1,534
Scatter/Gather: A Cluster-based Approach to Browsing Large Document Collections
Cutting, D. R., Karger, D. R., Pedersen, J. O., & Tukey, J. W. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130362 · Cited by 1,419
Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., & Stuetzle, W. (1993) · Proceedings of the 20th annual conference on Computer graphics and interactive techniques · doi:10.1145/166117.166119 · Cited by 1,303
(1993) · doi:10.5555/313559.313789 · Cited by 998
A Best Possible Heuristic for the k-Center Problem
Hochbaum, D. S., & Shmoys, D. B. (1985) · Mathematics of Operations Research · doi:10.1287/moor.10.2.180 · Cited by 921
View-dependent refinement of progressive meshes
Hoppe, H. (1997) · Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97 · doi:10.1145/258734.258843 · Cited by 843
Vector quantization in speech coding
Makhoul, J., Roucos, S., & Gish, H. (1985) · Proceedings of the IEEE · doi:10.1109/proc.1985.13340 · Cited by 839
Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
Megiddo, N. (1983) · SIAM Journal on Computing · doi:10.1137/0212052 · Cited by 837
Proceedings. 45th Annual IEEE Symposium on Foundations of Computer Science
(2004) · 45th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.4 · Cited by 805
Smallest enclosing disks (balls and ellipsoids)
Welzl, E. (2006) · Lecture Notes in Computer Science · doi:10.1007/bfb0038202 · Cited by 791
SPRINT: A Scalable Parallel Classifier for Data Mining
Shafer, J. C., Agrawal, R., & Mehta, M. (1996) · Cited by 787
Optimal packing and covering in the plane are NP-complete
Fowler, R. J., Paterson, M. S., & Tanimoto, S. L. (1981) · Information Processing Letters · doi:10.1016/0020-0190(81)90111-3 · Cited by 734
Piecewise smooth surface reconstruction
Hoppe, H., DeRose, T., Duchamp, T., et al. (1994) · ACM SIGGRAPH Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH) · doi:10.1145/192161.192233 · Cited by 691
Linear Programming in Linear Time When the Dimension Is Fixed
Megiddo, N. (1984) · Journal of the ACM · doi:10.1145/2422.322418 · Cited by 669
Applications of random sampling in computational geometry, II
Clarkson, K. L., & Shor, P. W. (1989) · Discrete & Computational Geometry · doi:10.1007/bf02187740 · Cited by 665
Object recognition by computer: the role of geometric constraints
(1992) · Choice Reviews Online · doi:10.5860/choice.29-2747 · Cited by 654
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Megiddo, N. (1983) · Journal of the ACM · doi:10.1145/2157.322410 · Cited by 626
New lower bound techniques for robot motion planning problems
Canny, J., & Reif, J. (1987) · 28th Annual Symposium on Foundations of Computer Science (sfcs 1987) · doi:10.1109/sfcs.1987.42 · Cited by 538
Cohen, J., Varshney, A., Manocha, D., Turk, G., Weber, H., Agarwal, P., Brooks, F., & Wright, W. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237220 · Cited by 528
Self-citationView-dependent simplification of arbitrary polygonal environments
Luebke, D., & Erikson, C. (1997) · Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97 · doi:10.1145/258734.258847 · Cited by 508
Linear-time algorithms for linear programming in R3 and related problems
Megiddo, N. (1982) · doi:10.1109/sfcs.1982.74 · Cited by 483
Planar point location using persistent search trees
Sarnak, N., & Tarjan, R. E. (1986) · Communications of the ACM · doi:10.1145/6138.6151 · Cited by 482
Proceedings of the 32nd international conference on Very large data bases
Dayal, U., Whang, K.-Y., Lomet, D., Alonso, G., Lohman, G. M., Kersten, M. L., Sang, K., & Kim, Y. (2006) · Medical Entomology and Zoology · Cited by 479
Combinatorial Optimization with Rational Objective Functions
Megiddo, N. (1979) · Mathematics of Operations Research · doi:10.1287/moor.4.4.414 · Cited by 473
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
Almost optimal set covers in finite VC-dimension
Brönnimann, H., & Goodrich, M. T. (1995) · Discrete & Computational Geometry · doi:10.1007/bf02570718 · Cited by 441
Parallelism in Comparison Problems
Valiant, L. G. (1975) · SIAM Journal on Computing · doi:10.1137/0204030 · Cited by 439
Optimal algorithms for approximate clustering
Feder, T., & Greene, D. (1988) · doi:10.1145/62212.62255 · Cited by 437
Incremental clustering and dynamic information retrieval
Charikar, M., Chekuri, C., Feder, T., & Motwani, R. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258657 · Cited by 354
Approximation schemes for Euclidean k-medians and related problems
Arora, S., Raghavan, P., & Rao, S. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276718 · Cited by 341
A subexponential bound for linear programming
Matoušek, J., Sharir, M., & Welzl, E. (1996) · Algorithmica · doi:10.1007/bf01940877 · Cited by 300
Self-citationCutting hyperplanes for divide-and-conquer
Chazelle, B. (1993) · Discrete & Computational Geometry · doi:10.1007/bf02189314 · Cited by 270
An Interval Classifier for Database Mining Applications
Agrawal, R., Ghosh, S. P., Imieliński, T., Iyer, B. R., & Swami, A. (1992) · Cited by 264
Matoušek, J. (1992) · Discrete & Computational Geometry · doi:10.1007/bf02293051 · Cited by 234
Helly, Radon, and Carathéodory Type Theorems
ECKHOFF, J. (1993) · Handbook of Convex Geometry · doi:10.1016/b978-0-444-89596-7.50017-1 · Cited by 226
Las Vegas algorithms for linear and integer programming when the dimension is small
Clarkson, K. L. (1995) · Journal of the ACM · doi:10.1145/201019.201036 · Cited by 223
Constant interaction-time scatter/gather browsing of very large document collections
Cutting, D. R., Karger, D. R., & Pedersen, J. O. (1993) · Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '93 · doi:10.1145/160688.160706 · Cited by 207
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
Eisner, M. J., & Severance, D. G. (1976) · Journal of the ACM · doi:10.1145/321978.321982 · Cited by 173
Ray Shooting and Parametric Search
Agarwal, P. K., & Matoušek, J. (1993) · SIAM Journal on Computing · doi:10.1137/0222051 · Cited by 172
Self-citationIncremental clustering for dynamic information processing
Can, F. (1993) · ACM Transactions on Information Systems · doi:10.1145/130226.134466 · Cited by 151
A subexponential randomized simplex algorithm (extended abstract)
Kalai, G. (1992) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/129712.129759 · Cited by 145
A general approach to d-dimensional geometric queries
Yao, A. C.-C., & Yao, F. F. (1985) · doi:10.1145/22145.22163 · Cited by 144
On k -Hulls and Related Problems
Cole, R. J., Sharir, M., & Yap, C. K. (1987) · SIAM Journal on Computing · doi:10.1137/0216005 · Cited by 137
Self-citationNearly linear time approximation schemes for Euclidean TSP and other geometric problems
Arora, S. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63248-4_5 · Cited by 136
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
Agarwal, P. K., Efrat, A., & Sharir, M. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795295936 · Cited by 125
Self-citationOn geometric optimization with few violated constraints
Matoušek, J. (1995) · Discrete & Computational Geometry · doi:10.1007/bf02570713 · Cited by 123
Computing the minimum Hausdorff distance for point sets under translation
Huttenlocher, D. P., & Kedem, K. (1990) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/98524.98599 · Cited by 120
Approximation algorithms for geometric problems
Bern, M. W., & Eppstein, D. (1996) · Cited by 118
New Results and New Trends in Computer Science
(1991) · Lecture notes in computer science · doi:10.1007/bfb0038178 · Cited by 118
Parametric optimization of sequence alignment
Gusfield, D., Balasubramanian, K., & Naor, D. (1994) · Algorithmica · doi:10.1007/bf01185430 · Cited by 110
Parallel algorithms for higher-dimensional convex hulls
Amato, N. M., Goodrich, M. T., & Ramos, E. A. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365724 · Cited by 92
Algebraic optimization: The Fermat-Weber location problem
Chandrasekaran, R., & Tamir, A. (1990) · Mathematical Programming · doi:10.1007/bf01585739 · Cited by 90
Computing a centerpoint of a finite planar set of points in linear time
Jadhav, S., & Mukhopadhyay, A. (1994) · Discrete & Computational Geometry · doi:10.1007/bf02574382 · Cited by 82
Beweis einer Vermutung von A. Vázsonyi
Heppes, A. (1956) · Acta Mathematica Academiae Scientiarum Hungaricae · doi:10.1007/bf02020540 · Cited by 80
Schroeter, P., & Bigün, J. (1995) · Pattern Recognition · doi:10.1016/0031-3203(94)00133-7 · Cited by 66
Computing the center of planar point sets
Matoušek, J. (1991) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/006/14 · Cited by 60
Approximating center points with iterated radon points
Clarkson, K. L., Eppstein, D., Miller, G. L., Sturtivant, C., & Teng, S. (1993) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/160985.161004 · Cited by 58
Practical methods for approximate geometric pattern matching under rigid motions
Goodrich, M. T., Mitchell, J. S. B., & Orletsky, M. W. (1994) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/177424.177572 · Cited by 53
Computing a ham-sandwich cut in two dimensions
Edelsbrunner, H., & Waupotitsch, R. (1986) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(86)80020-7 · Cited by 49
Octree-R: an adaptive octree for efficient ray tracing
Whang, K.-Y., Song, J.-W., Chang, J.-W., et al. (1995) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.485621 · Cited by 49
Hyperplane Approximation and Related Topics
Korneenko, N. M., & Martini, H. (1993) · Algorithms and combinatorics · doi:10.1007/978-3-642-58043-7_7 · Cited by 42
Improvements on geometric pattern matching problems
Chew, L. P., & Kedem, K. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55706-7_28 · Cited by 42
A convex polygon among polygonal obstacles: placement and high-clearance motion
Chew, L. P., & Kedem, K. (1993) · Computational Geometry · doi:10.1016/0925-7721(93)90001-m · Cited by 40
Fast hierarchical clustering and other applications of dynamic closest pairsPreprint
Eppstein, D. (1998) · doi:10.5555/314613.315030 · Cited by 39
A graph based approach to object feature recognition
Floriani, L. D. (1987) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/41958.41968 · Cited by 35
On geometric optimization with few violated constraints
Matoušek, J. (1994) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/177424.178039 · Cited by 32
Goodrich, M. T., & Ramos, E. A. (1997) · Discrete & Computational Geometry · doi:10.1007/pl00009325 · Cited by 17
Cited by
Coordination and Geometric Optimization via Distributed Dynamical Systems
Cortés, J., & Bullo, F. (2005) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012903428652 · Cited by 452
Scaramuzza, D., Achtelik, M. C., Doitsidis, L., Friedrich, F., Kosmatopoulos, E., Martinelli, A., Achtelik, M. W., Chli, M., Chatzichristofis, S., Kneip, L., et al. (2014) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2014.2322295 · Cited by 299
Metadata
- Authors
- Agarwal, P. K., & Sharir, M.
- Venue
- ACM Computing Surveys
- Published
- 1998-12
- Volume
- 30
- Issue
- 4
- Pages
- 412-458
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2161779238
- Cited by
- 257
- References
- 81
- FWCI
- 6.14
- Type
- journal article
- 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.