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 条
  • [11] Skoda A., A new algorithm for the intersection of a line with the independent set polytope of a matroid, Bulletin Des Sciences Mathematiques, 133, 2, pp. 169-185, (2009)
  • [12] Marin G., Jon R., Computing line intersections, International Journal of Image and Graphics, 1, 2, pp. 217-230, (2001)
  • [13] Duan M.-D., Zheng L.-X., Li M.-L., Et al., Porous structure voxelization for STL model based on reverse geometrical intersection, Journal of He-nan Polytechnic University: Nature Science, 1, 36, pp. 86-90, (2017)
  • [14] Sabharwal C.L., Leopold J.L., A triangle-triangle intersection algorithm, Computer Science & Information Technology, 5, 11, pp. 27-35, (2015)
  • [15] Wang W., Goldman R., Tu C., Enhancing Levin's method for computing quadric-surface intersections, Computer Aided Geometric Design, 20, 7, pp. 401-422, (2003)
  • [16] Teixeira F.G., Creus G.J., A robust algorithm to determine surface/surface intersection in both parametric spaces, Mecnica Computacional, 41, pp. 3093-3115, (2008)
  • [17] Chrismianto D., Kim D.J., Parametric bulbous bow design using the cubic Bezier curve and curve-plane intersection method for the minimization of ship resistance in CFD, Journal of Marine Science & Technology, 19, 4, pp. 479-492, (2014)
  • [18] Jia X., Wang W., Choi Y.K., Et al., Continuous detection of the variations of the intersection curve of two moving quadrics in 3-Dimensional projective space, Journal of Symbolic Computation, 73, C, pp. 221-243, (2016)
  • [19] Fu Q., Wu Z., Wang X., Et al., An algorithm for finding intersection between ball B-spline curves, Journal of Computational & Applied Mathematics, 327, pp. 260-273, (2017)
  • [20] Shen J., Alliez P., Dodgson N., A line/trimmed NURBS surface intersection algorithm using matrix representations, Computer Aided Geometric Design, 48, C, pp. 1-16, (2016)
123