1. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1975.
2. R. Brooks, “Solving the Find-Path Problem by Good Representation of Free Space,“ IEEE Transactions on Systems, Man, and Cybernetics 13(3) pp. 190–197 (1983).
3. B. Baker, S. Fortune, S. Mahaney, “Inspection by Polygon Containment,“ Twenty-Second Annual Allerton Conference on Communication, Control. and Computing, October, 1984, submitted to J. Algorithms.
4. J.L. Bentley, T.A. Ottmann, “Algorithms for Reporting and Counting Geometric Intersections”, IEEE Transactions on Computers, C-28, pp. 643–647, (1979).
5. B. Chazelle, “The Polygon Containment Problem,“ Advances of Computing Research, Volume 1, pp. 1–33. JAI Press, Inc.