电子科技大学 光电信息学院,四川,成都,610054
Published:2016
移动端阅览
曾磊夫, 刘爽. 基于凸包的视锥体裁剪精度优化[J]. 微电子学与计算机, 2016, 33(1): 85-89.
ZENG Lei-fu, LIU Shuang. Precision Optimeization of View Frustum Culling Based on Convex Hull[J]. 2016, 33(1): 85-89.
曾磊夫, 刘爽. 基于凸包的视锥体裁剪精度优化[J]. 微电子学与计算机, 2016, 33(1): 85-89. DOI:
ZENG Lei-fu, LIU Shuang. Precision Optimeization of View Frustum Culling Based on Convex Hull[J]. 2016, 33(1): 85-89. DOI:
针对视锥体对空间中物体的裁剪
提出一种新的基于凸包的精度优化方法
该方法首先得到三维物体到二维平面的投影
然后对投影坐标进行凸包组织
最后根据凸包上的坐标点和摄像机的连线得到物体的可见性
整个优化法只需一些额外的存储空间来存储物体的凸包信息即可.实验结果表明
该方法易于实现
能减少通常的包围球、圆柱体检测法中出现的不合理结果
进而提高整个三维渲染系统的效率.
According to the space object frustum clipping
a kind of precision optimization method has been put forward that is based on the convex hull.First of all
the method get the 2d plane projection from 3d object
and organize projective coordinate to a convex hull
finally get the visibility of objects according to the line form the coordinate of convex hull and the camera
whole optimization needs any extra memory to save the data of convex hull only. The experimental results show that this method implement simply
it can reduce the unreasonable result from the sphere detection or cylinder detection
improving the whole efficiency of 3D rendering system.
刘光惠, 陈传波. 求解简单多边形和平面点集凸包的新算法[J]. 计算机科学, 2007, 34(12): 222-226. DOI: 222
黄建国, 黄穗. 一种新的视截体裁剪算法[J]. 微计算机应用, 2009, 30(12): 18-22. DOI: 18
Indiana, USA Andre LaMothe. Tricks of the 3D game programming gurus: advanced 3D graphics and rasterization[M]. Indiana, USA: Sams Publishing, 2003: 531-538. DOI: 531
吴文周, 李利番, 王结臣. 平面点集凸包Graham算法的改进[J]. 测绘科学, 2010, 35(6): 123-125. DOI: 123
王超一, 丁莹, 张鑫, 等. 一种基于投影的视锥体裁剪算法[J]. 系统仿真学报, 2014, 26(10): 2412-2417. DOI: 2412
王竹, 束搏, 邱显杰, 等. 基于场景结合的大规模动态群体可见性计算方法[J]. 计算机辅助设计与图形学学报, 2009, 21(3): 331-338. DOI: 331
吴思, 郭立, 郭安泰. 3D图形的裁剪算法及硬件实现技术研究[J]. 电子技术, 2008, 46(2): 44-48. DOI: 44
王杰臣. 2维空间数据最小凸包生成算法优化[J]. 测绘学报, 2002, 46(1): 82-86. DOI: 82
0
Views
17
下载量
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution