CORC  > 软件研究所  > 软件所图书馆  > 会议论文
efficient search of lightcuts by spatial clustering
Wang Guangwei ; Xie Guofu ; Wang Wencheng
2011
会议名称SIGGRAPH Asia 2011 Sketches, SA'11
会议日期December 1
会议地点Hong Kong, China
关键词Image resolution Interactive computer graphics
页码-
中文摘要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.
收录类别EI
会议主办者ACM Spec. Interest Group Comput. Graph. Interact.; Tech. (SIGGRAPH); ACM Special Interest Group on Computer-Human; Interaction (SIGCHI)
会议录SIGGRAPH Asia 2011 Sketches, SA'11
语种英语
ISBN号9781450311380
内容类型会议论文
源URL[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]. 见:SIGGRAPH Asia 2011 Sketches, SA'11. Hong Kong, China. December 1.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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


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