1. D. Avis and H. ElGindy. Triangulating point sets in space. Discrete Comput. Geom., 2:99–111, 1987.
2. LNCS Vol. 1;M. Bern,1992
3. R. Cassidy, E. Gregg, R. Reeves, and J. Turmelle. IGL: The graphics library for the i860, March 22, 1991.
4. N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. In J. F. Traub, editor, Sympos. on New Directions and Recent Results in Algorithms and Complexity, page 441, New York, NY, 1976. Academic Press.
5. H. Crapo and J-P. Laumond. Hamiltonian cycles in Delaunay complexes. Geometry and Robotics Workshop Proceedings, Springer-Verlag LNCS Vol. 391, pp. 292–305, 1989.