The Filling Algorithm for Scanning Based on the Chain Structure

Wei Qing Wang

doi:10.4028/www.scientific.net/AMR.267.404

Paper Titles

Slip Pridiction Based Path Planning for Planetary Rovers
p.382

A Document Feature Extraction Method Based on Concept-Word List
p.386

An Overview of P2P Search Algorithms
p.393

Application and Research of Data Acquisition Based on Database Technology of LabVIEW
p.398

The Filling Algorithm for Scanning Based on the Chain Structure
p.404

A Computer Software on Diffusion in Solid
p.410

An Algorithm to Eliminate Stochastic Jump Measurements of Ultrasonic Flow-Meter with Time Difference Method
p.414

Numerical Method of Hybrid Stochastic Functional Differential Equations with the Local Lipschitz Coefficients
p.422

A Discrete Data Fitting Models Fusing Genetic Algorithm
p.427

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 267The Filling Algorithm for Scanning Based on the...

The Filling Algorithm for Scanning Based on the Chain Structure

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.

You might also be interested in these eBooks

Manufacturing Systems and Industry Application

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 267)

Pages:

404-409

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.267.404

Citation:

Cite this paper

Online since:

June 2011

Authors:

Wei Qing Wang

Keywords:

Algorithm (GA), Data Structure, Scanning Chain, Scanning Line

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[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.

Google Scholar

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

Google Scholar

[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.

Google Scholar

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

Google Scholar

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

Google Scholar

[6] Smith B L，Demetsky M J．Trafic flow forecasting：comparison of modeling approaches[J]joumal of Transportation Engineering，1997：261-266.

Google Scholar

[7] Fayyad U M，IraniK B．On the handling of continuous valued attributes in decision tree generation[J]．Machine Learning，1992，8：87—102.

DOI: 10.1007/bf00994007

Google Scholar