Curve reconstruction from unorganized points

In Kwon Lee

doi:10.1016/S0167-8396(99)00044-8

Curve reconstruction from unorganized points

In Kwon Lee

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

197 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 language	English
Pages (from-to)	161-177
Number of pages	17
Journal	Computer Aided Geometric Design
Volume	17
Issue number	2
DOIs	https://doi.org/10.1016/S0167-8396(99)00044-8
Publication status	Published - 2000 Feb

Bibliographical note

Funding 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

Access to Document

10.1016/S0167-8396(99)00044-8

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

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}",

note = "Funding Information: reviewers{\textquoteright} 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.",

year = "2000",

month = feb,

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",

}

TY - JOUR

T1 - Curve reconstruction from unorganized points

AU - Lee, In Kwon

N1 - Funding 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.

PY - 2000/2

Y1 - 2000/2

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 -