摘要 |
PROBLEM TO BE SOLVED: To quickly approximate a line segment. SOLUTION: In this line-segment approximating method for approximating the N number of connected coordinate point sequences A= (x[i], y[i])|i=1,..., N} within a two-dimensional integer grating treated univalently as one- dimensional chain, by a line segment sequence using a subset B= (Vx [i], Vy [i])|i=1,..., r} of the coordinate point sequence A as a vertex sequence, a threshold value v is preliminarily determined, and the approximation vertex sequence B is determined to make a length of the each line segment exceed slightly the threshold value v, in the each line segment for forming the vertex sequence B.
|