| View Dependent Sequential Point Trees |
| |
| 作者姓名： | Wen-Cheng Wang Feng Wei and En-Hua Wu |
| |
| 作者单位： | [1]State Key Lab of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, P.R. China [2]Department of Computer and Information Science, Faculty of Science and Technology, University of Macau Macao Special Administration Region, P.R. China [3]Graduate University of Chinese Academy of Sciences, Beijing 100039, P.R. China |
| |
| 基金项目： | A preliminary version of this paper appeared in Proc. Pacific Graphics 2005, Macau. The work is supported by the National Basic Research 973 Program of China （Grant No. 2002CB312102）, the National Natural Science Foundation of China （Grant Nos. 60373051, 60473105） and the Research Grant of the University of Macau. |
| |
| 摘 要： | Sequential point trees provide the state-of-the-art technique for rendering point models, by re-arranging hierarchical points sequentially according to geometric errors running on GPU for fast rendering. This paper presents a view dependent method to augment sequential point trees by embedding the hierarchical tree structures in the sequential list of hierarchical points. By the method,two kinds of indices are constructed to facilitate the points rendering in an order mostly from near to far and from coarse to fine. As a result, invisible points can be culled view-dependently in high efficiency for hardware acceleration, and at the same time, the advantage of sequential point trees could be still fully taken. Therefore, the new method can run much faster than the conventional sequential point trees, and the acceleration can be highly promoted particularly when the objects possess complex occlusion relationship and viewed closely because invisible points would be in a high percentage of the points at finer levels.
|
| 关 键 词： | 点基绘制 可见度 GPU 实时绘制 |
| 收稿时间： | 2005-11-18 |
| 修稿时间： | 2005-11-18 |
View Dependent Sequential Point Trees |
| |
| Wen-Cheng Wang,Feng Wei,and En-Hua Wu.View Dependent Sequential Point Trees[J].Journal of Computer Science and Technology,2006,21(2):181-188. |
| |
| Authors: | Wen-Cheng Wang Feng Wei En-Hua Wu |
| |
| Affiliation: | (1) State Key Lab of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, 100080, P.R. China;(2) Department of Computer and Information Science, Faculty of Science and Technology, University of Macau Macao Special Administration Region, P.R. China;(3) Graduate University of Chinese Academy of Sciences, Beijing, 100039, P.R. China |
| |
| Abstract: | Sequential point trees provide the state-of-the-art technique for rendering point models, by re-arranging hierarchical points sequentially according to geometric errors running on GPU for fast rendering. This paper presents a view dependent method to augment sequential point trees by embedding the hierarchical tree structures in the sequential list of hierarchical points. By the method, two kinds of indices are constructed to facilitate the points rendering in an order mostly from near to far and from coarse to fine. As a result, invisible points can be culled view-dependently in high efficiency for hardware acceleration, and at the same time, the advantage of sequential point trees could be still fully taken. Therefore, the new method can run much faster than the conventional sequential point trees, and the acceleration can be highly promoted particularly when the objects possess complex occlusion relationship and viewed closely because invisible points would be in a high percentage of the points at finer levels. |
| |
| Keywords: | view dependence visibility culling GPU point-based rendering real time rendering |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
| 点击此处可从《计算机科学技术学报》浏览原始摘要信息 |
|
点击此处可从《计算机科学技术学报》下载全文 |
|
