复杂区域的光源优化布局算法.pdfVIP

第27 卷 第 10 期 计算机辅助设计与图形学学报 Vol. 27 No.10 2015 年 10 月 Journal of Computer-Aided Design Computer Graphics Oct. 2015 复杂区域的光源优化布局算法 * 魏静如, 吕 琳 , 杨承磊 (山东大学计算机科学与技术学院 济南 250101) (lulin.linda@) :光源的优化布局是室内设计与装饰中的一个重要问题. 针对复杂场景下的光源布局, 考虑到光遇到多边形边 界或障碍物时受到的影响, 提出一种基于可见Voronoi 图的最优覆盖算法. 首先根据光衰减的特性将复杂区域中的光 源最优覆盖问题抽象为最小圆覆盖问题; 然后以可见 Voronoi 图的概念为基础对给定目标区域进行划分; 最后利用 Lloyd 迭代的思想移动光源, 直至达到合适的位置, 从而实现光源的重新布局. 利用三维渲染引擎及图像熵的特性进 行仿真及分析的结果表明, 在复杂区域中, 该算法在消耗较少能量的前提下可以得到很好的灯光效果, 从而验证了 算法的可行性. ：光源布局; 可见Voronoi 图; 圆覆盖 ：TP391.41 A Lighting Design Algorithm in Complex Regions * Wei Jingru, Lu Lin , and Yang Chenglei (School of Computer Science and Technology, Shandong University, Ji’nan 250101) Abstract: Lighting layout design is an important problem in interior design and decoration. We propose an algorithm for optimizing the light source placement in complex regions, considering the light attenuation caused by the boundary walls or obstacles. We treat the lighting layout problem as an area coverage problem in a non-convex region. We use the visible Voronoi diagram for partitioning the given region. We optimize the position of each light source following the Lloyd’s method until each reaches the steady position. Finally, we simulate the result layout using three-dimensional rendering engine and analyze the entropy of the ren- dered image. Experimental results show that a satisfactory lighting effect with little energy consumption is achieved, which proves the feasibility of the algorithm. Key words: lighting layout design; visible Voronoi diagram; disk coverage . , , . , ,