Abstract
Given nonintersecting simple polygonsP andQ, two verticespεP andqε Q are said to be visible if\(\overline {pq}\) does not properly intersectP orQ. We present a parallel algorithm for finding a closest pair among all visible pairs (p,q),pεP andqεQ. The algorithm runs in time O(logn) using O(n) processors on a CREW PRAM, wheren=¦P¦+¦Q¦. This algorithm can be implemented serially in Θ(n) time, which gives a new optimal sequential solution for this problem.
Similar content being viewed by others
References
N. M. Amato. Computing the minimum visible vertex distance between two nonintersecting simple polygons.Proc. 1992 Conf. on Information Science and Systems, Vol. II, pp. 800–805, Princeton, NJ, 1992.
D. P. Dobkin and D. G. Kirkpatrick. Determining the separation of preprocessed polyhedra-a unified approach.Proc. 17th Internat. Colloq. on Automata Language Programming, pp. 400–413. Lecture Notes in Computer Science, Vol. 443. Springer-Verlag, Berlin, 1990.
M. McKenna and G. T. Toussaint. Finding the minimum vertex distance between two disjoint convex polygons in linear time.Comput. Math. Appl., 11:1227–1242, 1985.
G. T. Toussaint. An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons.Computing, 32:357–364, 1984.
F. Chin, J. Sampson, and C. A. Wang. A unified approach for a class of problems in the computational geometry of polygons.Visual Comput., 1:124–132, 1985.
C. Wang. Intersection and Minimum Distance Problems for Planar Polgyons. M.Sc. thesis, Department of Computer Science, University of Alberta, Edmonton, Alberta, 1983.
C. A. Wang and E. P. F. Chan. Finding the minimum visible vertex distance between two nonintersecting simple polygons.Proc. 2nd Ann. ACM Symp. on Computational Geometry, pp. 34–42, 1986.
A. Aggarwal, S. Moran, P. W. Shor, and S. Suri. Computing the minimum visible vertex distance between two polygons.Proc. 1st Workshop on Algorithms and Data Structures, pp. 115–134. Lecture Notes in Computer Science, Vol. 382. Springer-Verlag, Berlin, 1989.
J. Hershberger and S. Suri. Matrix searching with the shortest path metric.Proc. 25th Ann. ACM Symp. on Theory of Computing (STOC 93), pp. 485–494, 1993.
F. R. Hsu, R. C. Chang, and R. C. T. Lee. Parallel algorithms for computing the closest visible vertex pair between two polygons.Internat. J. Comput. Geom. Appl., 2(2):135–162, 1992.
R. M. Karp and V. Ramachandran. Parallel algorithms for shared memory machines. In J. van Leeuwen, ed.,Handbook of Theoretical Computer Science, pp. 869–941. Elsevier/MIT Press, Amsterdam/Cambridge, MA, 1990.
M. J. Atallah and M. T. Goodrich. Parallel algorithms for some functions of two convex polygons.Algorithmica, 3:535–548, 1988.
S. Suri. Minimum Link Paths in Polygons and Related Problems. Ph.D. thesis, Department of Computer Science, Johns Hopkins University, Baltimore, MD, 1987.
N. M. Amato. Determining the separation of simple polygons.Internat. J. Comput. Geom. Appl., 4(4):457–474, 1994.
D. G. Kirkpatrick. Efficient computation of continuous skeletons.Proc. 20th Ann. IEEE Symp. on Foundations of Computer Science, pp. 18–27, 1979.
S. J. Fortune. A sweepline algorithm for Voronoi diagrams.Algorithmica, 2:153–174, 1987.
C. K. Yap. An O(n logn) algorithm for the Voronoi diagram of a set of simple curve segments.Discrete Comput. Geom., 2:365–393, 1987.
N. Dadoun and D. Kirkpatrick. Optimal Parallel Algorithms for Convex Polygon Separation. Report 89-21, Department of Computer Science, University of British Columbia, Vancouver, British Columbia, 1987.
M. T. Goodrich, C. Ó'Dúlaing, and C. Yap. Constructing the Voronoi diagram of a set of line segments in parallel.Algorithmica, 9:128–141, 1993.
D. Z. Chen. Efficient geometric algorithms in the EREW-PRAM.Proc. 28th Allerton Conf. on Communications Control and Computing, pp. 818–827, 1990.
M. T. Goodrich, S. B. Shauck, and S. Guha. Parallel methods for visibility and shortest path problems in simple polygons.Proc. 6th Ann. A CM Symp. on Computational Geometry, pp. 73–82, 1990.
M. T. Goodrich. Triangulating a polygon in parallel.J. Algorithms, 10:327–351, 1989.
L. J. Guibas and J. Hershberger. Optimal shortest path queries in a simple polygon.J. Comput. System Sci., 39:126–152, 1989.
B. Chazelle. Triangulating a simple polygon in linear time.Discrete Comput. Geom., 6:485–524, 1991.
M. J. Atallah and S. R. Kosaraju. An efficient parallel algorithm for the row minima of a totally monotone matrix.Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms, pp. 394–403, 1991.
M. J. Atallah and M. T. Goodrich. Efficient parallel solutions to some geometric problems.J. Parallel Distrib. Comput., 3:492–507, 1986.
A. Aggarwal, B. Chazelle, L. Guibas, C. Ó'Dúnlaing, and C. Yap. Parallel computational geometry.Algorithmica, 3:293–327, 1988.
R. Miller and Q. F. Stout. Efficient parallel convex hull algorithms.IEEE Trans. Comput., 37(12):1605–1618, 1988.
B. K. Bhattacharya and H. ElGindy. A new linear convex hull algorithm for simple polygons.IEEE Trans. Inform. Theory, 30:85–88, 1984.
M. R. Garey, D. S. Johnson, F. P. Preparata, and R. E. Tarjan. Triangulating a simple polygon.Inform. Process. Lett., 7:175–179, 1978.
A. Aggarwal, M. M. Klawe, S. Moran, P. Shor, and R. Wilber. Geometric applications of a matrix searching algorithm.Proc. 2nd Ann. ACM Symp. on Computational Geometry, pp. 285–292, 1986.
Author information
Authors and Affiliations
Additional information
Communicated by B. Chazelle.
This paper appeared in preliminary form as [1]. This work was supported in part by an AT&T Bell
Laboratories Graduate Fellowship, the Joint Services Electronics Program (U.S. Army, U.S. Navy, U.S. Air Force) under Contract N00014-90-J-1270, and NSF Grant CCR-89-22008. This work was done while the author was with the Department of Computer Science at the University of Illinois at Urbana-Champaign.
Rights and permissions
About this article
Cite this article
Amato, N.M. Finding a closest visible vertex pair between two polygons. Algorithmica 14, 183–201 (1995). https://doi.org/10.1007/BF01293668
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01293668