JUCS - Journal of Universal Computer Science 26(9): 1265-1280, doi: 10.3897/jucs.2020.065

Reconstruction of Curve Networks from Unorganized Spatial Points

Shuangbu Wang^‡, Yu Xia^‡, Lihua You^‡, Jianjun Zhang^‡

‡ Bournemouth University, Bournemouth, United Kingdom

Corresponding author: Shuangbu Wang ( swang1@bournemouth.ac.uk )

This is an open access article distributed under the terms of the Creative Commons Attribution License (CC BY-ND 4.0). This license allows reusers to copy and distribute the material in any medium or format in unadapted form only, and only so long as attribution is given to the creator. The license allows for commercial use.

Citation: Wang S, Xia Y, You L, Zhang J (2020) Reconstruction of Curve Networks from Unorganized Spatial Points. JUCS - Journal of Universal Computer Science 26(9): 1265-1280. https://doi.org/10.3897/jucs.2020.065

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 reconstruction, curve network, node detection, curve extraction