## Hamiltonian triangulations for fast rendering

- Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena
- The Visual Computer
- 1996

We prove that the Hamiltonian cycle problem is NP complete for a class of planar graphs named triangle graphs that are closely related to inner triangulated graphs We present a linear time heuristic algorithm that nds a solution at most one third longer than the optimum solution and use it to obtain a fast rendering algorithm on triangular meshes in… (More)