Graph-theoretical conditions for inscribability and Delaunay realizability

Discrete Mathematics

Volumn 161, Issue 1-3, 1996, Pages 63-77

  Dillencourt, Michael B ^a   Smith, Warren D ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042093466     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00276-3     Document Type: Article

References (36)

1. F. Aurenhammer, Voronoi diagrams - a survey of a fundamental geomeric data structure, ACM Comput. Surveys 23 (1991) 345-405.
2. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (North-Holland, New York, NY, 1976).
3. K.Q. Brown, Voronoi diagrams from convex hulls, Inform. Process. Lett. 9 (1979) 223-228.
4. N. Chiba and T. Nishizeki, The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs, J. Algorithms 10 (1989) 187-211.
5. V. Chvátal, Tough graphs and Hamiltonian circuits, Discrete Math. 5 (1973) 215-228.
6. H.S.M. Coxeter, Introduction to Geometry (Wiley, New York, NY, 2nd ed., 1969).
7. 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 (May 1988) 292-305; Lecture Notes in Computer Science, vol. 391 (Springer, Berlin, 1988).
8. 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 (May 1988) 292-305; Lecture Notes in Computer Science, vol. 391 (Springer, Berlin, 1988).
9. M.B. Dillencourt, Realizability of Delaunay triangulations, Inform. Process. Lett. 33 (1990) 283-287.
10. M.B. Dillencourt, Toughness and Delaunay triangulations, Discrete Comput. Geometry 5 (1990) 575-601.
11. M.B. Dillencourt, Finding Hamiltonian cycles on Delaunay triangulations is NP-complete, Discrete Appl. Math. 64 (1996) 207-217.
12. M. B. Dillencourt and W.D. Smith, A simple method for resolving degeneracies in Delaunay triangulations, in: Automata, Languages, and Programming: Proc. 20th Internat. Coll., Lund, Sweden (July 1993) 177-188; Lecture Notes in Computer Science, vol. 700 (Springer, Berlin, 1993).
13. M. B. Dillencourt and W.D. Smith, A simple method for resolving degeneracies in Delaunay triangulations, in: Automata, Languages, and Programming: Proc. 20th Internat. Coll., Lund, Sweden (July 1993) 177-188; Lecture Notes in Computer Science, vol. 700 (Springer, Berlin, 1993).
14. M.B. Dillencourt and W.D. Smith, A linear-time algorithm for testing the inscribability of trivalent polyhedra, Internat. J. Comput. Geometry Appl. 5 (1995) 21-36.
15. H. Edelsbrunner, Algorithms in Combinatorial Geometry, EATCS Monographs on Theoretical Computer Science, vol. 10 (Springer, Berlin, 1987).
16. G. Ewald, Hamiltonian circuits in simplicial complexes, Geometriae Dedicata 2 (1973) 115-125.
17. P.J. Federico, Descartes on polyhedra: A Study of the De Solidorum Elementis, Sources in the History of Mathematics and Physical Sciences, vol. 4 (Springer, New York, NY, 1982).
18. B. Grünbaum, Convex Polytopes (Wiley-Interscience, New York, NY, 1967).
19. B. Grünbaum and E. Jucovič, On non-inscribable polytopes, Czechoslovak Math. J. 24 (1974) 424-429.
20. B. Grünbaum and G.C. Shephard, Some problems on polyhedra, J. Geometry 29 (1987) 182-190.
21. B. Grünbaum and H. Walther, Shortness exponents of families of graphs, J. Combin. Theory 14 (1973) 364-385.
22. C.D. Hodgson, I. Rivin and W.D. Smith, A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere, Bull. AMS 27 (1992) 246-251; see also Erratum, Bull. AMS 28 (1993) 213.
23. E. Jucovič and S. Ševec, Note on inscribability of quadrangular polyhedra with restricted number of edge-types, J. Geometry 42 (1991) 126-131.
24. L. Lovász and M.D. Plummer, Matching Theory, Annals of Discrete Mathematics, vol. 20 (North-Holland, Amsterdam, 1986).
25. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction (Springer, New York, NY, 1985).
26. I. Rivin, A characterization of ideal polyhedra in hyperbolic 3-space, Ann. Math. 143 (1996) 51-70.
27. I. Rivin, On geometry of convex ideal polyhedra in hyperbolic 3-space, Topology 32 (1993) 87-92.
28. I. Rivin and W.D. Smith, Inscribable graphs, Manuscript, NEC Research Institute, Princeton, NJ, 1991.
29. J. Steiner, Systematische Entwicklung der Abhängigkeit geometrischer Gestalten von einander (Reimer, Berlin, 1832); appeared in Jakob Steiner's Collected Works, 1881.
30. J. Steiner, Systematische Entwicklung der Abhängigkeit geometrischer Gestalten von einander (Reimer, Berlin, 1832); appeared in Jakob Steiner's Collected Works, 1881.
31. R. Thomas and X. Yu, 4-connected projective-planar graphs are Hamiltonian, J. Combin. Theory Ser. B 62 (1994) 114-132.
32. C. Thomassen, Planar and infinite hypohamiltonian and hypotraceable graphs, Discrete Math. 14 (1976) 377-389.
33. C. Thomassen, A theorem on paths in planar graphs. J. Graph Theory 7 (1983) 169-176.
34. W.T. Tutte, The factorization of linear graphs, J. London Math. Soc. 22 (1947) 107-111.
35. W.T. Tutte, A theorem of planar graphs, Trans. Amer. Math. Soc. (1956) 99-116.
36. W.T. Tutte, Bridges and Hamiltonian circuits in planar graphs, Aequationes Mathematicae 15 (1977) 1-33.