全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
软件学报  2002 

A Tracing Algorithm for Planar Curve Reconstruction from a Set of Unorganized Points
平面无序点集曲线重建的跟踪算法

Keywords: unorganized point,curve reconstruction,tracing algorithm,minimum spanning tree
无序点集
,曲线重建,跟踪算法,最小生成树

Full-Text   Cite this paper   Add to My Lib

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.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133