首页 | 本学科首页   官方微博 | 高级检索  
     

平面无序点集曲线重建的跟踪算法
引用本文:钟纲,杨勋年,汪国昭.平面无序点集曲线重建的跟踪算法[J].软件学报,2002,13(11):2188-2193.
作者姓名:钟纲  杨勋年  汪国昭
作者单位:浙江大学,计算机图像图形研究所,浙江,杭州,310027;浙江大学,数学系,浙江,杭州,310027
基金项目:国家自然科学基金资助项目(19971079);国家重点基础研究发展规划973资助项目(G1998030600)
摘    要:由无序离散点集重建出曲线曲面模型,在反求工程与计算机视觉中都有着广泛的应用.根据实际采样中离散点分布相对集中的特点,给出了一个用简单曲线拟合平面上的无序点集的跟踪算法.该方法仅从当前跟踪点的邻近点集与曲线重建光顺准则出发,无须迭代,可快速、有效地跟踪得到无序点集的一个中轴点列,最后再由此点列拟合出参数曲线.实验结果表明,该方法是一个简单、有效的曲线重建方法.

关 键 词:无序点集  曲线重建  跟踪算法  最小生成树
文章编号:1000-9825/2002/13(11)2188-06
收稿时间:2001/4/13 0:00:00
修稿时间:2001年4月13日

A Tracing Algorithm for Planar Curve Reconstruction from a Set of Unorganized Points
ZHONG Gang,YANG Xun-nian and WANG Guo-zhao.A Tracing Algorithm for Planar Curve Reconstruction from a Set of Unorganized Points[J].Journal of Software,2002,13(11):2188-2193.
Authors:ZHONG Gang  YANG Xun-nian and 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.
Keywords:unorganized point  curve reconstruction  tracing algorithm  minimum spanning tree
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号