Hamiltonian 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 machine. To reduce rate, it desirable to order triangles so that consecutive share a face, meaning only one additional vertex need transmitted describe each triangle. Such an ordering exists if dual graph of contains Hamiltonian path. In this paper, we consider several problems concerning triangulations with duals related class “sequential triangulations”.