节点文献

三维散乱数据三角形网格逼近的一种算法

An Algorithm of Approximation of 3D Scattered Data with Triangular Meshes

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 黄雪梅王平江陈吉红张新访周济

【Author】 Huang Xuemei Wang Pingjiang Chen Jihong Zhang Xinfang Zhou Ji (Huazhong University of Science and Technology, Wuhan, 430074)

【机构】 华中理工大学机械学院CAD中心

【摘要】 以激光-机器视觉测量方式得到的曲面数据云为基础,对曲面密集3维散乱数据用线性逼近进行三角形网格拟合。根据激光测量方式和3维点群分布的特点,应用八叉树空间分割原理,对密集散乱点群采用空间分区存储,建立八叉树拓扑关系,加快几何建模速度。文中介绍了用欧几里德最小生成树对微切平面法矢方向进行调整的方法以及曲面三角形网格逼近的MarchingCube方法。

【Abstract】 Based on data cloud, which is measured from curved surface by laser-machine-vision system(LMVS), the principle of linear approximation is applied in fitting triangular meshes on dense scattered points of curved surface in this paper According to the way of LMVS and the distributive feature of 3D scattered points and by using of the principle of octree space division, the space occupied by the dense scattered points is divided The octree topology relation is generated, therefore the speed is improved for geometry modeling The Euclidean Minimum Spanning Tree (EMST) is adopted to consistent tangent plane orientation, and the method of Marching Cube for approximating curved surface with triangular meshes is also introduced in this paper

【基金】 国家自然科学基金
  • 【文献出处】 计算机工程与设计 ,COMPUTER ENGINEERING AND DESIGN , 编辑部邮箱 ,1998年02期
  • 【分类号】TP391.72,TP391.75
  • 【被引频次】41
  • 【下载频次】240
节点文献中: 

本文链接的文献网络图示:

本文的引文网络