Li Xuejun, Huang Wenqing. Fast Triangulation Algorithm for Planar RegionsJ. Journal of Computer-Aided Design & Computer Graphics, 2003, 15(2): 233-238.
Citation:
Li Xuejun, Huang Wenqing. Fast Triangulation Algorithm for Planar RegionsJ. Journal of Computer-Aided Design & Computer Graphics, 2003, 15(2): 233-238.
Li Xuejun, Huang Wenqing. Fast Triangulation Algorithm for Planar RegionsJ. Journal of Computer-Aided Design & Computer Graphics, 2003, 15(2): 233-238.
Citation:
Li Xuejun, Huang Wenqing. Fast Triangulation Algorithm for Planar RegionsJ. Journal of Computer-Aided Design & Computer Graphics, 2003, 15(2): 233-238.
For triangulation of planar region with inner loops,by classifying the vertices and edges, the planar region can be easily subdivided into monotonous polygons,of which the time complexity of triangulation is O(N）.The algorithm is highly efficient for rendering buildings.
DownLoad: