Technical Reports

The ICICS/CS Reading Room


UBC CS TR-2006-03 Summary

Finding a Hamiltonian cycle in the dual graph of Right-Triangulations, January 27, 2006 Viann W. "Chan and William S." Evans, 16 pages

In this paper, we describe a method for refining a class of balanced bintree triangulations which maintains a hamiltonian cycle in the dual graph. We also introduce a method for building refinable balanced bintree triangulations using two types of tiles, a diamond tile and a triangular tile.


If you have any questions or comments regarding this page please send mail to help@cs.ubc.ca.