The Filling Algorithm for Scanning Based on the Chain Structure

Abstract:

Article Preview

By using the thought of Bresenham algorithm for drawing a line, it can generate basic graphics, at the same time it can create a regional point of scanning lines. According to the regional point of scanning lines it can be filled directly. It does not judge and calculate of the other pixels within the region. The time complexity of the algorithm has been markedly improved, at the same time, in the process of filling a polygon it only stores the coordinates of boundary points and the coordinates of regional points, and it does not store other pixels within the region. It only needs a small storage space, so its space complexity is also increased.

Info:

Periodical:

Edited by:

Yanwen Wu

Pages:

404-409

DOI:

10.4028/www.scientific.net/AMR.267.404

Citation:

W. Q. Wang "The Filling Algorithm for Scanning Based on the Chain Structure", Advanced Materials Research, Vol. 267, pp. 404-409, 2011

Online since:

June 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.