Applications of parametric searching in geometric optimization

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129721, Issue , 1992, Pages 72-82

  Agarwal, Pankaj K ^a   Sharir, Micha ^b,c   Toledo, Sivan ^c,d  

^a DUKE UNIVERSITY   (United States)

^b NEW YORK UNIVERSITY   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; GEOMETRY;

CENTER PROBLEMS; EUCLIDEAN METRICS; GEOMETRIC OPTIMIZATION; HAUSDORFF DISTANCE; NONTRIVIAL SOLUTION; PARAMETRIC SEARCHING; POLYGONAL REGIONS; SIMPLE POLYGON;

OPTIMIZATION;

EID: 84969379775     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (44)

1. P.K. Agarwal, B. Aronov, M. Sharir and S. Suri, Selecting distances in the plane, Proc. 6th ACM Symp. on Computational Geometry, 1990, 321-331. (Also to appear in Algorithmica.)
2. P.K. Agarwal, A. Efrat, M. Sharir and S. Toledo, Computing a segment-center for a planar point set, Tech. Rept. CS-1991-33, Dept. Computer Science, Duke University, 1991.
3. P.K. Agarwal and J. Matoušek, Ray shooting and parametric search, Tech. Rept. CS-1991-21, Dept. Computer Science, Duke University, 1991.
4. P.K. Agarwal and M. Sharir, Planar geometric location problems, Tech. Rept. 90-58, DIMACS, Rutgers University, August 1990. (Also to appear in Algorithmica.)
5. P.K. Agarwal and M. Sharir, Counting circular arc intersections, Proc. 7th ACM Symp. on Computational Geometry, 1991, 10-20.
6. P.K. Agarwal, M. Sharir and P. Shor, Sharp upper and lower bounds for the length of general Davenport-Schinzel sequences, J. Comhin. Theory, Ser. A 52 (1989), 228274.
7. P.K. Agarwal, M. Sharir and S. Toledo, Applications of parametric searching in geometric optimization, manuscript, 1991.
8. A. Aggarwal and S. Suri, The biggest diagonal in a simple polygon, Inf. Proc. Letters 35 (1990), 13-18.
9. H. Alt, B. Behrends and J. Blömer, Approximate matching of polygonal shapes, Proc. 7th ACM Symp. on Computational Geometry, 1991, 186-193.
10. M. Atallah, R. Cole and M. Goodrich, Cascading divide-and-conquer: A technique for designing parallel algorithms, SIAM J. Computing 18 (1989), 499-532.
11. J.L. Bentley and T. Ottmann, Algorithms for reporting and counting geometric intersections, IEEE Trans, on Computers C-28 (1979), 643-647.
12. B. Chazelle, The polygon containment problem, in Advances in Computing Research, Vol. I: Computational Geometry, (F.P. Preparata, Ed.), JAI Press, Greenwich, Connecticut (1983), pp. 1-33.
13. B. Chazelle, H. Edelsbrunner, L. Guibas and M. Sharir, A singly exponential stratification scheme for real semi-algebraic varieties and its applications, Theoretical Computer Science 84 (1991), 77-105.
14. (Also in Proc. 16th Int. Colloq. Automata, Lang. Prog., 1989, pp. 179-192.)
15. B. Chazelle, H. Edelsbrunner, L. Guibas and M. Sharir, Algorithms for Dichromatic line segment problems and polyhedral terrains, to appear in Algorithmica.
16. B. Chazelle, H. Edelsbrunner, L. Guibas and M. Sharir, Diameter, width, closest line-pair, and parametric searching, in preparation.
17. B. Chazelle and L. Guibas, Visibility and intersection problems in plane geometry, Discrete Comput. Geom. 4 (1989), 551-589.
18. B. Chazelle and M. Sharir, An algorithm for generalized point location and its applications, J. Symbolic Computation 10 (1990), pp. 281-309.
19. K. Clarkson and P. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom. 4 (1989), 387-422.
20. R. Cole, Slowing down sorting networks to obtain faster sorting algorithms, J. ACM 31 (1984), 200-208.
21. R. Cole, J. Salowe, W. Steiger and E. Szemerédi, Optimal slope selection, SIAM J. Computing 18 (1989), 792-810.
22. H. Ebara, N. Fukuyama, H. Nakano and Y. Nakanishi, Roundness algorithms using the Voronoi diagrams, First Canadian Conf. Computational Geometry, 1989.
23. G. Frederickson, Optimal algorithms for tree partitioning, Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms, 1991, 168-177.
24. G. Frederickson and D. Johnson, Finding the kth shortest paths and p-centers by generating and searching good data structures, J. Algorithms 4 (1983), 61-80.
25. M. Goodrich, Approximation algorithms to design parallel algorithms that may ignore processor allocation, Proc. Send Annual IEEE Symp. Foundations Computer Science, 1991, pp. 711-722.
26. S. Hart and M. Sharir, Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes, Combinatorica 6 (1986), 151-177.
27. J. Hershberger, Finding the upper envelope of n line segments in O(nlogn) time, Inf. Proc. Letters 33 (1989), 169-174.
28. D. Huttenlocher and K. Kedem, Efficiently computing the Hausdorff distance for point sets under translation, Proc. 6th ACM Symp. on Computational Geometry, 1990, 340-349.
29. D. Huttenlocher, K. Kedem and M. Sharir, The upper envelope of Voronoi surfaces and its applications, Proc. 7th ACM Symp. on Computational Geometry, 1991, 194203.
30. M.J. Katz, M.H. Overmars and M. Sharir, Efficient hidden surface removal for objects with small union size, Proc. 7th ACM Symp. on Computational Geometry, 1991, 31-40.
31. K. Kedem, R. Livne, J. Pach and M. Sharir, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles, Discrete Comput. Geom. 1 (1986), 59-71.
32. H. Imai, D.T. Lee, and C. Yang, 1-Segment covering problem, 1st Canadian Conf. Computational Geometry, 1989. Also, manuscript, 1991.
33. D. Leven and M. Sharir, On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space, Discrete Comput. Geom. 2 (1987), 255-270.
34. J. Matoušek, Randomized optimal algorithm for slope selection, Inf. Proc. Letters 39 (1991), 183-187.
35. J. Matoušek, Approximations and optimal geometric divide-and-conquer, Proc. 23rd ACM Symp. on Theory of Computing, 1991, 506-511.
36. J. Matoušek. Efficient partition trees, Proc. 7th ACM Symp. on Computational Geometry, 1991, 1-9.
37. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. ACM 30 (1983), 852-865.
38. N. Megiddo, Linear-time algorithms for linear programming in IR3 and related problems, SIAM J. Computing 12 (1983), 720-732.
39. N. Megiddo, Linear programming in linear time when the dimension is fixed, J. ACM 31 (1984), 114-127.
40. N. Naor and M. Sharir, Computing the center of a point set in three dimensions, Proc. 2nd Canadian Conf. on Computational Geometry (1990), pp. 10-13.
41. M. Sharir and S. Toledo, Extremal polygon containment problems, manuscript, 1991.
42. (See also S. Toledo, Extremal polygon containment problems, Proc. 7th ACM Symp. on Computational Geometry, 1991, 176-185.)
43. R. Tarjan and U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comp. 14 (1985), 862-874.
44. L. Valiant, Parallelism in comparison problems, SIAM J. Computing 4 (1975), 348-355.