A Direct Filling Algorithm of Isogram in Complex Boundary

DOI

10.2991/iccia.2012.194How to use a DOI?

Keywords

isogram, complex boundary, scanning line, filling, algorithm

Abstract

On basis of summarizing the existing isogram filling algorithm, this paper puts forwards a direct filling algorithm of isogram in complex boundary. Compared with the point-by-point scanning method and algorithm of area filling, this new algorithm has no necessity not only in point-by-point calculation of interpolation, but also in tracing inclusion relation between equivalent areas and determination areas, which makes filling speed faster. It is proved with practice that the new method can fill isopleth map in milliseconds.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Linna Huang
AU  - Guangzhong Liu
PY  - 2014/05
DA  - 2014/05
TI  - A Direct Filling Algorithm of Isogram in Complex Boundary
BT  - Proceedings of the 2012 2nd International Conference on Computer and Information Application (ICCIA 2012)
PB  - Atlantis Press
SP  - 804
EP  - 806
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccia.2012.194
DO  - 10.2991/iccia.2012.194
ID  - Huang2014/05
ER  -