Reconstruction of curve networks from unorganized spatial points
Authors: Wang, S., Xia, Y., You, L. and Zhang, J.
Journal: Journal of Universal Computer Science
Volume: 26
Issue: 9
Pages: 1265-1280
eISSN: 0948-6968
ISSN: 0948-695X
DOI: 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.
https://eprints.bournemouth.ac.uk/35005/
Source: Scopus
Reconstruction of Curve Networks from Unorganized Spatial Points
Authors: Wang, S., Xia, Y., You, L. and Zhang, J.
Journal: JOURNAL OF UNIVERSAL COMPUTER SCIENCE
Volume: 26
Issue: 9
Pages: 1265-1280
ISSN: 0948-695X
https://eprints.bournemouth.ac.uk/35005/
Source: Web of Science (Lite)
Reconstruction of Curve Networks from Unorganized Spatial Points
Authors: Wang, S., Xia, Y., You, L. and Zhang, J.
Journal: Journal of Universal Computer Science (J.UCS)
Volume: 26
Issue: 9
Pages: 1265-1280
ISSN: 0948-695X
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.
https://eprints.bournemouth.ac.uk/35005/
Source: BURO EPrints