%0 Journal Article %1 BARTHOLDIIII2004304 %A Bartholdi III, John J. %A Goldsman, Paul %D 2004 %J Operations Research Letters %K synthesis vector vector-synthesis %N 4 %P 304-308 %R https://doi.org/10.1016/j.orl.2003.11.005 %T The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle %U https://www.sciencedirect.com/science/article/pii/S0167637703001536 %V 32 %X 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.

@article{BARTHOLDIIII2004304, 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.}, added-at = {2021-05-18T07:17:23.000+0200}, author = {{Bartholdi III}, John J. and Goldsman, Paul}, biburl = {https://www.bibsonomy.org/bibtex/268a1d1893c4768d5403c8d55cf2e3391/gameovercite}, description = {The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle - ScienceDirect}, doi = {https://doi.org/10.1016/j.orl.2003.11.005}, interhash = {2a89f3f826b74dbf6e6d43a20aef6ffb}, intrahash = {68a1d1893c4768d5403c8d55cf2e3391}, issn = {0167-6377}, journal = {Operations Research Letters}, keywords = {synthesis vector vector-synthesis}, number = 4, pages = {304-308}, timestamp = {2021-05-18T07:17:23.000+0200}, title = {The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle}, url = {https://www.sciencedirect.com/science/article/pii/S0167637703001536}, volume = 32, year = 2004 }