We present an algorithm to approximate a set of unorganized points with a simple curve without self-intersections. The moving least-squares method has a good ability to reduce a point cloud to a thin curve-like shape which is a near-best approximation of the point set. In this paper, an improved moving least-squares technique is suggested using Euclidean minimum spanning tree, region expansion and refining iteration. After thinning a given point cloud using the improved moving least-squares technique we can easily reconstruct a smooth curve. As an application, a pipe surface reconstruction algorithm is presented.
Bibliographical noteFunding Information:
reviewers’ comments are gratefully acknowledged. Much of this work was done while the author stayed at the Institute of Geometry, Vienna University of Technology, Austria. The research was supported in part by the Korea Science and Engineering Foundation (KOSEF) through its overseas postdoctoral fellowship program in the second half of the year 1997 and by grant No. 2UD99520 of the POSTECH Information Research Laboratories.
All Science Journal Classification (ASJC) codes
- Modelling and Simulation
- Automotive Engineering
- Aerospace Engineering
- Computer Graphics and Computer-Aided Design