Go home now Header Background Image
Submission Procedure
share: |
Follow us
Volume 26 / Issue 9

available in:   PDF (1 MB) PS (5 MB)
Similar Docs BibTeX   Write a comment
Links into Future


Reconstruction of Curve Networks from Unorganized Spatial Points

Shuangbu Wang (Bournemouth University, United Kingdom)

Yu Xia (Bournemouth University, United Kingdom)

Lihua You (Bournemouth University, United Kingdom)

Jianjun Zhang (Bournemouth University, United Kingdom)

Abstract: Curve network reconstruction from a set of unorganized points is an important problem in reverse engineering and computer graphics. In this paper, we propose an automatic method to extract curve segments and reconstruct curve networks from unorganized spatial points. Our proposed method divides reconstruction of curve networks into two steps: 1) detecting nodes of curve segments and 2) reconstructing curve segments. For detection of nodes of curve segments, we present a principal component analysis-based algorithm to obtain candidate nodes from unorganized spatial points and a Euclidean distance-based iterative algorithm to remove peripheral nodes and find the actual nodes. For reconstruction of curve segments, we propose an extraction algorithm to obtain the points on each of curve segments. We present quite a number of examples which use our proposed method to reconstruct curve networks from unorganized spatial points. The results demonstrate the effectiveness of our proposed method and its advantages of good automation and high reconstruction efficiency.

Keywords: curve extraction, curve network, curve reconstruction, node detection

Categories: I.3.7, J.6