散乱数据曲面重构中数据点的自动分类研究-计算机软件与理论专业论文.docxVIP

摘要本文采用了可以比较方便地用参数方程表示的二次曲面作为数据点的分类标 摘要 本文采用了可以比较方便地用参数方程表示的二次曲面作为数据点的分类标 准，根据点的法向量以及其邻域结点的各种属性，对应于平面、球面、柱面等二次 曲面，依据曲面方程的特点，从起始点丌始沿邻域深度优先递归寻找符合方程的数 据点，实现了散乱数据点的自动分类。 本文按照所提出的算法及标准进行了实验研究，计算结果与实验结果有较好的 一致性，说明本文所提出的方法可以实际应用于曲面重建的数据分割过程中。 关键词 曲面重建；包围盒：八叉树；散乱点；数据点云；网格划分；三角剖分 ——II—— AbstractTile Abstract Tile Auto—Classification of Unorganized Points in Surface Reconstl‘ucfion Liu Chunming (College of Information Engineering，QingOao University,QingDao China，26607 1) Abstract Based on data cloud，which is measured from 3-coordinate measuring machine (CMM)or so，an algorithm to search topological structure from 3D unorganized points using Envelopment—box technology is proposed ill this thesis．Based on this method，we searching neighbor points of sampling point．We also improve the Max—Min angle criteria to realize local triangulation，and then get file normal of smnpling point from the triangulation．Using the normal and neighbor relationship，classification of scattered data points is realized according to the quadric surface． The typical algorithms of surface reconstruction from 3D scattered data points are introduced，and then we discuss the current surface tessellation algorithms about their adaptive range，tow efficiency．From this，we bring out Our solution． Based on the theory of space dividing using envelopment·box，all algorithm to search topological relationship from 3D unorganized points is proposed in this thesis． According to points’space position，we only go on dividing the envelopment—box that has data until reaching the precision request ill the dividing process．7由e dividing process is recorded by octree，and then we make out the rapid adjacent-field searching algoritlun using envelopment—box’S recursion feature．This algorithm Call also kick off some noise—points from the data cloud．It make the consequent process ofsurface reconstruction more convenience and precise．We use a size changeable adjacent field to describe the topological structure of 3D unorganized points in O