1. Agarwal, P. and Shark, S., “Red-blue intersection detection algorithms, with applications to motion planning and collision detection,” Proc. 4th ACM Symposium on Computational Geometry, 1988, pp. 70–80.
2. Akl, S. G. and Toussaint, G. T., “Efficient convex hull algorithms for pattern recognition applications,” Proc. Fourth International Joint Conf. on Pattern Recognition, Kyoto, Japan, 1978.
3. Akl, S. G. and Toussaint, G. T., “An improved algorithm to check for polygon similarity,” Information Processing Letters, vol. 7, 1978, pp. 127–128.
4. Technical Report SOCS-85.32;T Asano,1985
5. Asano, T. and Toussaint, G. T., “Computing the geodesic center of a simple polygon,” in Perspectives in Computing: Discrete Algorithms and Complexity, Proc. of Japan-US Joint Seminar, D. S. Johnson, A. Nozaki, T. Nishizeki, H. Willis, eds., June 1986, pp. 65–79.