Subdivision algorithms have been extensively used in computer graphics to produce more accurate geometry model. For the purpose of integration into the context of standard graphics pipeline for real-time display, we can only make use of the available ii formation of one triangle. In this paper we proposed a low computation cost algorithm to subdivide a polygon using vertex coordinates and vertex normal vectors of one triangle. Comparing with other suitable algorithms, our algorithm produces decent results with lowest computation complexity. We also consider the generation of interpolated normal vectors and texture mapping parameters. Detailed comparisons among other suitable algorithms are presented.
展开▼
