Curve reconstruction from unorganized points

Research output: Contribution to journalArticle

191 Citations (Scopus)


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 languageEnglish
Pages (from-to)161-177
Number of pages17
JournalComputer Aided Geometric Design
Issue number2
Publication statusPublished - 2000 Feb

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Automotive Engineering
  • Aerospace Engineering
  • Computer Graphics and Computer-Aided Design

Fingerprint Dive into the research topics of 'Curve reconstruction from unorganized points'. Together they form a unique fingerprint.

  • Cite this