【作者】 王平； 刘轩昊； 陈效群；

【Author】 Wang Ping~(1,2),Liu Xuan-Hao~1,Chen Xiao-Qun 1(Department of Mathematics,University of Science and Technology of China,Hefei,Anhui 230026, China) 2(Department of Mathematics,Suzhou University Suzhou,Jiangsu 215006,China)

【机构】 中国科学技术大学数学系； 苏州大学 数学系；

【摘要】 散乱点集进行曲线重建时的关键步骤是参数化。本文提出一种对平面上有噪音散乱点集进行参数化的算法。在算法中,首先求出点集Delaunay三角化的最小生成树,继而对最小生成树的最长路径进行参数化。通过把其它点投影到最长路径上,对最长路径以外的点进行参数化。本文还给出了提高参数化的精度的方法。以圆盘控制顶点B样条拟合为例展示了该算法的应用。更多还原

【Abstract】 Parameterization is a crucial step in curve reconstruction from unorganized points.In this paper, an algorithm to parameterize planar unorganized points with noise is described.In the algorithm,the minimum spanning tree of the Delaunay triangulation of the points is constructed at first.Then the longest path of the minimum spanning tree is parameterized. Finally,the other points which are not on the longest path are parametrized by projecting them onto the longest path.Some procedures are discussed to improve the accuracy of the algorithm.As an application,an example of disk B-spline fitting is provided.更多还原