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

Authors:
John J. Bartholdi Iii;Paul Goldsman
Affiliations:
School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA 30332-0205, USA;School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA 30332-0205, USA
Venue:
Operations Research Letters
Year:
2004

Citing 5
Cited 0

Optimizing triangle strips for fast rendering

Proceedings of the 7th conference on Visualization '96
Geometric compression through topological surgery

ACM Transactions on Graphics (TOG)
Edgebreaker: Connectivity Compression for Triangle Meshes

IEEE Transactions on Visualization and Computer Graphics
Hamilton Triangulations for Fast Rendering

ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Multiresolution indexing of triangulated irregular networks

IEEE Transactions on Visualization and Computer Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Triangulated irregular networks (TINs) are common representations of surfaces in computational graphics. We define the dual of a TIN in a special 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.