摘要 |
The process searches a block that contains a current line segment for any other line segments and, if they are found, calculates a distance between an endpoint of the current line segment and endpoint nodes of all the line segments found in the block. The process sequentially searches for the line segments in the block in accordance with search order determined on the basis of a search ranking table if a search range is not crossed over and calculates the distances between the endpoint of the current line segment and the endpoint nodes of the found line segments. Then, the process compares the distance from the endpoint node of the already line segment found and the distance from the newly found endpoint node and outputs the smaller one as the next line segment.
|