CORC  > 北京大学  > 信息科学技术学院
Hierarchical face cluster partitioning of polygonal surfaces and high-speed rendering
Tsuji, Tokuo ; Hongbin, Zha ; Hasegawa, Tsutomu ; Kurazume, Ryo
刊名systems and computers in japan
2007
DOI10.1002/scj.20581
英文摘要A computer's rendering capacity cannot handle the increased amount of data when rendering high-quality, three-dimensional computer graphic images. This results in problems such as rendering not being possible depending on the subject image, or the rendering speed dropping too far. To resolve these problems, we propose a method for generating a new hierarchical three-dimensional data structure based on recursive face cluster partitioning, and a high-speed rendering data extraction algorithm using that data structure. In the proposed algorithm, local resolution control using the approximating polygon of a face cluster, and precise invisible surface culling using the bounding volume of the face cluster can be executed in parallel. High-speed rendering can be performed with little deterioration in quality, even for a large amount of data. The effectiveness of this algorithm was confirmed with a local resolution control experiment and a large-scale three-dimensional model rendering experiment. ? 2007 Wiley Periodicals, Inc.; EI; 0; 8; 32-43; 38
语种英语
内容类型期刊论文
源URL[http://ir.pku.edu.cn/handle/20.500.11897/409879]  
专题信息科学技术学院
推荐引用方式
GB/T 7714
Tsuji, Tokuo,Hongbin, Zha,Hasegawa, Tsutomu,et al. Hierarchical face cluster partitioning of polygonal surfaces and high-speed rendering[J]. systems and computers in japan,2007.
APA Tsuji, Tokuo,Hongbin, Zha,Hasegawa, Tsutomu,&Kurazume, Ryo.(2007).Hierarchical face cluster partitioning of polygonal surfaces and high-speed rendering.systems and computers in japan.
MLA Tsuji, Tokuo,et al."Hierarchical face cluster partitioning of polygonal surfaces and high-speed rendering".systems and computers in japan (2007).
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace