Computing the optimal bridge between two polygons

Theory of Computing Systems

Volumn 34, Issue 4, 2001, Pages 337-352

  Kim, Sung Kwon ^a   Shin, Chan Su ^b  

^a Chung Ang University   (South Korea)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; MATHEMATICAL TECHNIQUES;

BRIDGE CONSTRUCTIONS; CANAL CONSTRUCTION; LONGEST PATH;

BRIDGES;

EID: 0035597473     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-001-1018-2     Document Type: Article

References (10)

1. H. Ahn, O. Cheong, and C.-S. Shin. Bridging polytopes and related problems. In Proc. 17th European Workshop on Comput. Geom., pages 53-56, 2001.
2. A. Aggarwal, L. J. Guibas, J. Saxe, and P. W. Shor. A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Discrete Comput. Geom., 4(6):591-604, 1989.
3. B. Aronov, S. J. Fortune, and G. Wilfong. Farthest-site geodesic Voronoi diagram. Discrete Comput. Geom., 9:217-255, 1993.
4. D. Avis, T. Gum, and G. Toussaint. Visibility between two edges of a simple polygon. Visual Comput., 2(6):342-357, December 1986.
5. P. Bose, F. Hurtado-Diaz., E. Omaña-Pulido, and G. Toussaint. Aperture angle optimization problems. In Proc. 7th Canad. Conf. Comput. Geom., pages 73-78, 1995.
6. L. Cai, Y. Xu, and B. Zhu. Computing the optimal bridge between two convex polygons. Inform. Process. Lett., 69:127-130, 1999.
7. L. J. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. E. Tarjan. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, 2:209-233, 1987.
8. B.-J. Kim, C.-S. Shin, and K.-Y. Chwa. Linear algorithms for computing a variant segment center. In Proc. KISS Conf., volume A, pages 708-710, 1998 (in Korean).
9. S. K. Kim. The canal problems. J. Korea Inform. Sci. Soc., 20(12):1891-1901, 1993 (in Korean).
10. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.