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

@article{Bartholdi2004TheVD,
  title={The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle},
  author={John J. Bartholdi and Paul Goldsman},
  journal={Oper. Res. Lett.},
  year={2004},
  volume={32},
  pages={304-308}
}
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. 

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Triangulations. http://www.math.utah.edu/~alfeld/MDS/ triangulation.html

Peter Alfeld
1999
View 2 Excerpts
Highly Influenced

Triangle Strip Compression

Graphics Interface • 2000
View 1 Excerpt

Triangle Mesh Compression

Graphics Interface • 1998
View 1 Excerpt

Optimizing triangle strips for fast rendering

Proceedings of Seventh Annual IEEE Visualization '96 • 1996
View 1 Excerpt

Arkin , Martin Held , Joseph S . B . Mitchell , and Steven S . Skiena . Hamiltonian triangulations for fast rendering

M. Esther
-1

Bartholdi , III and Paul Goldsman . Multiresolution indexing of triangulated irregular networks

J John
IEEE Transactions on Visualization and Computer Graphics . To appear . [ 4 ]

Similar Papers

Loading similar papers…