Packing two disks in a polygon

Computational Geometry: Theory and Applications

Volumn 23, Issue 1, 2002, Pages 31-42

  Bespamyatnikh, Sergei ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Computational geometry; Optimization; Parametric searching

Indexed keywords

EID: 31244436157     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(01)00044-X     Document Type: Article

References (22)

1. A. Aggarwal, L.J. Guibas, J. Saxe, P.W. Shor, A linear-time algorithm for computing the Voronoi diagram of a convex polygon, Discrete Comput. Geom. 4 (6) (1989) 591-604.
2. M.J. Atallah, S.R. Kosaraju, An efficient parallel algorithm for the row minima of a totally monotone matrix, J. Algorithms 13 (1992) 394-413.
3. F. Aurenhammer, Voronoi diagrams: A survey of a fundamental geometric data structure, ACM Comput. Surv. 23 (3) (1991) 345-405.
4. B. Ben-Moshe, M.J. Katz, M. Segal, Obnoxious facility location: complete service with minimal harm, Internat. J. Comput. Geom. Appl. 10 (6) (2000) 581-592.
5. S. Bespamyatnikh, Efficient algorithm for finding two largest empty circles, in: Proc. 15th European Workshop on Comput. Geometry, 1999, pp. 37-38.
6. T. Biedl, E. Demaine, M. Demaine, A. Lubiw, G. Toussaint, Hiding disks in folded polygons, in: Proc. 10th Canadian Conference on Comput. Geom., 1998, pp. 36-37.
7. P. Bose, J. Czyzowich, E. Kranakis, A. Maheshwari, Algorithms for packing two circles in a convex polygon, in: Japan Conference on Discrete and Comput. Geom. (JCDCG98), Lecture Notes in Computer Sciences, Vol. 1763, Springer, 2000, pp. 93-103.
8. P. Bose, P. Morin, A. Vigneron, Packing two disks into a polygonal environment, Report HKUST-TCSC-2001-02, Hong Kong University of Science and Technology, Department of Computer Science, 2001.
9. P.G. Bradford, R. Fleischer, M. Smid, More efficient parallel totally monotone matrix searching, J. Algorithms 23 (1997) 386-400.
10. P. Cappanera, Discrete facility location and routing of obnoxious activities, Report, Dip. di Matematica, Univ. di Milano, 1999 (Ph.D. Thesis).
11. B. Chazelle, A theorem on polygon cutting with applications, in: Proc. 23rd Ann. IEEE Sympos. Found. Comput. Sci., 1982, pp. 339-349.
12. F. Chin, J. Snoeyink, C.-A. Wang, Finding the medial axis of a simple polygon in linear time, Discrete Comput. Geom. 21 (3) (1999) 405-420.
13. Z. Drezner, Location, in: P.M. Pardalos, M.G.C. Resende (Eds.), Handbook of Applied Optimization, Oxford University Press, 2001.
14. Z. Drezner, E. Erkut, On the continuous p-dispersion problem, J. Oper. Res. Soc. 46 (1995) 516-520.
15. Z. Drezner, H. Harnacher, Facility Location: Applications and Methods, 1st Edition, Springer, Berlin, 2001.
16. L. Guibas, J. Hershberger, D. Leven, M. Sharir, R.E. Tarjan, Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica 2 (1987) 209-233.
17. S.K. Kirn, C.-S. Shin, T.-C. Yang, Placing two circles in a convex polygon, Inform. Process. Lett. 73 (1-2) (2000) 33-39.
18. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. ACM 30 (4) (1983) 852-865.
19. R. Miller, Q.F. Stout, Efficient parallel convex hull algorithms, IEEE Trans. Comput. C-37 (12) (1988) 1605-1618.
20. P.P. Preparata, M.I. Shamos, Computational Geometry: An Introduction, 3rd Edition, Springer, 1990.
21. M.I. Shamos, Computational Geometry, Ph.D. Thesis, Department of Computer Science, Yale University, New Haven, CT, 1978.
22. M.I. Shamos, D. Hoey, Closest-point problems, in: Proc. 16th Ann. IEEE Sympos. Found. Comput. Sci., 1975, pp. 151-162.