An optimal parallel algorithm for finding shortest paths inside simple polygons

Given a triangulation of a simple n-gon P and two points a and b inside P, a parallel algorithm is presented for determining the path between a and b with the short-est Euclidean distance inside P. The algorithm has time complexity O(log n) on CREW PRAM with n/log n processors and thus is optimal in the sense that the time-processor product agrees with Q(n)-the lower bound of time complexity of the sequential algorithms

[1]  Bernard Chazelle,et al.  Triangulating a simple polygon in linear time , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[2]  Michael T. Goodrich,et al.  Triangulating a Polygon in Parallel , 1989, J. Algorithms.

[3]  Leonidas J. Guibas,et al.  Optimal Shortest Path Queries in a Simple Polygon , 1989, J. Comput. Syst. Sci..

[4]  Bernard Chazelle Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[5]  Gary L. Miller,et al.  Deterministic Parallel List Ranking , 1988, AWOC.

[6]  Michael T. Goodrich,et al.  Finding the Convex Hull of a Sorted Point Set in Parallel , 1987, Inf. Process. Lett..