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
Efficient reconstruction of non-simple curves[J]. 信息与电子工程前沿(英文), 2011,12(7):523-532.
Yuan-di ZHAO, Jun-jie CAO, Zhi-xun SU, et al. Efficient reconstruction of non-simple curves[J]. Frontiers of Information Technology & Electronic Engineering, 2011, 12(7): 523-532.
Efficient reconstruction of non-simple curves[J]. 信息与电子工程前沿(英文), 2011,12(7):523-532. DOI: 10.1631/jzus.C1000308.
Yuan-di ZHAO, Jun-jie CAO, Zhi-xun SU, et al. Efficient reconstruction of non-simple curves[J]. Frontiers of Information Technology & Electronic Engineering, 2011, 12(7): 523-532. DOI: 10.1631/jzus.C1000308.
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.
关键词
Keywords
references
The trial reading is over, you can activate your VIP account to continue reading.