1. V. Akman, “Shortest paths avoiding polyhedral obstacles in 3-dimensional Euclidean space,” Rep. IPL-TR-075, Image Processing Lab, Rensselaer Polytechnic Inst., Troy, New York (June 1985). (also: PhD thesis, Electrical, Computer, and Systems Eng. Dept.; Springer-Verlag, LNCS Series, to appear.)
2. B.G. Baumgart, “GEOMED: Geometric editor,” Rep. STAN-CS-74-414, Computer Science Dept., Stanford Univ., Stanford, Calif. (May 1974).
3. E.A. Bier and M.C. Stone, “Snap-dragging,” ACM SIGGRAPH’86 Proc., Dallas, Texas, pp. 233–240 (Aug. 1986).
4. M.H. Brown and R. Sedgewick, “Techniques for algorithm animation,” IEEE Software 2(1), pp. 28–39 (Jan. 1985).
5. C.E. Buckley, “The application of continuum methods to path planning,” AI Tech. Rep. No. 48, Schlumberger Palo Alto Research (Aug. 1985). (also: PhD thesis, Dept. of Mechanical Eng., Stanford Univ.)