作者: Giri Narasimhan
关键词: Simple polygon 、 Rendering (computer graphics) 、 Point set triangulation 、 Combinatorics 、 Dual graph 、 Visibility graph 、 Pitteway triangulation 、 Hamiltonian path 、 Hamiltonian (quantum mechanics) 、 Mathematics
摘要: An n-vertex simple polygon P is said to have a Hamiltonian Triangulation if it has triangulation whose dual graph contains path. Such triangulations are useful in fast rendering engines Computer Graphics. We give new characterization of polygons with triangulations. and use devise O(n log n)-time algorithms recognize such polygons.