Please wait a minute...
Front. Inform. Technol. Electron. Eng.  2011, Vol. 12 Issue (7): 523-532    DOI: 10.1631/jzus.C1000308
    
Efficient reconstruction of non-simple curves
Yuan-di Zhao1, Jun-jie Cao*,1,2, Zhi-xun Su1, Zhi-yang Li1
1 School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, China 2 State Key Laboratory of Structural Analysis for Industrial Equipment, Department of Engineering Mechanics, Dalian University of Technology, Dalian 116024, China
Download:   PDF(1233KB)
Export: BibTeX | EndNote (RIS)      

Abstract  We present a novel algorithm to reconstruct curves with self-intersections and multiple parts from unorganized strip-shaped points, which may have different local shape scales and sampling densities. We first extract an initial curve, a graph composed of polylines, to model the different structures of the points. Then a least-squares optimization is used to improve the geometric approximation. The initial curve is extracted in three steps: anisotropic farthest point sampling with an adaptable sphere, graph construction followed by non-linear region identification, and edge refinement. Our algorithm produces faithful results for points sampled from non-simple curves without pre-segmenting them. Experiments on many simulated and real data demonstrate the efficiency of our method, and more faithful curves are reconstructed compared to other existing methods.

Key wordsReverse engineering      Strip-shaped points      Curve reconstruction      Anisotropic adaptive sampling     
Received: 07 September 2010      Published: 04 July 2011
CLC:  TP391.4  
Cite this article:

Yuan-di Zhao, Jun-jie Cao, Zhi-xun Su, Zhi-yang Li. Efficient reconstruction of non-simple curves. Front. Inform. Technol. Electron. Eng., 2011, 12(7): 523-532.

URL:

http://www.zjujournals.com/xueshu/fitee/10.1631/jzus.C1000308     OR     http://www.zjujournals.com/xueshu/fitee/Y2011/V12/I7/523


Efficient reconstruction of non-simple curves

We present a novel algorithm to reconstruct curves with self-intersections and multiple parts from unorganized strip-shaped points, which may have different local shape scales and sampling densities. We first extract an initial curve, a graph composed of polylines, to model the different structures of the points. Then a least-squares optimization is used to improve the geometric approximation. The initial curve is extracted in three steps: anisotropic farthest point sampling with an adaptable sphere, graph construction followed by non-linear region identification, and edge refinement. Our algorithm produces faithful results for points sampled from non-simple curves without pre-segmenting them. Experiments on many simulated and real data demonstrate the efficiency of our method, and more faithful curves are reconstructed compared to other existing methods.

关键词: Reverse engineering,  Strip-shaped points,  Curve reconstruction,  Anisotropic adaptive sampling 
[1] Omid BUSHEHRIAN. Automatic actor-based program partitioning[J]. Front. Inform. Technol. Electron. Eng., 2010, 11(1): 45-55.