Title
On-line polygon refining using a low computation subdivision algorithm
Abstract
Subdivision algorithms have been extensively used in computer graphics to produce a more accurate geometry model. For the purpose of integration into the context of a standard graphics pipeline for real-time display, we can only make use of the available information of one triangle. We propose a low computation cost algorithm to subdivide a polygon using vertex coordinates and vertex normal vectors of one triangle. Compared with other suitable algorithms, our algorithm produces decent results with lowest computational complexity. We also consider the generation of interpolated normal vectors and texture mapping parameters. Detailed comparisons among other suitable algorithms are presented.
Year
DOI
Venue
2000
10.1109/GMAP.2000.838253
GMP
Keywords
Field
DocType
texture mapping,vertex normal vector,real-time display,vertex coordinates,interpolation,lowest computation complexity,accurate geometry model,available information,computer graphics,on-line polygon refining,low computation cost algorithm,low computation subdivision algorithm,computational geometry,interpolated normal vector,computation cost,interpolated normal vectors,computational complexity,geometry model,online polygon refining,solid modelling,suitable algorithm,vertex normal vectors,subdivision algorithm,standard graphics pipeline,real-time systems,pipelines,graphics,real time systems,surface reconstruction,hardware,image quality,computer graphic,real time
Graphics,Texture mapping,Topology,Polygon,Graphics pipeline,Computer graphics (images),Computer science,Computational geometry,Algorithm,Vertex normal,Computer graphics,Computational complexity theory
Conference
ISBN
Citations 
PageRank 
0-7695-0562-7
1
0.49
References 
Authors
9
2
Name
Order
Citations
PageRank
Yuan-Chung Lee1112.18
Chein-Wei Jen258868.52