Reconstruction of Curve Networks from Unorganized Spatial Points

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