Packing two disks into a polygonal environment

Journal of Discrete Algorithms

Volumn 2, Issue 3, 2004, Pages 373-380

  Bose, Prosenjit ^a   Morin, Pat ^a   Vigneron, Antoine ^b  

^a CARLETON UNIVERSITY   (Canada)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Computational geometry; Disk packing; Origami

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; DECISION THEORY; MATHEMATICAL MODELS; OPTIMIZATION; THEOREM PROVING; TREES (MATHEMATICS);

DECISION TREE MODELS; DISK PACKING; ORIGAMI; POLYGONS;

PROBLEM SOLVING;

EID: 10644263691     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2003.12.003     Document Type: Article

References (12)

1. P.K. Agarwal, J. Matoušek, S. Suri, Farthest neighbors, maximum spanning trees, and related problems in higher dimensions, Computational Geometry 4 (1992) 189-201.
2. H. Alt, O. Schwarzkopf, The Voronoi diagram of curved objects, in: Proceedings of the 11th Annual ACM Symposium on Computational Geometry, 1995, pp. 89-97.
3. B. Ben-Moshe, M.J. Katz, M. Segal, Obnoxious facility location: Complete service with minimal harm, Internat. J. Comput. Geom. Appl. (2000) 581-592.
4. S. Bespamyatnikh, Packing two disks in a polygon, Computational Geometry 23 (1) (2002) 31-42.
5. T.C. Biedl, E.D. Demaine, M.L. Demaine, A. Lubiw, G.T. Toussaint, Hiding disks in folded polygons, in: Proceedings of the 10th Canadian Conference on Computational Geometry (CCCG'98), 1998.
6. P. Bose, J. Czyzowicz, E. Kranakis, A. Maheshwari, Algorithms for packing two circles in a convex polygon, in: Proceedings of Japan Conference on Discrete and Computational Geometry (JCDCG'98), 1998, pp. 93-103.
7. F. Chin, J. Snoeyink, C.A. Wang, Finding the medial axis of a simple polygon in linear time, Discrete Comput. Geom. 21 (1999) 405-420.
8. K.L. Clarkson, P.W. Shor, Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental, in: Proceedings of the Fourth Annual ACM Symposium on Computational Geometry (SoCG'88), 1988, pp. 12-17.
9. M.J. Katz, K. Kedem, M. Segal, Improved algorithms for placing undesirable facilities, in: Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), vol. 29, 2002, pp. 1859-1872.
10. S.K. Kim, C.-S. Shin, Placing two disks in a convex polygon, Inform. Process. Lett. 73 (2000).
11. N. Megiddo, Applying parallel computation algorithms to the design of serial algorithms, J. ACM 30 (1983) 852-865.
12. F.P. Preparata, M.I. Shamos, Computational Geometry, Springer-Verlag, New York, 1985.