Placing two disks in a convex polygon

Information Processing Letters

Volumn 73, Issue 1-2, 2000, Pages 33-39

  Kim, Sung Kwon ^a   Shin, Chan Su ^b   Yang, Tae Cheon ^c  

^a Chung Ang University   (South Korea)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; RESPONSE TIME (COMPUTER SYSTEMS);

CONVEX POLYGON; SHRUNKEN POLYGON;

COMPUTATIONAL GEOMETRY;

EID: 0033900917     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00154-4     Document Type: Article

References (9)

1. Agarwal P.K., Sharir M. Efficient algorithms for geometric optimization. Tech. Report CS-1996-19:1996;Dept. Computer Science, Duke University, Durham, NC.
2. Aggarwal A., Guibas L.J., Saxe J., Shor P.W. A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Discrete Comput. Geom. Vol. 4:(6):1989;591-604.
3. S. Bespamyatnikh, Efficient algorithm for finding two larget empty circles, in: Proc. European Workshop on Computational Geometry, to appear.
4. Biedl T.C., Demaine E.D., Demaine M.L., Lubiw A., Toussaint G.T. Hiding disks in folded polygons. Proc. 10th Canadian Conf. Computational Geometry. 1998.
5. Edelsbrunner H. Algorithms in Combinatorial Geometry. EATCS Monographs on Theoretical Computer Science. Vol. 10:1987;Springer, Heidelberg.
6. Held M. On the Computational Geometry of Pocket Machining. Lecture Notes Comput. Sci. Vol. 500:June 1991;Springer, Berlin.
7. Megiddo N. Applying parallel computation algorithms in the design of serial algorithms. J. ACM. Vol. 30:(4):1983;852-865.
8. Preparata F.P., Shamos M.I. Computational Geometry: An Introduction, 3rd edn. 1990;Springer, Berlin.
9. Yang T.-C., Shin S.Y., Chwa K.-Y. Rolling discs and their applications. J. of Design Manufacturing. Vol. 2:1992;71-82.