The Filling Algorithm for Scanning Based on the Chain Structure-Reference-Cited by-同舟云学术

The Filling Algorithm for Scanning Based on the Chain Structure

Published:2011-06 Issue: Volume:267 Page:404-409
ISSN:1662-8985
Container-title:Advanced Materials Research
language:
Short-container-title:AMR

Author:

Wang Wei Qing¹

Affiliation:

1. Southwest University Rongchang Campus

Abstract

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.

Publisher

Trans Tech Publications, Ltd.

Subject

General Engineering

Link

https://www.scientific.net/AMR.267.404.pdf

Reference7 articles.

1. ZHANG Zheng-feng, MA Shao-fei, Li Wei. New regional filling algorithm based on seed [J]. Computer Engineering and Applications. 2009, 45(6): 201-206.

2. SUN Yuan-zhi, SUN Wei-hong. Path-Optimized Seed-Filling Algorithm[J]. Journal of Donghua University. 2007, 33(3): 379-381.

3. HU Yun. A Seed Filling Algorithm Based on Bit Memory[J]. Journa of Hebei North University: Natural Science Edition. 2008. 24(2): 55-58.

4. CHEN Guang-ming. A Filling Algorithm Based on Raster Display[J]. Journal of Qinghai Normal University(Natural Science Edition). 2003, (3): 59-61.

5. DougherM．A review of neural network aplied to transport[J]．Transportation Research，1996：151-166.