线性复杂度的网格优化划分
文献类型：期刊论文
| 作者 | 李静 ; 王文成 |
| 刊名 | 软件学报
 |
| 出版日期 | 2011 |
| 卷号 | 22期号:10页码:2488-2496 |
| 关键词 | 网格 光线跟踪 动态场景 大规模场景 分辨率 |
| ISSN号 | 1000-9825 |
| 其他题名 | optimizing grid construction in linear complexity |
| 中文摘要 | 均匀网格划分是一种重要的场景空间组织结构,在光线跟踪绘制、碰撞检测、路径规划等方面有着广泛的应用.特别是由于其计算简单,很适合动态环境的处理.由于该结构的创建时间、空间需求和应用效率与网格分辨率密切相关,优化的网格划分一直是国际上探讨的重要问题.对此,提出一种新的优化划分方法,确保该结构的创建时间和空间需求都是O(N)复杂度的.这里,N是场景的面片数.同时,在相关的应用计算方面,比如光线跟踪,可与目前最好的加速计算结构相媲美.实验结果表明,该优化划分方法所产生的层次网格结构具有与当前主流的加速结构kd树相当的加速效率,且大幅降低了创建时间,优于已有的类似工作. |
| 英文摘要 | Uniform grid is one of the important spatial organization structures, which is widely used in many applications such as ray tracing, collision detection, path planning and so on. Its simplicity to compute makes it very suitable for processing dynamic scenes. Because its construction time, space requirement and application efficiency are closely related with the grid resolution, optimizing grid construction has always been an important topic in the world. Hense, a new optimization method for grid construction which ensures that both of the construction time and the space requirement are in the complexity O(N), where N is the number of the primitives in the scene is proposed. In the related applications, such as ray tracing, it can achieve high acceleration efficiency, comparable with the best acceleration structures to date, such as the kd-tree, while reducing the construction time dramatically. These have been approved by the experimental results. © 2011 ISCAS. |
| 学科主题 | Computer Science |
| 收录类别 | CNKI ; EI ; CSCD |
| 资助信息 | 国家自然科学基金(60873182,60773026,60833007) |
| 语种 | 中文 |
| CSCD记录号 | CSCD:4306899 |
| 公开日期 | 2013-10-08 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16055]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | 李静,王文成. 线性复杂度的网格优化划分[J]. 软件学报,2011,22(10):2488-2496. |
| APA | 李静,&王文成.(2011).线性复杂度的网格优化划分.软件学报,22(10),2488-2496. |
| MLA | 李静,et al."线性复杂度的网格优化划分".软件学报 22.10(2011):2488-2496. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。