efficient search of lightcuts by spatial clustering

ISCAS OpenIR

	efficient search of lightcuts by spatial clustering
	Wang Guangwei; Xie Guofu; Wang Wencheng
	2011
会议名称	SIGGRAPH Asia 2011 Sketches, SA'11
会议录名称	SIGGRAPH Asia 2011 Sketches, SA'11
页码	-
会议日期	December 1
会议地点	Hong Kong, China
收录类别	EI
ISBN	9781450311380
部门归属	(1) State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China; (2) Graduate University of Chinese Academy of Sciences China
摘要	Lightcuts is an efficient illumination method for scenes with many complex lights, by hierarchical clustering of lights in a light tree. However, when the light tree is large, it is very time-consuming to traverse in the tree to get the suitable clusters of lights for illumination computation. For this, some methods proposed to use image coherence for neighboring pixels to share clusters of lights, and so save traversal cost in the light tree. However, with the image resolutions reduced, fewer and fewer coherences could be used and so their acceleration efficiency will be reduced dramatically, and they may even decrease the rendering efficiency. This sketch proposes to exploit spatial coherences to enhance rendering by lightcuts. For the intersection points between rays and the scene, they are clustered on the fly and the points of a cluster search their respective suitable clusters of lights from a common set of clusters, called a common cut. In this way, the traversal cost from the tree root to the common cuts can be considerably saved for acceleration. Results show that our method can be faster than the methods using image coherence, and works stably with various image resolutions. And with the lights being more complex, our method can obtain more acceleration.; Lightcuts is an efficient illumination method for scenes with many complex lights, by hierarchical clustering of lights in a light tree. However, when the light tree is large, it is very time-consuming to traverse in the tree to get the suitable clusters of lights for illumination computation. For this, some methods proposed to use image coherence for neighboring pixels to share clusters of lights, and so save traversal cost in the light tree. However, with the image resolutions reduced, fewer and fewer coherences could be used and so their acceleration efficiency will be reduced dramatically, and they may even decrease the rendering efficiency. This sketch proposes to exploit spatial coherences to enhance rendering by lightcuts. For the intersection points between rays and the scene, they are clustered on the fly and the points of a cluster search their respective suitable clusters of lights from a common set of clusters, called a common cut. In this way, the traversal cost from the tree root to the common cuts can be considerably saved for acceleration. Results show that our method can be faster than the methods using image coherence, and works stably with various image resolutions. And with the lights being more complex, our method can obtain more acceleration.
关键词	Image Resolution Interactive Computer Graphics
主办者	ACM Spec. Interest Group Comput. Graph. Interact.; Tech. (SIGGRAPH); ACM Special Interest Group on Computer-Human; Interaction (SIGCHI)
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/16254
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Wang Guangwei,Xie Guofu,Wang Wencheng. efficient search of lightcuts by spatial clustering[C],2011:-.