关键词: 曲线重建, 成长型神经网络, 散乱点

Abstract: The study of curve reconstruction based on unorganized data points has great importance in reverse engineering. Curve can be reconstructed with line segment Approximation. The paper presents a new algorithm based on growing cell structures to realize curve reconstruction using line segment.Given a set of unorganized data points and an initial polygonal line, the vertex position of polygonal line can be optimized by using the algorithm to make the vertexes of polygonal line gradually approach the given unorganized data points. In order to make the vertexes of polygonal line distribution coincide the space distribution of unorganized data points, the vertexes which are very active are split and which are least active are deleted continually. Experiment results are given which show that the new algorithm is quite effective.

Key words: curve reconstruction, growing cell structures, unorganized data points