Finding Hamiltonian cycles in Delaunay triangulations is NP-complete

Discrete Applied Mathematics

Volumn 64, Issue 3, 1996, Pages 207-217

  Dillencourt, Michael B ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0043261601     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(94)00125-W     Document Type: Article

References (36)

1. T. Akiyama, T. Nishizeki and N. Saito, NP-completeness of the Hamiltonian cycle problem for bipartite graphs, J. Inform. Process. 3 (1980) 73-76.
2. F. Aurenhammer, Voronoi diagrams - a survey of a fundamental geometric data structure, ACM Comput. Surveys 23 (1991) 345-405.
3. J.-D. Boissonnat, Geometric structures for three-dimensional storage representation. ACM Trans. Graph. 3 (1984) 256-286.
4. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (North-Holland, New York, 1976).
5. K.Q. Brown, Voronoi diagrams from convex hulls, Inform. Process. Lett. 9 (1979) 223-228.
6. V. Chvátal, Hamiltonian cycles, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds., The Traveling Salesman Problem, Ch. 11 (Wiley, New York, 1985) 403-429.
7. R.J. Cimikowski, Finding Hamiltonian cycles in certain planar graphs, Inform. Process. Lett. 35 (1990) 249-254.
8. R.J. Cimikowski, On certain Hamiltonian inner triangulations, Discrete Appl. Math. 43 (1993) 185-195.
9. H.S.M. Coxeter, Introduction to Geometry (Wiley, New York, 2nd ed., 1969).
10. H. Crapo and J.-P. Laumond, Hamiltonian cycles in Delaunay complexes, in: J.-D. Boissonnat and J.-P. Laumond, eds., Geometry and Robotics Workshop, Toulouse, France (1989), Lecture Notes in Computer Science 391 (Springer, Berlin, 1989).
11. M.B. Dillencourt, A non-Hamiltonian, nondegenerate Delaunay triangulation, Inform. Process. Lett. 25 (1987) 149-151.
12. M.B. Dillencourt, An upper bound on the shortness exponent of inscribable graphs, J. Combin. Theory Ser. B 46 (1989) 66-83.
13. M.B. Dillencourt, Hamiltonian cycles in planar triangulations with no separating triangles, J. Graph Theory 14 (1990) 31-40.
14. M.B. Dillencourt, Toughness and Delaunay triangulation, Discrete Comput. Geom. 5 (1990) 575-601.
15. M.B. Dillencourt and W.D. Smith, Graph-theoretical conditions for inscribability and Delaunay realizability, in: Proceedings of the Sixth Canadian Conference on Computational Geometry, Saskatoon, Sask. (1994).
16. H. Edelsbrunner, Algorithms in Combinatorial Geometry, EATCS Monographs on Theoretical Computer Science 10 (Springer, Berlin, 1987).
17. T. Genoud, Etude du caractère hamiltonien de Delaunays aléatoires, Working Paper, Ecole Polytechnique Federale de Lausanne (1989).
18. C.D. Hodgson, I. Rivin and W.D. Smith, A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere, Bull. Amer. Math. Soc. 27 (1992) 246-251.; see also Erratum, Bull. Amer. Math. Soc. 28 (1993) 213.
19. V. Kantabutra, Traveling salesman cycles are not always subgraphs of Voronoi duals, Inform. Process. Lett. 16 (1983) 11-12.
20. J.-P. Laumond, Connectivity of planar triangulations, Inform. Process. Lett. 34 (1990) 87-96.
21. V.J. Leung, M.B. Dillencourt and A.L. Bliss, GraphTool: A tool for interactive design and manipulation of graphs and graph algorithms, in: N. Dean and G.E. Shannon, eds., Computational Support for Discrete Mathematics: DIMACS Workshop, New Brunswick, NJ (1992), DIMACS Series in Discrete Mathematics and Theoretical Computer Science 15 (American Mathematical Society, Providence, RI, 1994).
22. C. Mathieu, Some problems in computational geometry, Algorithmica 2 (1987) 131-133.
23. O. Ore, The Four-Color Problem (Academic Press, New York, 1967).
24. J. O'Rourke, The computational geometry column #2, Comput. Graph. 21 (1987) 155-157.
25. J. O'Rourke, H. Booth and R. Washington, Connect-the-dots: A new heuristic, Comput. Graph. Vision Image Process. 39 (1987) 258-266.
26. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction (Springer, New York, 1985).
27. G. Reinelt, Fast heuristics for large geometric traveling salesman problems, ORSA J. Comput. 4 (1992) 206-217.
28. I. Rivin, A characterization of ideal polyhedra in hyperbolic 3-space, preprint (1992).
29. I. Rivin, On geometry of convex ideal polyhedra in hyperbolic 3-space, Topology 32 (1993) 87-92.
30. I. Rivin and W.D. Smith, Inscribable graphs, Manuscript, NEC Research Institute, Princeton, NJ (1991).
31. M.I. Shamos, Computational geometry, Ph.D. Thesis, Yale University. New Haven, CT (1978).
32. W.R. Stewart Jr, Euclidean traveling salesman problems and Voronoi diagrams, Manuscript, College of William and Mary (1992).
33. R. Thomas and X. Yu, 4-connected projective-planar graphs are Hamiltonian, J. Combin. Theory Ser. B 62 (1994) 114-132.
34. C. Thomassen, A theorem on paths in planar graphs, J. Graph Theory 7 (1983) 169-176.
35. W.T. Tutte, The factors of graphs, Canad. J. Math. 4 (1952) 314-328.
36. W.T. Tutte, A theorem on planar graphs, Trans. Amer. Math. Soc. 82 (1956) 99-116.