This thesis centers on the issue of surface reconstruction in graph division, parameterization and construction from unorganized points, contour points and triangle meshes.
本文针对散乱点、截面线点和三角网格构造曲面的问题,通过研究解决反求工程中的图形分割、参数化处理和曲面拼接三个部分的问题,给出了这三种数据的曲面重构算法。
A sorting algorithm for section data point is proposed,first the minimum enclosed polygon is built,then the data points is inserted into the polygon according to minimum length increase principle,a new polygon containing all data points is formed.
提出一种截面线数据点排序算法,该算法计算截面线数据点的最小包围多边形,将截面线数据点依据边长差最小原则插入到最小包围多边形中,形成包含所有数据点的多边形,顺序连接该多边形各顶点,实现对截面线数据点的排序。
