## Curve reconstruction from unorganized points (2000)

### Cached

### Download Links

- [visualcomputing.yonsei.ac.kr]
- [www.cgvr.postech.ac.kr]
- [www.geometrie.tuwien.ac.at]
- DBLP

### Other Repositories/Bibliography

Venue: | Computer Aided Geometric Design |

Citations: | 48 - 3 self |

### BibTeX

@ARTICLE{Lee00curvereconstruction,

author = {In-kwon Lee},

title = {Curve reconstruction from unorganized points},

journal = {Computer Aided Geometric Design},

year = {2000},

volume = {17},

pages = {161--177}

}

### Years of Citing Articles

### OpenURL

### 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.