The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle

Operations Research Letters

Volumn 32, Issue 4, 2004, Pages 304-308

  Bartholdi III, John J ^a   Goldsman, Paul ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Hamiltonian cycle; Triangle mesh; Triangulated irregular network; Triangulation

Indexed keywords

COMPUTER GRAPHICS; HAMILTONIANS; MATHEMATICAL MODELS; THEOREM PROVING; TRIANGULATION;

HAMILTONIAN CYCLE; TRIANGLE MESHES; TRIANGULATED IRREGULAR NETWORK (TIN);

OPERATIONS RESEARCH;

EID: 2042482077     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2003.11.005     Document Type: Article

References (9)

1. P. Alfeld, Triangulations, http://www.math.utah.edu/~alfeld/MDS/ triangulation.html, March 1999.
2. E.M. Arkin, Martin Held, J.S.B. Mitchell, S.S. Skiena, Hamiltonian triangulations for fast rendering, in: Visualization '95: Proceedings, October 29-November 3, Atlanta, GA, 1995.
3. J.J. Bartholdi, III, P. Goldsman, Multiresolution indexing of triangulated irregular networks, IEEE Trans. Visual. Comp. Graph. to appear.
4. F. Evans, S. Skiena, A. Varshney, Optimizing triangle strips for fast rendering, in: Proceedings, IEEE Visualization 1996, San Francisco, CA, 1996, pp. 319-326.
5. M. Isenburg, Triangle strip compression, in: Proceedings of Graphics Interface 2000, Montreal, Quebec, Canada, May 2000, pp. 197-204.
6. Laurini R., Thompson D. Fundamentals of Spatial Information Systems. 1992;Academic Press, Ltd. San Diego, CA.
7. J. Rossignac, Edgebreaker: connectivity compression for triangle meshes, IEEE Trans. Visual. Comp. Graph. 5 (1) (1999) pp. 47-61.
8. Taubin G., Rossignac J. Geometric compression through topological surgery. ACM Trans. Graph. 17(2):1998;84-115.
9. C. Touma, C. Gotsman, Triangle mesh compression, in: Proceedings of Graphics Interface, Vancouver, BC, 1998, pp. 26-34.