Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 161-177 |
| Number of pages | 17 |
| Journal | Computer Aided Geometric Design |
| Volume | 17 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2000 Jan 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Modelling and Simulation
- Automotive Engineering
- Aerospace Engineering
- Computer Graphics and Computer-Aided Design
Cite this
}
Curve reconstruction from unorganized points. / Lee, In Kwon.
In: Computer Aided Geometric Design, Vol. 17, No. 2, 01.01.2000, p. 161-177.Research output: Contribution to journal › Article
TY - JOUR
T1 - Curve reconstruction from unorganized points
AU - Lee, In Kwon
PY - 2000/1/1
Y1 - 2000/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0034140528&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0034140528&partnerID=8YFLogxK
U2 - 10.1016/S0167-8396(99)00044-8
DO - 10.1016/S0167-8396(99)00044-8
M3 - Article
AN - SCOPUS:0034140528
VL - 17
SP - 161
EP - 177
JO - Computer Aided Geometric Design
JF - Computer Aided Geometric Design
SN - 0167-8396
IS - 2
ER -