A New Algorithm for the Boundary Representation of Octree Model

Abstract:

According to the space structure of octree and the neighbor of octree node，a new algorithm for calculating the boundary representation of octree model is put forward. The algorithm is started by minimum nodes of octrees and then gradually to increase into the biggest node of octrees, thus avoided the decomposition of some node effectively. For raising the calculation efficiency of algorithm, the integral “bit” is used to record the status of node and carry on judging. Theory analysis and examples validate the rationality and efficiency of the algorithm.

• Periodical: Applied Mechanics and Materials (Volumes 220-223)
• Pages: 2857-2861
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.220-223.2857
• Online since: November 2012
• Authors: Jin Min Wang, Lu Feng Luo, Ying Liu
• Keywords: Algorithm (GA), Boundary Representation, Neighbor, Octree

References

[1] SHAO Zheng-wei,XI Ping: submitted to Journal of Engineering Graphics(2010)

[2] SU Chao-shi, ZHAO Ming-chang, ZHANG Xiang-wen: submitted to Journal of Computer Applications( 2008)

[3] Huang Zhanpeng, Bao Susu, Liu Yaohui: submitted to Computer Applications and Software (2009)

[4] Wang Mingzhu: submitted to Journal of Taiyuan Heavr Machinery Institute(1997)

[5] GUO Rui-feng,LIU Chun-hui,DING Wan-fu: submitted to Journal of Chinese Computer Systems(2010)

[6] Lu Shengkai and Tang Zesheng: submitted to Journal of Computer-Aided Design & Computer Graphics(1989)

[7] H. H. Atkinson, I. Gargantini, M. V. S. Ramanath: submitted to Pattern recognition(1985)

[8] H. H. Atkinson, I. Gargantini, M. V. S. Ramanath: submitted to Computing(1984)

[9] ZHANG Qin, GUO Wei: submitted to Journal of System Simulation(2001)