Hamilton Triangulations for Fast Rendering

High-performance rendering engines in computer graphics are often pipelined, and their speed is bounded by the rate at which triangulation data can be sent into the machine. To reduce the data rate, it is desirable to order the triangles so that consecutive triangles share a face, meaning that only one additional vertex need be transmitted to describe each triangle. Such an ordering exists if and only if the dual graph of the triangulation contains a Hamiltonian path. In this paper, we consider several problems concerning triangulations with Hamiltonian duals and a related class of “sequential triangulations”.

[1]  Herbert S. Wilf,et al.  Combinatorial Algorithms: An Update , 1987 .

[2]  Mariette Yvinec,et al.  Triangulation in 2d and 3d space , 1988, Geometry and Robotics.

[3]  Prosenjit Bose,et al.  No Quadrangulation is Extremely Odd , 1995, ISAAC.

[4]  Joseph O'Rourke,et al.  Some NP-hard polygon decomposition problems , 1983, IEEE Trans. Inf. Theory.

[5]  David S. Johnson,et al.  The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..

[6]  Michael B. Dillencourt,et al.  Hamiltonian cycles in planar triangulations with no separating triangles , 1990, J. Graph Theory.

[7]  David Avis,et al.  Triangulating point sets in space , 1987, Discret. Comput. Geom..

[8]  Jan J. Koenderink,et al.  Solid shape , 1990 .

[9]  David Eppstein,et al.  MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .

[10]  N. Prabhu,et al.  Hamiltonian simple polytopes , 1995, Discret. Comput. Geom..

[11]  Carla D. Savage.  Gray Code Sequences of Partitions , 1989, J. Algorithms.

[12]  J. O'Rourke,et al.  Connect-the-dots: a new heuristic , 1987 .

[13]  Bernard Chazelle,et al.  On the convex layers of a planar set , 1985, IEEE Trans. Inf. Theory.

[14]  Jean-Paul Laumond,et al.  Hamiltonian cycles in Delaunay complexes , 1988, Geometry and Robotics.

[15]  Azriel Rosenfeld,et al.  Polygonal ribbons in two and three dimensions , 1995, Pattern Recognit..

[16]  Michael B. Dillencourt,et al.  A Non-Hamiltonian, Nondegenerate Delaunay Triangulation , 1987, Inf. Process. Lett..