期刊文献+

融合图像域信息的面结构光测量点云数据三角化处理 被引量:3

Point Cloud Data Trianglation Processing of Structural Light Measurement Using Image Field Information
在线阅读 下载PDF
导出
摘要 点云数据三角化处理是逆向工程及快速原型领域中不可缺少的环节。针对传统点云数据三角化算法效率低及鲁棒性差的特点,结合面结构光三角法测量原理,提出融合图像域信息的点云数据三角化方法;根据点云数据图像域信息所具有的空间拓扑关系完成图像域内的三角化连接;然后将其映射到三维空间域中完成点云数据的三角化。由于图像域具有拓扑确定性,不需要将点云数据映射到二维平面再进行平面空间的拓扑关系确定及三角化处理,从而使算法的鲁棒性及处理效率得到提升,最后以具体的实例验证算法有效性。算法已用到具体的项目中实现了测量过程中点云数据的快速三角化。 It is necessary to triangulate the point cloud in reverse engineering and rapid prototyping. The efficiencies of traditional triangulation methods are low and their robustness is bad. A method of triangulation using the image field information is proposed in the procedure of structural light measurement. The method uses relationship of pixel in image field to describe the relationship of 3D point cloud. Due to the fact thtat pixels in image field have definite topology, it is not necessary to map 3D point cloud to 2D domain for building their topology relationship. Therefore, the efficiency and robustness of the triangulation procedure is improved. Finally, one case is used to prove the validity of the method. The method has already been applied to engineering practice.
作者 张学昌 杨峰
出处 《机械科学与技术》 CSCD 北大核心 2008年第4期421-424,共4页 Mechanical Science and Technology for Aerospace Engineering
基金 宁波市自然科学基金项目(2007A610011)资助
关键词 点云数据 三角化 图像域 鲁棒性 结构光测量 point cloud triangulation image field robustness structural light measurement
  • 相关文献

参考文献6

二级参考文献14

  • 1Shewchuk J R. Delaunay refinement algorithms for triangular mesh generation[J]. Computational Geometry: Theory and Applications,2002,22(1) :21 - 74.
  • 2Borouchaki H, Laug P, George P L. Parametric surface meshing using a combined advancing-front generalized Delaunay approach[J].International Journal for Numerical Methods in Engineering, 2000,49(2) :233 - 259.
  • 3Yasushi Ito, Kazuhiro Nakahashi. Surface triangulation for nontrimmed surface models[ R]. AIAA-2001-2601,2001.
  • 4Kwak S, Pozrikidis C. Adaptive triangulation of evolving, closed, or open surfaces by the advancing-front method[J]. Journal of Computational Physics, 1998,145 ( 1 ) :61 - 88.
  • 5Keisuke Inoue,Takayuki Itoh, Atsushi Yamada, et al. Face clustering of a large-scale CAD model for surface mesh generation[J]. Computer Aided-Design, 2001,33 (3): 251 - 261.
  • 6Laug P, Borouchaki H. Curve linearization and discretization for meshing composite parametric surfaces[J]. Communications in Numerical Methods in Engineering, 2004,20( 11 ): 869 - 876.
  • 7Roque Corral. Surface mesh generation by means of steiner triangulations[R]. AIAA-98-3013, 1998.
  • 8Ruppert Jim. A delaunay refinement algorithm for quality 2-dimensional mesh generation[J]. Journal of Algorithms , 1995,18(3):548-585.
  • 9Gill B, Matthew D. On triangulating three -dimensional polygons. Com putational Geometry: Theory and Applications [ J ]. 1998, 10 (3) : 155 - 170.
  • 10Ruppen J, Seidel R. On the difficulty of triangulating three - dimensional non - convex polyhedra. Discrete Computational Geometry[J]. 1992, 7 : 227 - 253.

共引文献31

同被引文献13

引证文献3

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部