The Community for Technology Leaders
Geometric Modeling and Processing (2000)
Hong Kong, China
Apr. 10, 2000 to Apr. 12, 2000
ISBN: 0-7695-0562-7
pp: 209
Yuan-Chung Lee , National Chiao-Tung University
Chein-Wei Jen , National Chiao-Tung University
ABSTRACT
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 information 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.
INDEX TERMS
CITATION

C. Jen and Y. Lee, "On-Line Polygon Refining Using a Low Computation Subdivision Algorithm," Geometric Modeling and Processing(GMP), Hong Kong, China, 2000, pp. 209.
doi:10.1109/GMAP.2000.838253
93 ms
(Ver 3.3 (11022016))