Curve reconstruction from a set of unorganized points
An efficient method to approximate point cloud data in 2D plane with a smooth curve is presented. The idea of our algorithm is intuitive and simple — we divide the unorganized points into several subsets and the points in each subset are nearly on a line. Each subset is fitted by a conic. All data points are fitted by a C quadratic piecewise curve. Although presented for the 2D case, our method can be extended in a straightforward manner to fit data points by a curve in higher dimensions.
curve reconstruction unorganized points reverse engineering
HeYan Guo Feng hua
Department of Computer Science and Technology Shandong University Jinan, China
国际会议
太原
英文
262-265
2010-10-22（万方平台首次上网日期，不代表论文的发表时间）