1. 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.
2. 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.
3. S.K. Ghosh, Computing the visibility polygon from a convex set and related problems, Journal of Algorithms, 12(1991), pp. 75–95.
4. M.T. Goodrich, Triangulating a polygon in parallel, Journal of Algorithms, 10(1989), pp. 327–351.
5. 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.