| Article ID: | iaor20051034 |
| Country: | Netherlands |
| Volume: | 32 |
| Issue: | 4 |
| Start Page Number: | 304 |
| End Page Number: | 308 |
| Publication Date: | Jul 2004 |
| Journal: | Operations Research Letters |
| Authors: | Bartholdi John J., Goldsman Paul |
| Keywords: | networks |
Triangulated irregular networks (TINs) are common representations of surfaces in computational graphics. We define the dual of a TIN in a sepcial way, based on vertex-adjacency, and show that its Hamiltonian cycle always exists and can be found efficiently. This result has applications in transmission of large graphics datasets.