Intersection algorithm of point cloud surface by spatial mesh and refinement

被引：2
|
作者：
Zheng P.-F. [1 ,2 ]
Zou P.-L. [1 ]
Zhao J.-D. [1 ]
Lin D.-J. [1 ]
An Q. [1 ]
机构：
[1] School of Mechanical and Power Engineering, East China University of Science and Technology, Shanghai
[2] School of Mechanical Information, Yiwu Industrial & Commercial College, Yiwu
来源：
An, Qi (anqi@ecust.edu.cn) | 2018年 / Zhejiang University卷 / 52期
关键词：
Envelope box; Intersecting; Meshing; Point cloud; Refinement;
D O I：
10.3785/j.issn.1008-973X.2018.03.025
中图分类号：
学科分类号：
摘要：
An intersection algorithm of point cloud surface by spatial mesh and refinement was proposed according to the analysis of the advantages and disadvantages of the existing methods of computing line of intersection. The discrete method was used to express the geometric graphic; intersection lines between the graphics were computed by intersection or coincidence degree of discrete points. The intersection region of the point cloud surface was quickly located by the space meshing envelope boxes. The point clouds in the intersection were refined by calculating the triangles' centre-of-gravity position. The validity of the proposed algorithm was verified by computing the intersection line in practical point cloud models. Results show that the proposed algorithm is simple, accurate, stable and reliable, with wide adaptability. © 2018, Zhejiang University Press. All right reserved.
引用
收藏
页码：605 / 612
页数：7
相关论文
共 22 条
  • [1] Zhang X.-D., Wang Y.-Y., Hao P.-F., Et al., Study of establishing the equations of intersecting line and its developmental figure, Machine Design and Research, 4, 2, pp. 21-24, (2008)
  • [2] Liu D.-G., Wu X.-Q., Li J.-X., Intersection calculation method research based on VTK, Modern Manufacturing Engineering, 3, pp. 59-63, (2016)
  • [3] Han S.-J., A general method of drawing intersection line rapidly and accurately, Mechanical Engineering & Automation, 10, 5, pp. 201-204, (2012)
  • [4] Yang X.-L., On the form and projection analysis of conic cut and hand in line, Journal of Dong-hua University, 8, 4, pp. 76-78, (2005)
  • [5] Zhu J.-N., Wang M.-J., Wei Z.-C., Et al., Efficient algorithm for computing intersection curve between plane and subdivision surface, Computer Integrated Manufacturing Systems, 6, 20, pp. 1322-1329, (2014)
  • [6] Li H.-Y., Chen L.-J., Algorithm for finding plane & free-form surface intersection curve based on subdivision of quadrilateral mesh parameters, Journal of Mechanical & Electrical Engineering, 8, 30, pp. 956-970, (2013)
  • [7] Cao B., Wang M.-J., Zhu J.-N., Efficient algorithm for computing intersection curve between subdivision surfaces, Computer Integrated Manufacturing Systems, 9, 20, pp. 2079-2085, (2014)
  • [8] Sun D.-Z., Sun Y.-W., Tian Z.-C., Et al., Rapidly getting intersection algorithm for triangular mesh surface models, Journal of Bei-jing University of Technology, 8, 38, pp. 1121-1135, (2012)
  • [9] Li N., Tian Z., Zhang L.-H., Et al., Optimization algorithm for triangular mesh surface intersection, Journal of Liao-ning Technical University: Natural Science, 9, 32, pp. 1269-1273, (2013)
  • [10] Fu M.-Z., Luo Z.-X., Feng E.-B., Tracing implicit surface intersection based on differential geometry, Journal of Computer-Aided Design & Computer Graphics, 4, 28, pp. 556-564, (2016)
123