Improved small feature culling for large scale process plant model based on octree

doi:10.11772/j.issn.1001-9081.2017.09.2626

Journal of Computer Applications ›› 2017, Vol. 37 ›› Issue (9): 2626-2630.DOI: 10.11772/j.issn.1001-9081.2017.09.2626

Previous Articles Next Articles

Improved small feature culling for large scale process plant model based on octree

DU Zhenlin^1,2, TANG Weiqing^1,2,3, QIN Li^1,2, LI Shicai³

1. Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, China;
2. School of Computer and Control Engineering, University of Chinese Academy of Sciences, Beijing 101408, China;
3. Beijing Zhongke Fulong Computer Technology Company Limited, Beijing 100085, China

Received:2017-03-15 Revised:2017-05-19 Online:2017-09-13 Published:2017-09-10

基于八叉树的大规模流程工厂模型细节裁剪算法

杜振林^1,2, 唐卫清^1,2,3, 覃力^1,2, 李士才³

1. 中国科学院计算技术研究所, 北京 100190;
2. 中国科学院大学计算机与控制学院, 北京 101408;
3. 北京中科辅龙计算机技术股份有限公司, 北京 100085

通讯作者: 唐卫清,tangweiqing@ict.ac.cn
作者简介:杜振林(1992-),男,福建泉州人,硕士研究生,CCF会员,主要研究方向:计算机辅助设计与图形学;唐卫清(1956-),男,江苏太仓人,研究员,博士,CCF杰出会员,主要研究方向:制造业信息化、计算机辅助设计与图形学、计算机支持的协同计算、工业大数据及其可视化;覃力(1987-),男,湖北宜昌人,博士研究生,CCF会员,主要研究方向:大型软件设计、机器学习;李士才(1971-),男,河北易县人,高级工程师,博士,主要研究方向:计算机辅助设计与图形学、软件建模及协同设计。

Abstract

Abstract: To eliminate the drawbacks of traditional small feature culling algorithm which processing granularity are triangles and can't efficiently cope with the number of vertexes and triangles up to hundreds of millions in a certain time period, an improved small feature culling algorithm for large scale process plant based on octree was proposed. Based on the component primitive characteristics and spatial characteristics of the process plant model, the value of screen for quantizing the size of component was proposed, and the established octree and the value of screen were combined to estimate the upper limit of the number of pixels, so as to quickly determine whether the component would be culled or not. The experimental results show that the proposed algorithm is simple and effective. Compared with the current popular review software after loading the factory model with 10000 pipelines, the frame rate is increased by at least 50%, which greatly improves the platform's fluency. Process factory industry and graphics platform as a whole to enhance the level of design has a positive meaning.

Key words: process plant model, small feature culling, octree, primitive characteristic, frame rate

摘要： 针对传统的细节裁剪算法，处理粒度为面片级，无法在规定时间内快速处理顶点、面片规模数以亿计的流程工厂模型的问题，提出一种基于八叉树的大规模流程工厂模型细节裁剪算法，用于解决传统细节裁剪效率低下的问题，以保证较高的交互帧率。该方法依据组成流程工厂模型的构件体素特征以及空间特征，提出用于量化构件大小的占屏值，并结合建立的八叉场景树，依据所述占屏值近似估算一系列构件投影至屏幕所占据的像素点数量上限，从而快速判断是否裁剪。实验结果表明，所提算法简单有效，与现今主流的漫游软件在加载具有10000根管线的工厂模型后进行对比，其帧率至少提升50%，显著提升了平台的交互流畅度，对流程工厂行业以及图形平台整体的设计水平的提升有积极的意义。

关键词: 流程工厂模型, 细节裁剪, 八叉树, 体素特征, 帧率

CLC Number:

TP391.41

DU Zhenlin, TANG Weiqing, QIN Li, LI Shicai. Improved small feature culling for large scale process plant model based on octree[J]. Journal of Computer Applications, 2017, 37(9): 2626-2630.

杜振林, 唐卫清, 覃力, 李士才. 基于八叉树的大规模流程工厂模型细节裁剪算法[J]. 计算机应用, 2017, 37(9): 2626-2630.

References

[1] COHEN-OR D, CHRYSANTHOU Y L, SILVA C T, et al. A survey of visibility for walkthrough applications[J]. IEEE Transactions on Visualization and Computer Graphics, 2003, 9(3):412-431.
[2] LUEBKE D, GEORGES C. Portals and mirrors:simple, fast evaluation of potentially visible sets[C]//Proceedings of the 1995 Symposium on Interactive 3D Graphics. New York:ACM, 1995:105-106.
[3] TELLER S J, SÉQUIN C H. Visibility preprocessing for interactive walkthroughs[EB/OL].[2016-11-06]. https://static.aminer.org/pdf/PDF/000/594/056/visibility_preprocessing_for_interactive_walkthroughs.pdf.
[4] AIREY J M, ROHLF J H, BROOKS, Jr. F P. Towards image real-ism with interactive update rates in complex virtual building environments[C]//Proceedings of the 1990 Symposium on Interactive 3D Graphics. New York:ACM, 1990:41-50.
[5] HUGHES J F, VAN DAM A, FOLEY J D, et al. Computer Graphics:Principles and Practice[M]. Upper Saddle River, NJ:Pearson Education, 2013:1047-1048.
[6] WEILER K, ATHERTON P. Hidden surface removal using polygon area sorting[C]//Proceedings of the 4th Annual Conference on Computer Graphics and Interactive Techniques. New York:ACM, 1977:214-222.
[7] EDWARD A.交互式计算机图形学:基于OpenGL的自顶向下方法[M].张荣华,姜小磊,宋雨,译.北京:电子工业出版社,2009:196-198.(EDWARD A. Interactive Computer Graphics:a Top-down Approach using OpenGL[M]. ZHANG R H, JIANG X L, SONG Y, translated. Beijing:Publishing House of Electronics Industry, 2009:196-198.)
[8] CLARK J H. Hierarchical geometric models for visible surface algorithms[J]. Communications of the ACM, 1976, 19(10):547-554.
[9] 许云杰,胡事民.基于层次细节模型的遮挡裁剪算法[J].中国图象图形学报,2002,7(9):962-967.(XU Y J, HU S M. An occlusion grid culling algorithm based on LOD models[J]. Journal of Image and Graphics, 2002, 7(9):962-967.)
[10] ZHANG H. Effective occlusion culling for the interactive display of arbitrary models[D]. Chapel Hill, NC:University of North Carolina, 1998.
[11] ZHANG H, MANOCHA D, HUDSON T, et al. Visibility culling using hierarchical occlusion maps[C]//Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques. New York:ACM/Addison-Wesley, 1997:77-88.
[12] BERNARDINI F, KLOSOWSKI J T. Directional discretized occluders for accelerated occlusion culling[J]. Computer Graphics Forum, 2010, 19(3):507-516.
[13] ASSARSSON U, MÖLLER T. Optimized view frustum culling algorithms for bounding boxes[J]. Journal of Graphics Tools, 2000, 5(1):9-22.

[1]	Guangyi DOU, Fanan WEI, Chuangyi QIU, Jianshu CHAO. Tracking appearance features based on attention self-correlation mechanism [J]. Journal of Computer Applications, 2023, 43(4): 1248-1254.
[2]	Haojie GU, Jun ZHANG. Real-time water wave simulation method based on wave annulus particles [J]. Journal of Computer Applications, 2022, 42(12): 3876-3883.
[3]	ZHONG Wenbin, SUN Si, LI Xurui, LIU Guangshuai. Point cloud compression method combining density threshold and triangle group approximation [J]. Journal of Computer Applications, 2020, 40(7): 2059-2068.
[4]	XI Zhihong, WANG Hongxu, HAN Shuangquan. Fast mismatch elimination algorithm and map-building based on ORB-SLAM2 system [J]. Journal of Computer Applications, 2020, 40(11): 3289-3294.
[5]	LYU Hongwu, FU Junqiang, WANG Huiqiang, LI Bingyang, YUAN Quan, CHEN Shijun, CHEN Dawei. Fast retrieval method of three-dimensional indoor map data based on octree [J]. Journal of Computer Applications, 2019, 39(1): 82-86.
[6]	LIU Jun, YUAN Peiyan, LI Yongfeng. Improved robust OctoMap based on full visibility model [J]. Journal of Computer Applications, 2017, 37(5): 1445-1450.
[7]	LIN Huican, LYU Qiang, WANG Guosheng, ZHANG Yang, LIANG Bing. 3D simultaneous localization and mapping for mobile robot based on VSLAM [J]. Journal of Computer Applications, 2017, 37(10): 2884-2887.
[8]	Wei PENG Jian-xi LI Bin YAN Li TONG Jian CHEN Shi-yong GUAN. Volume rendering acceleration method based on optimal bricking for large volume data [J]. Journal of Computer Applications, 2011, 31(08): 2221-2224.
[9]	. Theft detection based on omni-directional vision sensors [J]. Journal of Computer Applications, 2010, 30(1): 36-40.
[10]	Miao HUANG Hai-Chao ZHANG 李超 LI Chao. Algorithm for finding knearest neighbors based on octree segmentation in space [J]. Journal of Computer Applications, 2008, 28(8): 2046-2048.
[11]	. Ray tracing algorithm based on octree space partition method [J]. Journal of Computer Applications, 2008, 28(3): 656-658.
[12]	. HLODs for fast rendering of large-scale environments [J]. Journal of Computer Applications, 2007, 27(9): 2126-2128.
[13]	. Application of variable frame length and frame rate in speaker verification system [J]. Journal of Computer Applications, 2007, 27(8): 2051-2052.
[14]	Guang-Xian LU. Study of virtual octree model for volume data [J]. Journal of Computer Applications, 2006, 26(12): 2856-2859.

Improved small feature culling for large scale process plant model based on octree

基于八叉树的大规模流程工厂模型细节裁剪算法

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 14

Recommended Articles

Metrics