Finding a Hamiltonian cycle in the dual graph of Right-Triangulations
نویسندگان
چکیده
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.
منابع مشابه
On sequential triangulations of simple polygons
A triangulation is said to be Hamiltonian if its dual graph contains a Hamiltonian path. A sequential triangulation is a Hamiltonian triangulation having the additional property that the “turns” in the Hamiltonian path alternate left/right. Such triangulations are useful in computer graphics rendering and are related to a new type of two-guard walk. In this paper we present a simple algorithm t...
متن کاملOn Hamiltonian Triangulations in
An n-vertex simple polygon P is said to have a Hamilto-nian Triangulation if it has a triangulation whose dual graph contains a Hamiltonian path. Such triangulations are useful in fast rendering engines in Computer Graphics. We give a new characterization of polygons with Hamiltonian triangulations. and use it to devise O(n log n)-time algorithms to recognize such polygons.
متن کاملOn the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations
Tuesday, September 2 12:30–1:20 4119 Harris Hall The question whether for a given graph a hamiltonian cycle exists is NPcomplete, even when restricted to the class of plane triangulations. However, in 1931 Whitney proved a sufficient condition: each plane triangulation containing no non-facial cycle of length 3 is hamiltonian. More than 70 years later, Jackson and Yu succeeded in finding a cons...
متن کاملOn Hamiltonian Triangulations in Simple Polygons
An n-vertex simple polygon P is said to have a Hamiltonian Triangulation if it has a triangulation whose dual graph contains a hamiltonian path. Such triangulations are useful in fast rendering engines in Computer Graphics. We give a new characterization of polygons with hamiltonian triangulations and use it to devise O(n logn)-time algorithms to recognize such polygons. We also give eecient al...
متن کاملGeometric-Arithmetic Index of Hamiltonian Fullerenes
A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. In this paper we compute the first and the second geometric – arithmetic indices of Hamiltonian graphs. Then we apply our results to obtain some bounds for fullerene.
متن کامل