| 本文已被：浏览 4297次 下载 6820次 |
码上扫一扫！ |
|
|
| 平面无序点集曲线重建的跟踪算法 |
|
钟纲1,2, 杨勋年1,2, 汪国昭1,2
|
|
1.浙江大学,计算机图像图形研究所,浙江,杭州,310027;2.浙江大学,数学系,浙江,杭州,310027
|
|
| 摘要: |
| 由无序离散点集重建出曲线曲面模型,在反求工程与计算机视觉中都有着广泛的应用.根据实际采样中离散点分布相对集中的特点,给出了一个用简单曲线拟合平面上的无序点集的跟踪算法.该方法仅从当前跟踪点的邻近点集与曲线重建光顺准则出发,无须迭代,可快速、有效地跟踪得到无序点集的一个中轴点列,最后再由此点列拟合出参数曲线.实验结果表明,该方法是一个简单、有效的曲线重建方法. |
| 关键词: 无序点集 曲线重建 跟踪算法 最小生成树 |
| DOI： |
| 分类号: |
| 基金项目:国家自然科学基金资助项目(19971079);国家重点基础研究发展规划973资助项目(G1998030600) |
|
| A Tracing Algorithm for Planar Curve Reconstruction from a Set of Unorganized Points |
|
ZHONG Gang,YANG Xun-nian,WANG Guo-zhao
|
| Abstract: |
| Curve reconstruction from a set of unorganized points plays an important role in the fields of reverse engineering and computer vision. In this paper, a new tracing algorithm is presented for planar curve reconstruction based on the regular distribution property of the point set. The following central point within a small local region of current tracing point can be obtained based on the influence of neighboring points as well as the smoothness and fairness principle. Finally, a sequential of central points can be traced out efficiently without any iteration and a parametric curve can be reconstructed by interpolating the central points. The experimental results show that the tracing algorithm is an efficient method for curve reconstruction. |
| Key words: unorganized point curve reconstruction tracing algorithm minimum spanning tree |
