1. L. G. Alexandrav, H. N Djidjev and J.-R. Sack, Finding a Central Link Segment of a Simple Polygon in O(n log n) Time, Technical Report No. SCS-TR-163, Carleton University, 1989.
2. E. M. Arkin, J. S. B. Mitchell, and S. Suri, Link queries and polygon approximation,Proc. 3rd ACM-SIAM Symposium on Discrete Algorithms, 1991, pp. 269?279.
3. M. de Berg, On rectilinear link distance,Computation Geometry: Theory and Applications,1 (1991), 13?34.
4. O. Berkman, B. Schieber; and U. Vishkin, Some Doubly Logarithmic Optimal Parallel Algorithms Based on Finding all Nearest Smaller Values, Technical Report UMIACS-TR-88-79, University of Maryland, 1988.
5. V. Chandru, S. K. Ghosh, A. Maheshwari, V. T. Rajan, and S. Saluja,NC-algorithms for minimum link path and related problems,Journal of Algorithms (1995), to appear.