Rapidly Getting Intersection Algorithm for Triangular Mesh Surface Models

SUN Dian-zhu; SUN Yong-wei; TIAN Zhong-chao; SHI Yang; LI Yan-rui

Journal of Beijing University of Technology > 2012 > 38(8): 1121-1124,1135.

SUN Dian-zhu, SUN Yong-wei, TIAN Zhong-chao, SHI Yang, LI Yan-rui. Rapidly Getting Intersection Algorithm for Triangular Mesh Surface Models[J]. Journal of Beijing University of Technology, 2012, 38(8): 1121-1124,1135.

Citation:

PDF (674 KB)

Rapidly Getting Intersection Algorithm for Triangular Mesh Surface Models

School of Mechanical Engineering, Shandong University of Technology, Zibo 255091, Shandong, China

More Information

Received Date: March 04, 2010
Available Online: December 02, 2022

Graphical Abstract

Abstract

Abstract

An algorithm for rapidly getting intersection of triangular mesh surface models is proposed,which reduces the intersecting regions through intersection test for the bounding boxes of nodes based on the dynamic spatial indexing structure of triangular mesh surface models,so that the sets of intersection triangular are exactly located and the intersection data of mesh surface models are obtained,then the intersecting process of triangular mesh surface models is completed by rapidly tracing the intersect curves.Experimental analysis shows that the exact intersection of two complex triangular mesh surface models can be rapidly obtained by this algorithm,and it has important meanings to tailoring,splicing and NC tool path generation of triangular mesh surface models.

FullText(HTML)

References (9)

References

[1]	孙玉文,刘伟军,王越超.基于三角网格曲面模型的刀位轨迹计算方法[J].机械工程学报,2002,38(10):50-53.SUN Yu-wen,LIU Wei-jun,WANG Yue-chao.Researchon the algorithm of NC tool path calculation for triangularsurface machining[J].Chinese Journal of MechanicalEngineering,2002,38(10):50-53.(in Chinese)
[2]	郭开波,张李超,王从军,等.STL模型布尔运算的实现[J].华中科技大学学报,2006,34(7):96-99.GUO Kai-bo,ZHANG Li-chao,WANG Cong-jun,et al.Implementation of boolean operations on STL models[J].Journal of Huazhong University of Science and Technology,2006,34(7):96-99.(in Chinese)
[3]	郑红军,陈志杨,叶修梓.基于拓扑关系的交线快速生成方法[J].计算机集成制造系统,2003,9(12):1145-1149.ZHENG Hong-jun,CHEN Zhi-yang.YE Xiu-zi.Rapidcreation algorithm of intersection line based on topology[J].Computer Integrated Manufacturing Systems,2003,9(12):1145-1149.(in Chinese)
[4]	LO H,WANG X.A fast robust algorithm for theintersection of triangulated surfaces[J].Engineering withComputers,2004,20(1):11-21.
[5]	花卫华,邓伟萍,刘修国,等.一种改进的不规则三角网格曲面切割算法[J].中国地质大学学报:地球科学,2006,31(5):619-623.HUA Wei-hua,DENG Wei-ping,LIU Xiu-guo,et al.Improved partition algorithm between triangulated irregularnetwork[J].Journal of University of Geosciences:EarthScience,2006,31(5):619-623.(in Chinese)
[6]	周海.细分曲面造型技术研究[D].南京:南京航空航天大学机电学院,2004.ZHOU Hai.Research on modeling technology ofsubdivision surface[D].Nanjing:School of Mechatronics,Nanjing University of Aeronautics and Astronautics,2004.(in Chinese)
[7]	孙殿柱,李心成,田中朝,等.基于动态空间索引结构的三角网格模型布尔运算[J].计算机辅助设计与图形学学报,2009,21(9):1232-1237.SUN Dian-zhu,LI Xin-cheng,TIAN Zhong-chao,et al.Accelerated Boolean operations on triangular mesh modelsbased on dynamic spatial indexing[J].Journal ofComputer-Aided Design&Computer Graphics,2009,21(9):1232-1237.(in Chinese)
[8]	BECKMANN N,KRIEGEL H P,SCHNEIDER R,et al.The R*-tree:an efficient and robust access method forpoints and rectangles[C]∥Proceedings of SIGMOD,Atlantic City,New Jersey,1990:322-331.
[9]	孙殿柱,朱昌志,李延瑞,等.散乱点云局部型面参考数据的快速查询算法[J].农业机械学报,2009,5:218-221.SUN Dian-zhu,ZHU Chang-zhi,LI Yan-rui,et al.Algorithm of local model reference data querying forscattered points[J].Transactions of the Chinese Society ofAgricultural Machinery,2009,5:218-221.(in Chinese)

Cited By

Get Citation

PDF

XML

Article views (26) PDF downloads (8)

Turn off MathJax

Article Contents

Abstract

References

Rapidly Getting Intersection Algorithm for Triangular Mesh Surface Models

Abstract

References

Catalog

Export File

Citation

Format

Content