Sequential point trees with visibility processed efficiently

Residential College	false
Status	已發表Published
	Sequential point trees with visibility processed efficiently
	Wei F.1; Wang W.-C.1; Wu E.-H.1
	2005-06-01
Source Publication	Jisuanji Xuebao/Chinese Journal of Computers
ISSN	02544164
Volume	28 Issue:6 Pages:950-958
Abstract	A sequential point tree is constructed from a hierarchical point tree by rearranging the tree nodes in a sequence according to their respective geometric errors, which benefits using GPU for fast point rendering. However, it lacks efficient measures for visibility determination so that many points that satisfy the error requirements for rendering but invisible may be rendered. This will seriously lower the efficiency in rendering the large and complex model because the points satisfying the error requirements but invisible will be in a large quantity due to the complicated occlusion relations between different parts of the model and the wide error range permitted in rendering the model. As for this, a new method is given in this paper to construct the sequential point tree with some visibility information considered in rearranging the tree nodes and integrated in the sequential points. Therefore, in rendering, not only the GPU can be conveniently employed for acceleration, but also a lot of points that satisfy the error requirements but invisible can be skipped for acceleration. Experimental results show the new method is at least 20% faster than the existing sequential point tree, and it is much faster in treating the large and complex models, more than 67%.
Keyword	Hardware accelerated graphics Level of details Point rendering Sequential Visibility
URL	View the original
Language	英語English
Fulltext Access	View Full-Text via Scopus
Document Type	Journal article
Collection	University of Macau
Affiliation	1.Institute of Software Chinese Academy of Sciences 2.Universidade de Macau 3.Chinese Academy of Sciences
Recommended Citation GB/T 7714	Wei F.,Wang W.-C.,Wu E.-H.. Sequential point trees with visibility processed efficiently[J]. Jisuanji Xuebao/Chinese Journal of Computers, 2005, 28(6), 950-958.
APA	Wei F.., Wang W.-C.., & Wu E.-H. (2005). Sequential point trees with visibility processed efficiently. Jisuanji Xuebao/Chinese Journal of Computers, 28(6), 950-958.
MLA	Wei F.,et al."Sequential point trees with visibility processed efficiently".Jisuanji Xuebao/Chinese Journal of Computers 28.6(2005):950-958.

Files in This Item:
There are no files associated with this item.

If you have any objections to this item, please fill out the form below and the administrator will contact you as soon as possible.
Content:
Email：	*
Affiliation No.
Verification Code:	Refresh

Any comments and suggestions are welcomed.
Title:	*
Content:
Email：	*
Verification Code:	Refresh