| 摘要 |
PURPOSE:To obtain an optimum polygonal line approximation in response to a simple drawing or complicated drawing by deciding automatically and optimizingly the number of selected sequences of points depending on the length of a polygonal line to obtain the polygonal line approximation by the selected sequence of points of the optimum number of pieces. CONSTITUTION:A means 1 inputting a drawing samples an input drawing at a prescribed interval, the pre-processing means 2 processes approximating point at prescribed intervals for thinning out, and the sequence of points are inputted to a memory 3 of the sequence of points P. The distance relating to the maximum length of a curve is stored in a register 4 storing the length of the curve. The sequence of points of the memory 3 is inputted to a means 5 solving a recurrence formula, the length of the polygonal line is calculated sequentially and stored in a memory 6 storing the value of l(i,j). Further, a function selecting a maximum value of the recurence formula is stored in a memory 7 storing the process of selection of the recurrence formula from the means 5. Then, comparing means 9, 10 and the means 5 decide optimizingly the number of selected sequences of points based on the distance of the maximum length of the polygonal line and the value of the l(i,j) in the register 4 and the memory 6 and obtain the polygonal line approximation of the selected sequence of points of the number of pieces. |
