# Computing the minimum visible vertex distance between two polygons

Preliminar version

Conference paper

First Online:

- 3 Citations
- 694 Downloads

## Abstract

Given two non-intersecting simple polygons *P* and *Q* with *n* and *m* vertices, respectively, a vertex of *P* is said to be visible from a vertex of *Q* if the segment joining these vertices does not properly intersect any edge of these polygons. The problem of finding a closest visible pair of vertices requires finding two vertices, *p*∈*P* and *q*∈*Q*, that are visible to each other and that are closest to each other among all such pairs. In this paper, we present an *O*((*n*+*m*) log log(*n*+*m*)) time algorithm; this improves upon an earlier result of Wang and Chan by an *O*(log(*n*+*m*)/ log log(*n*+*m*)) factor.

## Key Words

Closest pair visible polygons totally-monotone window-trees link-distance## Preview

Unable to display preview. Download preview PDF.

## References

- [AS89]A. Aggarwal and S. Suri, "An Efficient Algorithm for Computing the Farthest Visible pair in a Simple Polygon," Manuscript in preparation, 1989.Google Scholar
- [AKMSW87]A. Aggarwal, M. Klawe, S. Moran, P. W. Shor, and R. Wilber, "Geomteric Applications of a Matrix Searching Algorithm," Algorithmica, Vol. 2, No. 2, pp. 195–208, 1986.CrossRefGoogle Scholar
- [BG84]B. Bhattacharya and H. El Gindy, "A New Linear Convex Hull Algorithm for Simple Polygon," IEEE Trans. on Information Theory, Vol. C-29, pp. 571–573, 1984.Google Scholar
- [Ch83]B. M. Chazelle, "A Theorem for Polygon Cutting with Applications," Proc. of the 23rd IEEE Annual Symposium on the Foundations of Computer Science, pp. 339–349, 1983.Google Scholar
- [CG85]B. M. Chazelle and L. J. Guibas, "Visibility and intersection Problems in Plane Geometry," Proc. of the First ACM Annual Symposium on Computational Geometry, pp. 135–146, 1985.Google Scholar
- [CS88]B. M. Chazelle and M. Sharir, "An Algorithm for Generalized Point Location and Its Applications," Tech. Report, Computer Science Department, Courant Institute of Math. Sciences, New York University, June 1988.Google Scholar
- [GH87]L. J. Guibas and J. Hershberger, "Optimal Shortest Path Queries in a Simple Polygon," Proc. of the Third ACM Annual Symposium on Computational Geometry, pp. 50–63, 1987.Google Scholar
- [GHLST87]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," Vol. 2, No. 2, pp. 209–234, 1987.Google Scholar
- [GY81]R. L. Graham and F. F. Yao, "Finding the Convex Hull of a Simple Polygon," Stanford Univ., Stanford, CA, Tech. Report STAN-CS-81-887. Also appears in J. of Algorithms, Vol. 4, No. 4, pp. 324–331, 1983.Google Scholar
- [LL86]D. T. Lee and A. K. Lin, "Generalized Delaunay Triangulations for Planar Graphs," Discrete and Computational Geometry, pp. 201–216, 1986.Google Scholar
- [MA79]D. McCullem and D. Avis, "A Linear Algorithm for Finding the Convex Hull of a Simple Polygon," Info. Proc. Letters, Vol. 9, pp. 178–181, 1979.Google Scholar
- [MO87]M. McKenna and J. O'Rourke,
*Public Communication*, 1987.Google Scholar - [PS85]F. P. Preparata and M. I. Shamos,
*Computational Geometry*, Springer Verlag, New York, pp. 110–112, 1985.Google Scholar - [Su87]S. Suri, "Minimum Link Paths in Polygons and Related Problems," Ph. D. Thesis, Dept. of Computer Science, The Johns Hopkins University, Baltimore, Maryland, 1987.Google Scholar
- [Su87a]S. Suri, "The All-Geodesic Farthest Neighbors Problem for Simple Polygons," Proc. of the Third ACM Annual Symposium on Computational geometry, pp. 64–75, 1987. To appear in the Journal of Computer Systems and Sciences, 1989.Google Scholar
- [TV88]R. E. Tarjan and C. Van Wyk, "An
*O*(*n*log log*n*) Algorithm for Triangulating a Simple Polygon," SIAM J. on Computing, Vol. 17, pp. 143–178, 1988.Google Scholar - [WC86]C. A. Wang and E. P. F. Chan, "Finding the Minimum Visible Vertex Distance Between Two Nonintersecting Polygons," Proc. of the Second ACM Annual Symposium on Computational Geometry, pp. 34–42, 1986.Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 1989