Curve reconstruction from unorganized points

Research output: Contribution to journalArticle

185 Citations (Scopus)

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

Fingerprint

Curve Reconstruction
Moving Least Squares
Point Cloud
Curve
Surface reconstruction
Refining
Self-intersection
Surface Reconstruction
Thinning
Pipe
Minimum Spanning Tree
Reconstruction Algorithm
Least Square Method
Best Approximation
Point Sets
Set of points
Euclidean
Iteration

All Science Journal Classification (ASJC) codes

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

Cite this

@article{112ee3acd9834d438fd8d6f471373ad3,
title = "Curve reconstruction from unorganized points",
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.",
author = "Lee, {In Kwon}",
year = "2000",
month = "1",
day = "1",
doi = "10.1016/S0167-8396(99)00044-8",
language = "English",
volume = "17",
pages = "161--177",
journal = "Computer Aided Geometric Design",
issn = "0167-8396",
publisher = "Elsevier",
number = "2",

}

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 journalArticle

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 -