1. A. Aggarwal, M. Klawe, S. Moran, P. W. Shor, R. Wilber, Geometric Applications of a Matrix Searching Algorithm, Algorithmica 2(2) (1986), pp. 195–208.
2. Lecture Notes in Computer Science 382;A. Aggarwal,1989
3. N. Amato, Computing the Minimum Visible Vertex Distance Between Two Nonintersecting Simple Polygons, Proceedings of the 1992 Conference on Information Sciences and Systems Vol. II, Princeton, NJ, (1992), pp. 800–805. (Also, Coordinated Science Laboratory Tech. Report, No. UILU-ENG-92-2206 (ACT 120), University of Illinois at Urbana-Champaign.)
4. N. Amato, An Optimal Algorithm for Determining the Separation of Two Nonintersecting Simple Polygons, Coordinated Science Laboratory Tech. Report, No. UILUENG-92-2248 (ACT 125), University of Illinois at Urbana-Champaign, (1992).
5. M. Atallah and M. Goodrich, Parallel Algorithms for Some Functions of Two Convex Polygons, Algorithmica 3 (1988), pp. 535–548.