Geometric applications of a randomized optimization technique

Discrete and Computational Geometry

Volumn 22, Issue 4, 1999, Pages 547-567

  Chan, T M ^a,b  

^a UNIVERSITY OF MIAMI   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033461748     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009478     Document Type: Article

References (67)

1. P. K. Agarwal and J. Matoušek. Ray shooting and parametric search. SIAM J. Comput., 22:764-806, 1993.
2. P. K. Agarwal and M. Sharir. Efficient randomized algorithms for some geometric optimization problems. Discrete Comput. Geom., 16:317-337, 1996.
3. P. K. Agarwal and M. Sharir. Efficient algorithms for geometric optimization. Technical Report CS-1996-19, Department of Computer Science, Duke University, Durham, NC, 1996.
4. P. K. Agarwal, M. Sharir, and S. Toledo. Applications of parametric searching in geometric optimization. J. Algorithms, 17:292-318, 1994.
5. P. K. Agarwal, M. Sharir, and E. Welzl. The discrete 2-center problem. Discrete Comput. Geom., 20:287-305, 1998.
6. A. Aggarwal, H. Imai, N. Katoh, and S. Suri. Finding k points with minimum diameter and related problems. J. Algorithms, 12:38-56, 1991.
7. N. M. Amato, M. T. Goodrich, and E. Ramos. Parallel algorithms for higher-dimensional convex hulls. In Proc. 35th IEEE Symp. Found. Comput. Sci., pages 683-694, 1994.
8. S. Arya and D. M. Mount. Approximate nearest neighbor queries in fixed dimensions. In Proc. 4th ACM-SIAM Symp. Discrete Algorithms, pages 271-280, 1993.
9. M. Ben-Or. Lower bounds for algebraic computation trees. In Proc. 15th ACM Symp. Theory Comput., pages 80-86, 1983.
10. B. K. Bhattacharya and H. ElGindy. Biased search and j-point clustering. In Proc. 9th Canad. Conf. Comput. Geom., pages 141-146, 1997.
11. H. Brönnimann and B. Chazelle. Optimal slope selection via cuttings. Comput. Geom. Theory Appl., 10:23-29, 1998.
12. H. Brönnimann, B. Chazelle, and J. Matoušek. Product range spaces, sensitive sampling, and derandomization. In Proc. 34th IEEE Symp. Found. Comput. Sci., pages 400-409, 1993.
13. T. M. Chan. Fixed-dimensional linear programming queries made easy. In Proc. 12th ACM Symp. Comput. Geom., pages 284-290, 1996.
14. T. M. Chan. Output-sensitive results on convex hulls, extreme points, and related problems. Discrete Comput. Geom., 16:369-387, 1996.
15. T. M. Chan. More planar two-center algorithms. Manuscript, 1997.
16. B. Chazelle. Cutting hyperplanes for divide- and-conquer. Discrete Comput. Geom., 9:145-158, 1993.
17. B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir. Diameter, width, closest line pair and parametric searching. Discrete Comput. Geom., 10:183-196, 1993.
18. L. P. Chew, D. Dor, A. Efrat, and K. Kedem. Geometric pattern matching in d-dimensional space. Discrete Comput. Geom., 21:257-274, 1999.
19. L. P. Chew, M. T. Goodrich, D. P. Huttenlocher, K. Kedem, J. M. Kleinberg, and D. Kravets. Geometric pattern matching under Euclidean motion. Comput. Geom. Theory Appl., 7:113-124, 1997.
20. L. P. Chew and K. Kedem. Getting around a lower bound for the minimum Hausdorff distance. Comput. Geom. Theory Appl., 10:197-202, 1998.
21. K. L. Clarkson. New applications of random sampling in computational geometry. Discrete Comput. Geom., 2:195-222, 1987.
22. K. L. Clarkson. Las Vegas algorithms for linear and integer programming when the dimension is small. J. Assoc. Comput. Mach., 42:488-499, 1995.
23. K. L. Clarkson. Algorithms for the minimum diameter of moving points and for the discrete 1-center problem. Manuscript, 1997.
24. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
25. R. Cole. Slowing down sorting networks to obtain faster sorting algorithms. J. Assoc. Comput. Mach., 34:200-208, 1987.
26. R. Cole, J. Salowe, W. Steiger, and E. Szemerédi. An optimal-time algorithm for slope selection. SIAM J. Comput., 18:792-810, 1989.
27. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
28. A. Datta, H.-P. Lenhof, C. Schwarz, and M. Smid. Static and dynamic algorithms for k-point clustering problems. J. Algorithms, 19:474-503, 1995.
29. M. Dillencourt, D. Mount, and N. Netanyahu. A randomized algorithm for slope selection. Internat. J. Comput. Geom. Appl., 2:1-27, 1992.
30. Z. Drezner. On the rectangular p-center problem. Naval Res. Logist. Quart., 34:229-234, 1987.
31. M. E. Dyer. Linear time algorithms for two- and three-variable linear programs. SIAM J. Comput., 13:31-45, 1984.
32. A. Efrat, M. Lindenbaum, and M. Sharir. Finding maximally consistent sets of halfspaces. In Proc. 5th Canad. Conf. Comput. Geom., pages 432-436, 1993.
33. A. Efrat, M. Sharir, and A. Ziv. Computing the smallest k-enclosing circle and related problems. Comput. Geom. Theory Appl., 4:119-136, 1994.
34. D. Eppstein. Faster construction of planar two-centers. In Proc. 8th ACM-SIAM Symp. Discrete Algorithms, pages 131-138, 1997.
35. D. Eppstein and J. Erickson. Iterated nearest neighbors and finding minimal polytopes. Discrete Comput. Geom., 11:321-350, 1994.
36. H. Everett, J.-M. Robert, and M. van Kreveld. An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems. Internat. J. Comput. Geom. Appl., 6:247-261, 1996.
37. G. N. Frederickson and D. B. Johnson. The complexity of selection and ranking in X + Y and matrices with sorted rows and columns. J. Comput. System Sci., 24:197-208, 1982.
38. F. Gao, L. J. Guibas, D. G. Kirkpatrick, W. T. Laaser, and J. Saxe. Finding extrema with unary predicates. Algorithmica, 9:591-600, 1993.
39. A. Glozman, K. Kedem, and G. Shpitalnik. On some geometric selection and optimization problems via sorted matrices. Comput. Geom. Theory Appl., 11:17-28, 1998.
40. S. Har-Peled. Constructing cuttings in theory and practice. In Proc. 14th ACM Symp. Comput. Geom., pages 327-336, 1998.
41. D. P. Huttenlocher, K. Kedem, and M. Sharir. The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom., 9:267-291, 1993.
42. M. J. Katz and M. Sharir. Optimal slope selection via expanders. Inform. Process. Lett., 47:115-122, 1993.
43. M. J. Katz and M. Sharir. An expander-based approach to geometric optimization. SIAM J. Comput., 26:1384-1408, 1997.
44. D. E. Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming. Addison-Wesley, Reading, MA, 1968.
45. A. Lubotzky, R. Phillips, and P. Samak. Explicit expanders and the Ramanujan conjectures. In Proc. 18th ACM Symp. Theory Comput., pages 240-246, 1986.
46. C. Makris and A. Tsakalidis. Fast piercing of iso-oriented rectangles. In Proc. 9th Canad. Conf. Comput. Geom., pages 217-222, 1997.
47. J. Matoušek. Randomized optimal algorithm for slope selection. Inform. Process. Lett., 39:183-187, 1991.
48. J. Matoušek. Efficient partition trees. Discrete Comput. Geom., 8:315-334, 1992.
49. J. Matoušek. Reporting points in halfspaces. Comput. Geom. Theory Appl., 2:169-186, 1992.
50. J. Matoušek. On enclosing k points by a circle. Inform. Process. Lett., 53:217-221, 1995.
51. J. Matoušek. On geometric optimization with few violated constraints. Discrete Comput. Geom., 14:365-384, 1995.
52. J. Matoušek. On constants for cuttings in the plane. Discrete Comput. Geom., 20:427-448, 1998.
53. J. Matoušek and O. Schwarzkopf. A deterministic algorithm for the three-dimensional diameter problem. Comput. Geom. Theory Appl., 6:253-262, 1996.
54. N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. J. Assoc. Comput. Mach., 30:852-865, 1983.
55. 3 and related problems. SIAM J. Comput., 12:759-776, 1983.
56. N. Megiddo. Linear programming in linear time when the dimension is fixed. J. Assoc. Comput. Mach., 31:114-127, 1984.
57. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
58. M. O. Rabin. Probabilistic algorithms. In Algorithms and Complexity (J. F. Traub, ed.), pages 21-30, Academic Press, New York, 1976.
59. E. Ramos. Construction of 1-d lower envelopes and applications. In Proc. 13th ACM Symp. Comput. Geom., pages 57-66, 1997.
60. T. Roos and P. Widmayer. k-Violation linear programming. Inform. Process. Lett., 52:109-114, 1994.
61. E. Schömer and C. Thiel. Efficient collision detection for moving polyhedra. In Proc. 11th ACM Symp. Comput. Geom., pages 51-60, 1995.
62. M. Segal. On piercing of axis-parallel rectangles and rings. In Proc. 5th European Symp. Algorithms, Lecture Notes in Computer Science, vol. 1284, Springer-Verlag, Berlin, pages 430-442, 1997.
63. R. Seidel. Small-dimensional linear programming and convex hulls made easy. Discrete Comput. Geom., 6:423-434, 1991.
64. M. Sharir. A near-linear algorithm for the planar 2-center problem. Discrete Comput. Geom., 18:125-134, 1997.
65. M. Sharir and E. Welzl. A combinatorial bound for linear programming and related problems. In Proc. 9th Symp. Theoret. Aspects Comput. Sci., Lecture Notes in Computer Science, vol. 577, Springer-Verlag, Berlin, pages 569-579, 1992.
66. M. Sharir and E. Welzl. Rectilinear and polygonal p-piercing and p-center problems. In Proc. 12th ACM Symp. Comput. Geom., pages 122-132, 1996.
67. A. C.-C. Yao. Decision tree complexity and Betti numbers. J. Comput. System Sci., 55:36-43, 1997.