Efficient Algorithms for Geometric Optimization

ACM Computing Surveys

Volumn 30, Issue 4, 1998, Pages 412-458

  Agarwal, P K ^a   Sharir, M ^b,c  

^a Duke University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

Algorithms; Clustering; collision detection; Design; linear programming; matrix searching; parametric searching; proximity problems; pruneand search; randomized algorithms

Indexed keywords

ALGORITHMS; LINEAR PROGRAMMING; PROBLEM SOLVING; STATISTICAL METHODS;

PRUNE AND SEARCH TECHNIQUES;

COMPUTATIONAL GEOMETRY;

EID: 0032266683     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/299917.299918     Document Type: Article

References (277)

1. Agarwal, P. K. and Desikan, P. K. 1997. An approximation algorithm for terrain simplification. In Proceedings of the Eighth ACM- SIAM Symposium on Discrete Algorithms, 139-147.
2. Agarwal, P. K. and Matousek, J. 1993. Ray shooting and parametric search. SIAM J. Comput. 22, 794-806.
3. Agarwal, P. K. and Matousek, J. 1994. On range searching with semialgebraic sets. Discrete Comput. Geom. 11, 393-418.
4. Agarwal, P. K. and Matousek, J. 1995. Dynamic half-space range reporting and its applications. Algorithmica 13, 325-345. Agarwal, P. K. and Procopiuc, C. M. 1998. Exact and approximation algorithms for clustering. In Proceedings of the Ninth ACM- SIAM Symposium on Discrete Algorithms, 658-667.
5. Agarwal, P. K. and Sharir, M. 1991. Off-line dynamic maintenance of the width of a planar point set. Comput. Geom. Theor. Appl. 1, 6578.
6. Agarwal, P. K. and Sharir, M. 1994. Planar geometric location problems. Algorithmica 11, 185-195.
7. Agarwal, P. K. and Sharir, M. 1996. Efficient randomized algorithms for some geometric optimization problems. Discrete Comput. Geom. 16, 317-337.
8. Agarwal, P. K. and Sharir, M. 1996. Ray shooting amidst convex polygons in 2D. J. Alg. 21, 508-519.
9. Agarwal, P. K. and Sharir, M. 1996. Ray shooting amidst convex polyhedra and polyhedral terrains in three dimensions. SIAM J. Comput. 25, 100-116.
10. Agarwal, P. K. and Suri, S. 1994. Surface approximation and geometric partitions. in Proceedings of the Fifth ACM-SIAM Symposium on Discrete Algorithms, 24-33.
11. Agarwal, P. K., Amenta, N., and Sharir, M. 1998. Placement of one convex polygon inside another. Discrete Comput. Geom. 19, 95-104.
12. Agarwal, P. K., Aronov, B., and Sharir, M. 1997. Computing envelopes in four dimensions with applications. SIAM J. Comput. 26, 1714-1732.
13. Agarwal, P. K., Aronov, B., and Sharir, M. 1997. Line traversals of balls and smallest enclosing cylinders in three dimensions. in Proceedings of the Eighth ACM-SIAM Symposium on Discrete Algorithms, 483-492.
14. Agarwal, P. K., Aronov, B., and Sharir, M. 1997. Motion planning for a convex polygon in a polygonal environment. Tech. Rep. CS-1997-17, Dept. of Computer Science, Duke University.
15. Agarwal, P. K., Aronov, B., Sharir, M., and Suri, S. 1993. Selecting distances in the plane. Algorithmica 9, 495-514.
16. Agarwal, P. K., Efrat, A., and Sharir, M. 1995. vertical decomposition of shallow lengths in 3-dimensional arrangements and its applications. in Proceedings of the Eleventh Annual ACM Symposium on Computational Geometry, 39-50.
17. Agarwal, P. K., Efrat, A., Sharir, M., and Toledo, S. 1993. Computing a segment center for a planar point set. J. Alg. 15, 314-323.
18. Agarwal, P. K., Sharir, M., and Toledo, S. 1993c. An efficient multi-dimensional searching technique and its applications. Tech. Rep. CS-1993-20, Dept. of Computer Science, Duke University.
19. Agarwal, P. K., Sharir, M., and Toledo, S. 1994. Applications of parametric searching in geometric optimization. J. Alg. 17, 292-318.
20. Agarwal, P. K., Sharir, M., and Welzl, E. 1997. The discrete 2-center problem. In Proceedings of the Thirteenth Annual ACM Symposium Computer Geometry, 147-155.
21. Agarwala, R. and Fernandez-Baca, D. 1996. weighted multidimensional search and its applications to convex optimization. SIAM J. Comput. 25, 83-99.
22. Aggarwal, A. and Klawe, M. M. 1987. Applications of generalized matrix searching to geometric algorithms. Discrete Appl. Math. 27, 3-23.
23. Aggarwal, A. and Park, J. K. 1988. Notes on searching in multidimensional monotone arrays. In Proceedings of the 29th Annual IEEE Symposium on the Foundations of Computer Science, 497-512.
24. Aggarwal, A., Klawe, M. M., Moran, S., Shor, P. W., and Wilber, R. 1987. Geometric applications of a matrix-searching algorithm. Algorithmica 2, 195-208.
25. Aggarwal, A., Kravets, D., Park, J. K., and Sen, S. 1990. Parallel searching in generalized Monge arrays with applications. in Proceedings of the Second ACM Symposium on Parallel Algorithms Architecture, 259-268.
26. Agrawal, R., Gehrke, J., Gunopulos, D., and Raghavan, P. 1998. Automatic subspace clustering of high dimensional data for data mining applications. in Proceedings of the ACM SIGMOD Conference on Management of Data, 94-105.
27. Agrawal, R., Ghosh, A., Imjelinski, T., Iyer, B., and Swami, A. 1992. An interval classifier for database mining applications. in Proceedings of the Eighteenth International Conference on Very Large Databases.
28. Ajtai, M. and Megiddo, N. 1996. A deterministic poly(log log n)-time n-processor algorithm for linear programming in fixed dimension. SIAM J. Comput. 25, 1171-1195.
29. Ajtai, M., Komlos, J., and SzemerEdi, E. 1983. Sorting in c log n parallel steps. Combinatorica 3, 1-19.
30. Alon, N. and Megiddo, N. 1990. Parallel linear programming in fixed dimension almost surely in constant time. In Proceedings of the 31st Annual IEEE Symposium on the Foundations of Computer Science, 574-582.
31. Alon, N. and Spencer, J. 1993. The Probabilistic Method. wiley, New York.
32. Alt, H., Behrends, B., and BlOmer, J. 1995. Approximate matching of polygonal shapes. Ann. Math. Artif. Intell. 13, 251-266.
33. Amato, N. M., Goodrich, M. T., and Ramos, E. A. 1994. Parallel algorithms for higherdimensional convex hulls. in Proceedings of the 35th Annual IEEE Symposium on the Foundations of Computer Science, 683-694.
34. Amenta, N. 1994. Bounded boxes, Hausdorff distance, and a new proof of an interesting Helly theorem. in Proceedings of the Tenth Annual ACM Symposium on Computational Geometry, 340-347.
35. Amenta, N. 1994b. Helly-type theorems and generalized linear programming. Discrete Comput. Geom. 12, 241-261.
36. Arnon, D. S., Collins, G. E., and McCallum, S. 1984. Cylindrical algebraic decomposition I: The basic algorithm. SIAM J. Comput. 13, 865-877.
37. Arora, S. 1996. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. in Proceedings of the 37th Annual IEEE Symposium on the Foundations of Computer Science, 2-11.
38. Arora, S. 1997. Nearly linear time approximation schemes for the Euclidean TSP and other geometric problems. in Proceedings of the 38th Annual IEEE Symposium on the Foundations of Computer Science, 554-563.
39. Arora, S., Raghavan, P., and Rao, S. 1998. Approximation schemes for Euclidean k-median and related problems. in Proceedings of the 30th Annual ACM Symposium on the Theory of Computation, 106-113.
40. Bar-Ilan, J., Kortsarz, G., and Peleg, D. 1993. How to allocate network centers. J. Alg. 15, 385-415.
41. Bar-Yehuda, R., Efrat, A., and Itai, A. 1993. A simple algorithm for maintaining the center of a planar point-set. In Proceedings of the Fifth Canadian Conference on Computational Geometry, 252-257.
42. Berman, M. 1989. Large sample bias in least squares estimators of a circular arc center and its radius. Comput. Vis. Graph. Image Process. 45, 126-128.
43. Bern, M. and Eppstein, D. 1997. Approximation algorithms for geometric problems. In Approximation Algorithms for NP-Hard Problems, D. S. Hochbaum, Ed., PWS Publishing, Boston, MA, 296-345.
44. Bespamyatnikh, S. 1998. An efficient algorithm for the three-dimensional diameter problem. In Proceedings of the Ninth Annual ACM- SIAM Symposium on Discrete Algorithms, 137-146.
45. Bhattacharya, B. K. and Toussaint, G. 1991. Computing shortest transversals. Computing 46, 93-119.
46. Bhattacharya, B. K., Czyzowicz, J., Egyed, P., Toussaint, G., StojmenoviC, I., and Urrutia, J. 1991a. computing shortest transversals of sets. In Proceedings of the Seventh Annual ACM Symposium on Computational Geometry, 71-80.
47. Bhattacharya, B. K., Jadhav, S., Mukhopadhyay, A., and Robert, J.-M. 1991b. Optimal algo rithms for some smallest intersection radius problems. In Proceedings of the Seventh Annual ACM Symposium on Computational Geometry, 81-88.
48. Brinkhoff, T. and Kriegel, H.-P. 1994. The impact of global clusterings on spatial database systems. In Proceedings of the Twentieth International Conference on Very Large Databases.
49. BrOnnimann, H. and Chazelle, B. 1994. Optimal slope selection via cuttings. In Proceedings of the Sixth Canadian Conference on Computational Geometry, 99-103.
50. BrOnnimann, H. and Goodrich, M. T. 1995. Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom. 14, 263-279.
51. BrOnnimann, H., Chazelle, B., and Matousek, J. 1993. Product range spaces, sensitive sampling, and derandomization. In Proceedings of the 34th Annual IEEE Symposium on the Foundations of Computer Science, 400-409.
52. Can, F. 1993. Incremental clustering for dynamic information retrieval. ACM Trans. Inf. Syst. 11, 143-164.
53. Canny, J. and Reif, J. H. 1987. New lower bound techniques for robot motion planning problems. In Proceedings of the 28th Annual IEEE Symposium on the Foundations of Computer Science, 49-60.
54. Chan, T. M. 1996. Fixed-dimensional linear programming queries made easy. In Proceedings of the Twelfth Annual ACM Symposium on Computational Geometry, 284-290.
55. Chan, T. M. 1998. Geometric applications of a randomized optimization technique. In Proceedings of the Fourteenth Annual ACM Symposium on Computational Geometry (to appear).
56. Chandrasekaran, R. and Tamir, A. 1990. Algebraic optimization: The Fermat-Weber location problem. Math. Program. 46, 219-224.
57. Charikar, M., Chekuri, C., Feder, T., and Motwani, R. 1997. Incremental clustering and dynamic information retrieval. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computation, 626-635.
58. Chazelle, B. 1993. Cutting hyperplanes for divide-and-conquer. Discrete Comput. Geom. 9, 145-158.
59. Chazelle, B. and Matousek, J. 1996. On-linear-time deterministic algorithms for optimization problems in fixed dimensions. J. Alg. 21, 579-597.
60. Chazelle, B., Edelsbrunner, H., Guibas, L. J., and Sharir, M. 1991. A singly-exponential stratification scheme for real semi-algebraic varieties and its applications. Theor. Comput. Sci. 84, 77-105.
61. Chazelle, B., Edelsbrunner, H., Guibas, L. J., and Sharir, M. 1993. Diameter, width, closest line pair and parametric searching. Discrete Comput. Geom. 10, 183-196.
62. Chazelle, B., Edelsbrunner, H., Guibas, L. J., and Sharir, M. 1994. Algorithms for b. line segment problems and p. terrains. Algorithmica 11, 116-132.
63. Chazelle, B., Edelsbrunner, H., Guibas, L. J., Sharir, M., and Stolfi, J. 1996. Lines in space: Combinatorics and algorithms. Algorithmica 15, 428-447.
64. Chew, L. P. and Kedem, K. 1992. Improvements on geometric pattern matching problems. In Proceedings of the Third Scandinavian Workshop on Algorithm Theory, LNCS 621, Springer-Verlag, 318-325.
65. Chew, L. P. and Kedem, K. 1993. A convex polygon among polygonal obstacles: Placement and high-clearance motion. Comput. Geom. Theor. Appl. 3, 59-89.
66. Chew, L. P., Dor, D., Efrat, A., and Kedem, K. 1995. Geometric pattern matching in d-dimensional space. In Proceedings of the Second Annual European Symposium on Algorithms, LNCS 979, Springer-Verlag, 264-279.
67. Chew, L. P., Goodrich, M. T., Huttenlocher, D. P., Kedem, K., Kleinberg, J. M., and Kravets, D. 1997. Geometric pattern matching under Euclidean motion. Comput. Geom. Theor. Appl. 7, 113-124.
68. d) time. Inf. Process. Lett. 22, 21-24.
69. Clarkson, K. L. 1992. Randomized geometric algorithms. In Computing in Euclidean Geometry, D.-Z. Du and F. K. Hwang, Eds., World Scientific, Singapore, 117-162.
70. Clarkson, K. L. 1993. Algorithms for polytope covering and approximation. In Proceedings of the Third Workshop on Algorithms Data Structures, LNCS 709, Springer-Verlag, 246-252.
71. Clarkson, K. L. 1995. Las Vegas algorithms for linear and integer programming. J. ACM 42, 488-499.
72. Clarkson, K. L. and Shor, P. W. 1989. Applications of random sampling in computational geometry, II. Discrete Comput. Geom. 4, 387-421.
73. Clarkson, K. L., Eppstein, D., Miller, G. L., Sturtivant, C., and Teng, S.-H. 1996. Approximating center points with iterative Radon points. Int. J. Comput. Geom. Appl. 6, 357-377.
74. Cohen, E. and Megiddo, N. 1993. Maximizing concave functions in fixed dimension. In Complexity in Numeric Computation (P. Pardalos, Ed., World Scientific, Singapore, 74-87.
75. Cohen, J., Varshney, A., Manocha, D., Turk, G., Weber, H., Agarwal, P., Brooks, F. P., Jr., and Wright, W. V. 1996. Simplification envelopes. In Proceedings of SIGGRAPH ’96, 119-128.
76. Cole, R. 1987. Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34, 200-208.
77. Cole, R., Salowe, J., Steiger, W., and SzemerEdi, E. 1989. An optimal-time algorithm for slope selection. SIAM J. Comput. 18, 792-810.
78. Cole, R., Sharir, M., and Yap, C. K. 1987. On k-hulls and related problems. SIAM J. Comput. 16, 61-77.
79. Collins, G. E. 1975. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Proceedings of the Second GI Conference on Automata Theory and Formal Languages, LNCS 33, Springer-Verlag, Berlin, 134-183.
80. Cutting, D. R., Karger, D. R., and Pedersen, J. O. 1993. Constant interaction-time scatter/gather browsing of very large document collections. In Proceedings of the Sixteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 126-134.
81. Cutting, D. R., Karger, D. R., Pedersen, J. O., and Tukey, J. W. 1992. Scatter/gather: A cluster-based approach to browsing large document collections. In Proceedings of the Sixteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 318-329.
82. Danzer, L., GrUnbaum, B., and Klee, V. 1963. Helly’s theorem and its relatives. In Convexity, Proceedings of the Symposium on Pure Mathematics, Vol. 7, American Mathematical Society, Providence, RI 101-180.
83. Das, G. and Joseph, D. 1990. The complexity of minimum convex nested polyhedra. In Proceedings of the Second Canadian Conference on Computational Geometry, 296-301.
84. Datta, A., Lenhof, H.-P., Schwarz, C., and Smid, M. 1995. Static and dynamic algorithms for k-point clustering problems. J. Alg. 19, 474-503.
85. de Berg, M., Bose, J., Bremner, D., Ramaswami, S., and Wilfong, G. 1997. Computing constrained minimum-width annuli of point sets. In Proceedings of the Fifth Workshop on Algorithms Data Structure, LNCS 1272, SpringerVerlag, 3-16.
86. de Berg, M., Devillers, O., van Kreveld, M., Schwarzkopf, O., and Teillaud, M. 1996. Computing the maximum overlap of two convex polygons under translation. In Proceedings of the Seventh Annual International Symposium on Algorithms Computation.
87. De Floriani, L. 1984. A graph based approach to object feature recognition. In Proceedings of the Third Annual ACM Symposium on Computational Geometry, 100-109.
88. DeHaemer, M. J., Jr. and Zyda, M. J. 1991. Simplification of objects rendered by polygonal approximations. Comput. Graph. 15, 175-184.
89. Deng, X. 1990. An optimal parallel algorithm for linear programming in the plane. Inf. Process. Lett. 35, 213-217.
90. Dillencourt, M. B., Mount, D. M., and Netanyahu, N. S. 1992. A randomized algorithm for slope selection. Int. J. Comput. Geom. Appl. 2, 1-27.
91. Drezner, Z. 1981. On a modified 1-center problem. Manage Sci. 27, 838-851.
92. Drezner, Z. 1984. The p-centre problems-Heuristic and optimal algorithms. J. Oper. Res. Soc. 35, 741-748.
93. Drezner, Z. 1984. The planar two-center and two-median problem. Transp. Sci. 18, 351-361.
94. Drezner, Z. 1987. On the rectangular p-center problem. Naval Res. Logist. Q. 34, 229-234.
95. Drezner, Z. 1989. Conditional p-centre problems. Transp. Sci. 23, 51-53.
96. Drezner, Z., Ed. 1995. Facility Location. Springer-Verlag, New York.
97. Drezner, Z., Mehrez, A., and Wesolowsky, G. O. 1992. The facility location problems with limited distances. Transp. Sci. 25, 183-187.
98. Duncan, C. A., Goodrich, M. T., and Ramos, E. A. 1997. Efficient approximation and optimization algorithms for computational metrology. In Proceedings of the Eighth ACM-SIAM Symposium on Discrete Algorithms, 121-130.
99. Dyer, M. E. 1984. Linear time algorithms for two-and three-variable linear programs. SIAM J. Comput. 13, 31-45.
100. Dyer, M. E. 1986. On a multidimensional search technique and its application to the Euclidean one-centre problem. SIAM J. Comput. 15, 725-738.
101. Dyer, M. E. 1992. A class of convex programs with applications to computational geometry. In Proceedings of the Eighth Annual ACM Symposium on Computational Geometry, 9-15.
102. Dyer, M. E. 1995. A parallel algorithm for linear programming in fixed dimensions. In Proceedings of the Eleventh Annual ACM Symposium on Computational Geometry, 345-349.
103. Dyer, M. E. and Frieze, A. M. 1985. A simple heuristic for the p-centre problem. Oper. Res. Lett. 3, 285-288.
104. Dyer, M. E. and Frieze, A. M. 1989. A randomized algorithm for fixed-dimension linear programming. Math. Program. 44, 203-212.
105. Ebara, H., Fukuyama, N., Nakano, H., and Nakanishi, Y. 1980. Roundness algorithms using the Voronoi diagrams. In Abstracts of the First Canadian Conference on Computational Geometry, 41.
106. Eckhoff, J. 1993. Helly, Radon, and Caratheodory type theorems. In Handbook of Convex Geometry, P. M. Gruber and J. Wills, Eds., North-Holland, 389-448.
107. Edelsbrunner, H. 1985. Computing the extreme distances between two convex polygons. J. Alg. 6, 213-224.
108. Edelsbrunner, H. 1987. Algorithms in Combinatorial Geometry. Springer-Verlag, Heidelberg.
109. Edelsbrunner, H. and Waupotitsch, R. 1986. Computing a ham-sandwich cut into two dimensions. J. Symbol. Comput. 2, 171-178.
110. Efrat, A. and Sharir, M. 1996. A near-linear algorithm for the planar segment center problem. Discrete Comput. Geom. 16, 239-257.
111. Efrat, A., Sharir, M., and Ziy, A. 1994. Computing the smallest k-enclosing circle and related problems. Comput. Geom. Theor. Appl. 4, 119-136.
112. Eisner, M. and Severance, D. 1976. Mathematical techniques for efficient record segmentation in large shared databases. J. ACM 23, 619-635.
113. Eppstein, D. 1992. Dynamic three-dimensional linear programming. ORSA J. Comput. 4, 360-368.
114. Eppstein, D. 1997. Faster construction of planar two-centers. in Proceedings of the Eighth ACM-SIAM Symposium on Discrete Algorithms, 1997.
115. Eppstein, D. 1998. Fast hierarchical clustering and other applications of dynamic closest pairs. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 619-628.
116. Eppstein, D. and Erickson, J. 1994. Iterated nearest neighbors and finding minimal polytopes. Discrete Comput. Geom. 11, 321-350.
117. Eric, W. and Grimson, L. 1990. Object Recognition by Computer: The Role of Geometric Constraints. MiT press, cambridge, MA.
118. Feder, T. and Greene, D. H. 1988. Optimal algorithms for approximate clustering. in Proceedings of the Twentieth Annual ACM Symposium on the Theory of Computation, 434-444.
119. Finn, P., Kavraki, L. E., Latombe, J.-C., Motwani, R., Shelton, C., Venkatasubramanian, S., and Yao, A. 1997. Rapid: Randomized pharmacophore identification for drug design. In Proceedings of the Thirteenth Annual ACM Symposium on Computational Geometry, 324-333.
120. Foley, J. D., van Dam, A., Feiner, S. K., and Hughes, J. F. 1990. Computer Graphics: Principles and Practice. Addison-Wesley, Reading, MA.
121. Follert, F., SchOmer, E., and Sellen, J. 1995. subquadratic algorithms for the weighted maximum facility location problem. in Proceedings of the Seventh Canadian Conference on Computational Geometry, 1-6.
122. Follert, F., SchOmer, E., Sellen, J., Smid, M., and Thiel, C. 1995. Computing a largest empty anchored cylinder, and related problems. in Proceedings of the Fifteenth Conference on Foundations of Software Technology Theoretical Computer Science, LNCS 1026, springer-Verlag, 428-442.
123. Fowler, R. J., Paterson, M. S., and Tanimoto, S. L. 1981. Optimal packing and covering in the plane are Np-complete. Inf. Process. Lett. 12, 133-137.
124. Frederickson, G. N. 1991. Optimal algorithms for tree partitioning. in Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, 168-177.
125. Frederickson, G. N. and Johnson, D. B. 1982. The complexity of selection and ranking in X + Y and matrices with sorted rows and columns. J. Comput. Syst. Sci. 24, 197-208.
126. Frederickson, G. N. and Johnson, D. B. 1983. Finding kth paths and p -centers by generating and searching good data structures. J. Alg. 4, 61-80.
127. Frederickson, G. N. and Johnson, D. B. 1984. Generalized selection and ranking: Sorted matrices. SIAM J. Comput. 13, 14-30.
128. Garcia-Lopez, J. and Ramos, P. 1997. Fitting a set of points by a circle. In Proceedings of the Thirteenth Annual ACM Symposium on Computational Geometry, 139-146.
129. GArtner, B. 1995. A subexponential algorithm for abstract optimization problems. SIAM J. Comput. 24, 1018-1035.
130. GArtner, B. and Welzl, E. 1996. Linear programming-randomization and abstract frameworks. In Proceedings of the Thirteenth Symposium on Theoretical Aspects of Computer Science, LNCS 1046, Springer-Verlag, 669-687.
131. Glozman, A., Kedem, K., and Shpitalnik, G. 1995. On some geometric selection and optimization problems via sorted matrices. In Proceedings of the Fourth Workshop on Algorithms Data Structures, LNCS 955, SpringerVerlag, 26-37.
132. Goldwasser, M. 1995. A survey of linear programming in randomized subexponential time. SIGACTNews 26, 96-104.
133. Gonzalez, T. 1985. Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293-306.
134. Gonzalez, T. 1991. Covering a set of points in multidimensional space. Inf. Process. Lett. 40, 181-188.
135. Goodrich, M. T. 1993. Geometric partitioning made easier, even in parallel. In Proceedings of the Ninth Annual ACM Symposium on Computational Geometry, 73-82.
136. Goodrich, M. T. 1995. Efficient piecewise-linear function approximation using the uniform metric. Discrete Comput. Geom. 14, 445-462.
137. Goodrich, M. T. and Ramos, E. A. 1997. Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming. Discrete Comput. Geom. 18, 397-420.
138. Goodrich, M. T., Mitchell, J. S. B., and Orletsky, M. W. 1994. Practical methods for approximate geometric pattern matching under rigid motion. in Proceedings of the Tenth Annual ACM Symposium on Computational Geometry, 103-112.
139. Grünbaum, B. 1956. A proof of Vazsonyi’s conjecture. Bull. Res. Council Isr., Sect. A, 6, 77-78.
140. Gupta, P., Janardan, R., and Smid, M. 1994. Fast algorithms for collision and proximity problems involving moving geometric objects. Rep. MPI-I-94-113, Max-Planck-Institut Inform., Saarbrücken, Germany.
141. Gusfield, D., Balasubramanian, K., and Naor, D. 1994. Parametric optimization of sequence alignment. Algorithmica 12, 312-326.
142. Han, K.-A. and Myaeng, S.-H. 1996. Image organization and retrieval with automatically constructed feature vectors. in Proceedings of the Sixteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 157-165.
143. Hassin, R. and Megiddo, N. 1991. Approximation algorithms for hitting objects by straight lines. Discrete Appl. Math. 30, 29-42.
144. Heckbert, P. S. and Garland, M. 1995. Fast polygonal approximation of terrains and height fields. Tech. Rep. CMU-CS-95-181, Carnegie Mellon University.
145. Helly, E. 1930. Uber Systeme von abgeschlossenen Mengen mit gemeinschaftlichen Punkten. Monaths. Math. und Physik 37, 281-302.
146. Heppes, A. 1956. Beweis einer Vermutung von A. Vazonyi. Acta Math. Acad. Sci. Hungar. 7, 463-466.
147. Hershberger, J. 1992. Minimizing the sum of diameters efficiently. Comput. Geom. Theor. Appl. 2, 111-118.
148. Hershberger, J. 1993. A faster algorithm for the two-center decision problem. Inf. Process. Lett. 47, 23-29.
149. Hershberger, J. and Suri, S. 1991. Finding tailored partitions. J. Alg. 12, 431-463.
150. Hershberger, J. and Suri, S. 1993. Efficient computation of Euclidean shortest paths in the plane. in Proceedings of the 34th Annual IEEE Symposium on the Foundations of Computer Science, 508-517.
151. Hershberger, J. and Suri, S. 1993b. Matrix searching with the shortest path metric. in Proceedings of the 25th Annual ACM Symposium on Theory Computation, 485-494.
152. Hochbaum, D. S. and Maas, W. 1985. Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32, 130-136.
153. Hochbaum, D. S. and Maas, W. 1987. Fast approximation algorithms for a nonconvex covering problem. J. Alg. 8, 305-323.
154. Hochbaum, D. S. and Shmoys, D. 1985. A best possible heuristic for the k-center problem. Math. Oper. Res. 10, 180-184.
155. Hochbaum, D. S. and Shmoys, D. 1986. A unified approach to approximation algorithms for bottleneck problems. J. ACM 33, 533-550.
156. Hocken, R. J., Raja, J., and Babu, U. 1993. Sampling issues in coordinate metrology. Man. Rev. 6, 282-294.
157. Hoppe, H. 1997. View-dependent refinement of progressive meshes. In Proceedings of SIGGRAPH ’97, 189-198.
158. Hoppe, H., DeRose, T., Duchamp, T., Halstead, M., Jin, H., McDonald, J., Schweitzer, J., and Stuetzle, W. 1994. Piecewise smooth surface reconstruction. In Proceedings of SIGGRAPH ’94, 295-302.
159. Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., and Stuetzle, W. 1993. Mesh optimization. In Proceedings of SIGGRAPH ’93, 19-26.
160. Houle, M. E. and Toussaint, G. T. 1988. Computing the width of a set. IEEE Trans. Patt. Anal. Mach. Intell. PAMI-10, 761-765.
161. ∞-approximation and applications. In Proceedings of the First Workshop on Algorithms Data Structures, LNCS 382, Springer-Verlag, 183-191.
162. Huttenlocher, D. P. and Kedem, K. 1990. Computing the minimum Hausdorff distance for point sets under translation. In Proceedings of the Sixth Annual ACM Symposium on Computational Geometry, 340-349.
163. Huttenlocher, D. P., Kedem, K., and Sharir, M. 1993. The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom. 9, 267-291.
164. Huttenlocher, D. P., Klanderman, G. A., and Rucklidge, W. J. 1993. Comparing images using the Hausdorff distance. IEEE Trans. Patt. Anal. Mach. Intell. 15, 850-863.
165. Hwang, R. Z., Chang, R. C., and Lee, R. C. T. 1993a. The generalized searching over separators strategy to solve some NPhard problems in subexponential time. Algorithmica 9, 398-423.
166. Hwang, R. Z., Lee, R. C. T., and Chang, R. C. 1993b. The slab dividing approach to solve the Euclidean p -center problem. Algorithmica 9, 1-22.
167. Imai, H., Lee, D., and Yang, C. 1992. 1-segment center covering problems. ORSA J. Comput. 4, 426-434.
168. Jadhav, S. and Mukhopadhyay, A. 1994. Computing a centerpoint of a finite planar set of points in linear time. Discrete Comput. Geom. 12, 291-312.
169. Jadhav, S., Mukhopadhyay, A., and Bhattacharya, B. K. 1996. An optimal algorithm for the intersection radius of a set of convex polygons. J. Alg. 20, 244-267.
170. Jain, A. K. and Dubes, R. C. 1988. Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs, NJ.
171. Jaromczyk, J. W. and Kowaluk, M. 1994. An efficient algorithm for the Euclidean two-center problem. In Proceedings of the Tenth Annual ACM Symposium on Computational Geometry, 303-311.
172. Jaromczyk, J. W. and Kowaluk, M. 1995a. A geometric proof of the combinatorial bounds for the number of optimal solutions to the 2-center Euclidean problem. In Proceedings of the Seventh Canadian Conference on Computational Geometry, 19-24.
173. Jaromczyk, J. W. and Kowaluk, M. 1995b. The two-line center problem from a polar view: A new algorithm and data structure. In Proceedings of the Fourth Workshop on Algorithms Data Structures, LNCS 955, Springer-Verlag, 13-25.
174. Kalai, G. 1992. A subexponential randomized simplex algorithm. In Proceedings of the 24th Annual ACM Symposium on the Theory of Computation, 475-482.
175. Karmarkar, N. 1984. A new polynomial-time algorithm for linear programming. Combinatorica 4, 373-395.
176. Katz, M. J. 1995. Improved algorithms in geometric optimization via expanders. In Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 78-87.
177. Katz, M. J. and Nielsen, F. 1996. On piercing sets of objects. In Proceedings of the Twelfth Annual ACM Symposium on Computational Geometry, 113-121.
178. Katz, M. J. and Sharir, M. 1993. Optimal slope selection via expanders. Inf. Process. Lett. 47, 115-122.
179. Katz, M. J. and Sharir, M. 1997. An expanderbased approach to geometric optimization. SIAMJ. Comput. 26, 1384-1408.
180. Kaufman, L. and Rousseeuw, P. J. 1990. Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, New York.
181. Khachiyan, L. G. 1980. Polynomial algorithm in linear programming. U.S.S.R. Comput. Math. Math. Phys. 20, 53-72.
182. Khuller, S. and Sussmann, Y. J. 1996. The capacitated k-center problem. In Proceedings of the Fourth Annual European Symposium of Algorithms, LNCS 1136, Springer-Verlag, 152-166.
183. Knuth, D. E. 1973. Sorting and Searching. Addison-Wesley, Reading, MA.
184. ∞-distance. Discrete Appl. Math. 40, 397-410.
185. Ko, M. T. and Lee, R. C. T. 1991. On weighted rectilinear 2-center and 3-center problems. Inf. Sci. 54, 169-190.
186. Ko, M. T., Lee, R. C. T., and Chang, J. S. 1990. An optimal approximation algorithm for the rectilinear m-center problem. Algorithmica 5, 341-352.
187. Korneenko, N. M. and Martini, H. 1993. Hyperplane approximation and related topics. In New Trends in Discrete and Computational Geometry, J. Pach, Ed., Algorithms and Combinatorics, Springer-Verlag, Heidelberg, 135-161.
188. Landau, U. M. 1987. Estimation of circular arc and its radius. Comput. Vis. Graph. Image Process 38, 317-326.
189. Le, V. B. and Lee, D. T. 1991. Out-of-roundness problem revisited. IEEE Trans. Patt. Anal. Mach. Intell. PAMI-13, 217-223.
190. Lee, D. T. and Wu, Y. F. 1986. Geometric complexity of some location problems. Algorithmica 1, 193-211.
191. Leven, D. and Sharir, M. 1987. On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space. Discrete Comput. Geom. 2, 255-270.
192. Lo, C.-Y. and Steiger, W. 1990. An optimaltime algorithm for ham-sandwich cuts in the plane. in Proceedings of the Second Canadian Conference on Computational Geometry, 5-9.
193. Lo, C.-Y., MatouSek, J., and Steiger, W. L. 1994. Algorithms for ham-sandwich cuts. Discrete Comput. Geom. 11, 433-452.
194. Luebke, D. and Erikson, C. 1997. View-dependent simplification of arbitrary polygonal environments. In Proceedings of SIGGRAPH ’97, 199-208.
195. Maass, W. 1986. On the complexity of nonconvex covering. SIAM J. Comput. 15, 453-467.
196. Magillo, P. and De Floriani, L. 1996. Maintaining multiple levels of detail in the overlay of hierarchical subdivisions. in Proceedings of the Eighth Canadian Conference on Computational Geometry, 190-195.
197. Makhoul, J., Roucos, S., and Gish, H. 1985. Vector quantization in speech coding. In Proceedings of the IEEE 73, 1551-1588.
198. MatouSek, J. 1991a. Computing the center of planar point sets. in Computational Geometry: Papers from the DIMACS Special Year, J. E. Goodman, R. Pollack, and W. Steiger, Eds., American Mathematical Society, Providence, 221-230.
199. MatouSek, J. 1991b. Randomized optimal algorithm for slope selection. Inf. Process. Lett. 39, 183-187.
200. MatouSek, J. 1992. Efficient partition trees. Discrete Comput. Geom. 8, 315-334.
201. MatouSek, J. 1993. Linear optimization queries. J. Alg. 14, 432-448.
202. MatouSek, J. 1994. Lower bound for a subexponential optimization algorithm. Random Struct. Alg. 5, 591-607.
203. MatouSek, J. 1995a. On enclosing k points by a circle. Inf. Process. Lett. 53, 217-221.
204. MatouSek, J. 1995b. On geometric optimization with few violated constraints. Discrete Comput. Geom. 14, 365-384.
205. MatouSek, J. and Schwarzkopf, O. 1996. A deterministic algorithm for the three-dimensional diameter problem. Comput. Geom. Theor. Appl. 6, 253-262.
206. MatouSek, J., Mount, D. M., and Netanyahu, N. S. 1993. Efficient randomized algorithms for the repeated median line estimator. in Proceedings of the Fourth ACM-SIAM Symposium on Discrete Algorithms, 74-82.
207. MatouSek, J., Sharir, M., and Welzl, E. 1996.
208. A subexponential bound for linear programming. Algorithmica 16, 498-516.
209. Meghini, C. 1995. An image retrieval model based on classical logic. in Proceedings of the Sixteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 300-308.
210. Megiddo, N. 1979. Combinatorial optimization with rational objective functions. Math. Oper. Res. 4, 414-424.
211. Megiddo, N. 1983a. Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30, 852-865.
212. 3 and related problems. SIAM J. Comput. 12, 759-776.
213. Megiddo, N. 1983. The weighted Euclidean 1-center problem. Math. Oper. Res. 8, 498-504.
214. Megiddo, N. 1984. Linear programming in linear time when the dimension is fixed. J. ACM 31, 114-127.
215. Megiddo, N. 1985. Partitioning with two lines in the plane. J. Alg. 6, 430-433.
216. Megiddo, N. 1989. On the ball spanned by balls. Discrete Comput. Geom. 4, 605-610.
217. Megiddo, N. 1990. On the complexity of some geometric problems in unbounded dimension. J. Symbol. Comput. 10, 327-334.
218. Megiddo, N. and Supowit, K. J. 1984. On the complexity of some common geometric location problems. SIAM J. Comput. 13, 182-196.
219. Megiddo, N. and Tamir, A. 1982. On the complexity of locating linear facilities in the plane. Oper. Res. Lett. 1, 194-197.
220. Megiddo, N. and Zemel, E. 1986. A randomized O(n log n) algorithm for the weighted Euclidean 1-center problem. J. Alg. 7, 358-368.
221. Mehlhorn, K., Shermer, T., and Yap, C. 1997. A complete roundness classification procedure. In Proceedings of the Thirteenth Annual ACM Symposium on Computational Geometry, 129-138.
222. Mitchell, J. S. B. 1993. Shortest paths among obstacles in the plane. in Proceedings of the Ninth Annual ACM Symposium on Computational Geometry, 308-317.
223. Mitchell, J. S. B. 1996. Shortest paths and networks. Tech. Rep., University at Stony Brook.
224. Mitchell, J. S. B. and Suri, S. 1995. Separation and approximation of polyhedral objects. Comput. Geom. Theor. Appl. 5, 95-114.
225. Mitchell, J. S. B., Mount, D. M., and Suri, S. 1994. Query-sensitive ray shooting. In Proceedings of the Tenth Annual ACM Symposium on Computational Geometry, 359-368.
226. Mohaban, S. and Sharir, M. 1997. Ray shooting amidst spheres in three dimensions and related problems. SIAM J. Comput. 26, 654-664.
227. Motwani, R. and Raghavan, P. 1995. Randomized Algorithms. Cambridge University Press, New York.
228. Mulmuley, K. 1994. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice-Hall, Englewood Cliffs, NJ.
229. Naor, N. and Sharir, M. 1990. Computing a point in the center of a point set in three dimensions. In Proceedings of the Second Canadian Conference on Computational Geometry, 10-13.
230. Norton, C. H., Plotkin, S. A., and Tardos, E. 1992. Using separation algorithms in fixed dimensions. J. Alg. 13, 19-98.
231. Papadimitriou, C. H. 1981. Worst-case and probabilistic analysis of a geometric location problem. SIAM J. Comput. 10, 542-551.
232. Pellegrini, M. 1993. Ray shooting on triangles in 3-space. Algorithmica 9, 411-494.
233. Pellegrini, M. 1994. On collision-free placements of simplices and the closest pair of lines in 3-space. SIAM J. Comput. 23, 133-153.
234. Pellegrini, M. 1996. Repetitive hidden surface removal for polyhedra. J. Alg. 21, 80-101.
235. Plesnik, J. 1981. A heuristic for the p-center problem in graphs. Discrete Appl. Math. 17, 263-268.
236. Post, M. J. 1984. Minimum spanning ellipsoids. in Proceedings of the Sixteenth Annual ACM Symposium on the Theory of Computation, 108-116.
237. Ramos, E. 1991a. Construction of 1-d lower envelopes and applications. in Proceedings of the Thirteenth Annual ACM Symposium on Computational Geometry, 51-66.
238. 3. Comput. Geom. Theor. Appl. 8, 51-65.
239. Rao, S. and Smith, W. D. 1988. Improved approximation schemes for geometric graphs via “spanners” and “banyans.” In Proceedings of the Thirtieth Annual ACM Symposium Theory of Computation (to appear).
240. Reichling, M. 1988a. On the detection of a common intersection of k convex objects in the plane. Inf. Process. Lett. 29, 25-29.
241. Reichling, M. 1988b. On the detection of a common intersection of k convex polyhedra. In Computational Geometry and its Applications, LNCS 333, Springer-Verlag, 180-186.
242. Reif, J. H. and Storer, J. A. 1994. A singleexponential upper bound for finding shortest paths in three dimensions. J. ACM 41, 1013-1019.
243. Roos, T. and Widmayer, P. 1994. k-Violation linear programming. Inf. Process. Lett. 52, 109-114.
244. Roy, U. and Zhang, X. 1992. Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error. Comput. Aided Des. 24, 161-168.
245. Salowe, J. 1989. Interdistance selection by parametric search. Inf. Process. Lett. 30, 9-14.
246. Sarnak, N. and Tarjan, R. E. 1986. Planar point location using persistent search trees. Commun. ACM 29, 669-679.
247. SchOmer, E. and Thiel, C. 1995. Efficient collision detection for moving polyhedra. in Proceedings of the Eleventh Annual ACM Symposium on Computational Geometry, 51-60.
248. SchOmer, E., Sellen, J., and Teichmann, M., and Yap, C. 1996. Efficient algorithms for the smallest enclosing cylinder problem. in Proceedings of the Eighth Canadian Conference on Computational Geometry, 264-269.
249. Schroeter, P. and BigUn, J. 1995. Hierarchical image segmentation by multi-dimensional clustering and orientation-adaptive boundary refinement. Patt. Recogn. 28, 695-709.
250. Seidel, R. 1991. Small-dimensional linear programming and convex hulls made easy. Discrete Comput. Geom. 6, 423-434.
251. Seidel, R. 1993. Backwards analysis of randomized geometric algorithms. In New Trends in Discrete and Computational Geometry, J. Pach, Ed., Springer-Verlag, Heidelberg, 31-68.
252. Sen, S. 1996. Parallel multidimensional search using approximation algorithms: With applications to linear-programming and related problems. In Proceedings of the Eighth ACM Symposium on Parallel Algorithms and Architectures, 251-260.
253. Shafer, J., Agrawal, R., and Mehta, M. 1996. Sprint: A scalable parallel classifier for data mining. in Proceedings of the 22nd International Conference on Very Large Databases.
254. Shafer, L. and Steiger, W. 1993. Randomizing optimal geometric algorithms. in Proceedings of the Fifth Canadian Conference on Computational Geometry, 133-138.
255. Sharir, M. 1991. A near-linear algorithm for the planar 2-center problem. Discrete Comput. Geom. 18, 125-134.
256. Sharir, M. and Agarwal, P. K. 1995. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York.
257. Sharir, M. and Toledo, S. 1994. Extremal polygon containment problems. Comput. Geom. Theor. Appl. 4, 99-118.
258. Sharir, M. and Welzl, E. 1992. A combinatorial bound for linear programming and related problems. in Proceedings of the Ninth Symposium on Theoretical Aspects of Computer Science, LNCS 577, Springer-Verlag, 569-579.
259. Sharir, M. and Welzl, E. 1996. Rectilinear and polygonal p-piercing and p-center problems. in Proceedings of the Twelfth Annual ACM Symposium on Computational Geometry, 122-132.
260. Sommerville, D. M. Y. 1951. Analytical Geometry in Three Dimensions. Cambridge University Press, Cambridge, UK.
261. Stein, A. and Werman, M. 1992. Finding the repeated median regression line. In Proceedings of the Third ACM-SIAM Symposium on Discrete Algorithms, 409-413.
262. Stein, A. and Werman, M. 1992b. Robust statistics in shape fitting. In Proceedings of the IEEE International Conference on Computer Vision Pattern Recognition, 540-546.
263. Swanson, D. T., Lee, D. T., and Wu, V. L. 1995. An optimal algorithm for roundness determination on convex polygons. Comput. Geom. Theor. Appl. 5, 225-235.
264. Thomas, S. M. and Chen, Y. T. 1989. A simple approach for the estimation of circular arc and its radius. Comput. Vis. Graph. Image Process. 45, 362-370.
265. Toledo, S. 1991. Extremal polygon containment problems and other issues in parametric searching. M.S. Thesis, Dept. of Computer Science, Tel Aviv University, Tel Aviv.
266. Toledo, S. 1993a. Approximate parametric search. Inf. Process. Lett. 47, 1-4.
267. Toledo, S. 1993b. Maximizing non-linear concave functions in fixed dimension. In Complexity in Numerical Computations, P. M. Pardalos, Ed., World Scientific, Singapore, 429-447.
268. Valiant, L. 1975. Parallelism in comparison problems. SIAM J. Comput. 4, 348-355.
269. Varadarajan, K. R. 1996. Approximating monotone polygonal curves using the uniform metric. In Proceedings of the Twelfth Annual ACM Symposium on Computational Geometry, 311-318.
270. Varadarajan, K. R. and Agarwal, P. K. 1995. Linear approximation of simple objects. In Proceedings of the Seventh Canadian Conference on Computational Geometry, 13-18.
271. Voelcker, H. 1993. Current perspective on tolerancing and metrology. Man. Rev. 6, 258-268.
272. Welzl, E. 1991. Smallest enclosing disks (balls and ellipsoids). In New Results and New Trends in Computer Science, H. Maurer, Ed., LNCS 555, Springer-Verlag, 359-370.
273. Wesolowsky, G. 1993. The Weber problem: History and perspective. Loca. Sci. 1, 5-23.
274. Whang, K. Y., Song, J. W., Chang, J. W., Kim, J. Y., Cho, W. S., Park, C. M., and Song, I. Y. 1995. Octree-R: An adaptible octree for efficient ray tracing. IEEE Trans. Vis. Comput. Graph. 1, 343-349.
275. Yao, A. C. and Yao, F. F. 1985. A general approach to D-dimensional geometric queries. In Proceedings of the Seventeenth Annual ACM Symposium on the Theory of Computation, 163-168.
276. Yianilos, P. N. 1993. Data structures and algorithms for nearest neighbor search in general metric spaces. In Proceedings of the Fourth ACM-SIAM Symposium on Discrete Algorithms, 311-321.
277. Zemel, E. 1987. A linear time randomizing algorithm for searching ranked functions. Algorithmica 2, 81-90.