Computing a double-ray center for a planar point set

International Journal of Computational Geometry and Applications

Volumn 9, Issue 2, 1999, Pages 109-123

  Glozman, Alex ^a   Kedem, Klara ^a   Shpitalnik, Gregory ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Algorithm; Center; Hausdorff distance; Optimization; Planar point set

Indexed keywords

EID: 0033409991     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195999000091     Document Type: Article

References (17)

1. M.J. Atallah and M.T. Goodrich, "Efficient parallel solutions to some geometric problems", J. Parallel and Distributed Computing, 3(1986) 492-507.
2. P. K. Agarwal and M. Sharir, "Planar geometric location problem and maintaining the width of a planar set", Algorithmica, 11(1994) 185-195.
3. M. de Berg, H. Meijer, M. Overmars and G. Wilfong, "Computing the angularity tolerance", Proc. 8th Canad. Conf. Comput. Geom., 1994 331-336.
4. R. Cole and M. T. Goodrich, "Optimal parallel algorithms for polygon and point set problems", Algorithmica, 7(1992) 3-23.
5. B. Chazelle and D.T. Lee, "On a circle placement problem", Computing, 1(1986) 1-16.
6. H. Edelsbrunner, Algorithms in Combinatorial Geometry, (Springer-Verlag, Heidelberg, Germany 1987).
7. H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, M. Sharir, "Arrangements of curves in the plane - topology, combinatorics and algorithms", Theoretical Computer Science, 92(1992) 319-336.
8. D. Eppstein, "Faster construction of planar two-centers", 8th ACM-SIAM Symp. Discrete Algorithms, New Orleans (1997) 131-138.
9. A. Glozman, K. Kedem and G. Shpitalnik, "On some geometric selection and optimization problems via sorted matrices", Fourth Workshop on Algorithms and Data Structures, S.G. Akl, F. Dehne, J. Sack and N. Santoro, editors, Lecture Notes in Computer Science 955(1995), Springer-Verlag 26-35.
10. R.L. Graham and F.F. Yao, "Finding the convex hull of a simple polygon", J. Algorithms, 4(1983) 324-331.
11. J. Hershberger and S. Suri. "Finding tailored partitions", J. Algorithms, 12 (1991) 431-463.
12. J.W. Jaromczyk and M. Kowaluk, "The two-line center problem from a polar view: a new algorithm and data structure", Fourth Workshop on Algorithms and Data Structures, S.G. Akl, F. Dehne, J. Sack and N. Santoro, editors, Lecture Notes in Computer Science 955(1995), Springer-Verlag 13-25.
13. M.J. Katz, "Improved algorithms in geometric optimization via expanders", Proc. 3rd Israel Symposium on Theory of Computing and Systems, (1995) 78-87.
14. M.J. Katz and M. Sharir, "An expander-based approach to geometric optimization", SIAM J. of Comput., 26(1997) 1384-1408.
15. D.T. Lee and Y. Wu, "Geometric complexity of some location problems", Algorithmica, 1(1986) 193-211.
16. 3 and related problems", SIAM J. of Comput., 12(1983) 759-776.
17. M. Sharir, "A near-linear algorithm for the planar 2-center problem", Discrete Comput. Geom. 18(1997) 125-134.