A Direct Filling Algorithm of Isogram in Complex Boundary

摘要

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.