%0 Journal Article %T A Tracing Algorithm for Planar Curve Reconstruction from a Set of Unorganized Points
平面无序点集曲线重建的跟踪算法 %A ZHONG Gang %A YANG Xun-nian %A WANG Guo-zhao %A
钟纲 %A 杨勋年 %A 汪国昭 %J 软件学报 %D 2002 %I %X 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. %K unorganized point %K curve reconstruction %K tracing algorithm %K minimum spanning tree
无序点集 %K 曲线重建 %K 跟踪算法 %K 最小生成树 %U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=14BC50F60332AD60&yid=C3ACC247184A22C1&vid=FC0714F8D2EB605D&iid=708DD6B15D2464E8&sid=0E097192A97BABD4&eid=4AFA67525584BD90&journal_id=1000-9825&journal_name=软件学报&referenced_num=10&reference_num=13