Abstract
The link metric, defined on a constrained region R of the plane, sets the distance between a pair of points in R equal the minimum number of segments or links that are needed to construct a path in R between the points. The minimum link path problem is to compute a path consisting of minimum number of links between two points in R, when R is the inside of a simple polygon P of size ns. Recently Chandru et al. [1] proposed a parallel algorithm for computing minimum link path between two points inside P and it runs in O(log n log log n) time using O(n) processors. Here we show that minimum link paths from a point to all vertices of P can be computed in O(log2 n log log n) time using O(n) processors. Using this result we propose a parallel algorithm for computing the link center of P. The link center of P is the set of points x inside P such that the link distance from x to any other point in P is minimized. The algorithm runs in O(log2 n log log n) time using O(n2) processors. We also show that a triangle in the approximate link center can be computed in O(log3 n log log n) time using O(n) processors. The complexity results of this paper are with respect to the CREW-PRAM model of computation.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Vijay Chandru, Subir Ghosh, Anil Maheshwari, V T Rajan and Sanjeev Saluja, NC-Algorithms for minimum link path and related problems, Technical Report No. CS-90/3, Computer Science Group, Tata Institute of Fundamental Research, Bombay, 1991.
H.N. Djidjev, A. Lingas and J-R Sack, An O(n log n) algorithm for computing a link center of a simple polygon, STACS 89, LNCS, 349 (1989), Springer Verlag.
S.K. Ghosh, Computing the visibility polygon from a convex set and related problems, Journal of Algorithms, 12(1991), pp. 75–95.
M.T. Goodrich, Triangulating a polygon in parallel, Journal of Algorithms, 10(1989), pp. 327–351.
M.T. Goodrich, B. Shauck, S. Guha, Parallel algorithms in shortest path and visibility problems, Proceedings of the 6th ACM Symposium on Computation Geometry, 1990, pp. 73–82.
Y. Ke, Efficient algorithms for weak visibility and link distance problems in polygons, Ph.D. Thesis, The John Hopkins University, 1989.
R. M. Karp and R. Vijaya Ramachandran, Parallel Algorithms for Shared-Memory Machines, Handbook of Theoretical Computer Science, Edited by J. van Leeuwen, Volume 1, Elsevier Science Publishers B.V., 1990.
W. Lenhart, R. Pollack, J. Sack, R. Seidel, M. Sharir, S. Suri, G. Toussaint, S. Whitesides and C. Yap, Computing the link center of a simple polygon, Discrete and Computational Geometry, 3 (1988), pp. 281–293.
S. Suri, A linear time algorithm for minimum link path inside a simple polygon, Computer Vision, Graphics and Image Processing, 35(1986), pp. 99–110.
S. Suri, Minimum link paths in polygons and related problems, Ph.D. Thesis, The John Hopkins University, 1987.
R.E. Tarjan and U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM Journal on Computing, 14 (1985), pp. 862–874.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ghosh, S.K., Maheshwari, A. (1992). Parallel algorithms for all minimum link paths and link center problems. In: Nurmi, O., Ukkonen, E. (eds) Algorithm Theory — SWAT '92. SWAT 1992. Lecture Notes in Computer Science, vol 621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55706-7_10
Download citation
DOI: https://doi.org/10.1007/3-540-55706-7_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55706-7
Online ISBN: 978-3-540-47275-9
eBook Packages: Springer Book Archive