Browse Prior Art Database

# Fast Vector Generator for Line-Approximation Obtained by Splitting Line Segment

IP.com Disclosure Number: IPCOM000101648D
Original Publication Date: 1990-Aug-01
Included in the Prior Art Database: 2005-Mar-16
Document File: 2 page(s) / 46K

IBM

## Related People

Minakata, H: AUTHOR [+1]

## Abstract

Disclosed is an algorithm for fast line-approximation in raster- to-vector conversion.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 90% of the total text.

Fast Vector Generator for Line-Approximation Obtained by Splitting Line Segment

Disclosed is an algorithm for fast line-approximation in
raster- to-vector conversion.

In conventinal line-approximation, the distance between each
point (A) and the segment that consists of the initial point (B) and
the final point (C) (see Fig. 1) is compared with a threshold. If it
is greater than the threshold, then all points between the initial
point and the final point are replaced by a line segment. If not, all
points are held and the number of recursive calculations is
increased, and as a result, the processing time is increased. This
problem is prominent in lines that contain long straight line
segments.

The method described restricts the amount of calculation
without increasing the number of the points beyond a certain limit.

If the target line segment consists of 'm' points, it is split
into sub-segments each consisting of 'n' points (see Fig. 2).

If the distance is within the threshold in a sub-segment, all
points are represented by the final point, since they are on the
straight line. In this way, the number of iterations is decreased.
Floating point calculation is not needed to obtain the distance in a
short sub-segment area, so the calculation time is less.

The system has the following two features:
1. By splitting the line segments into sub-segments, the amount of
recursive calculation is reduced.
2. Higher perfo...