封闭区域填充的一种算法——上下扩展区向填充算法

AN ALGORITHM FOR FILLING CLOSED REGION——UP-DOWN EXPANSIBLE INTERVAL FILL ALGORITHM

本文讨论了平面任意封闭区域的填充问题,提出了上下扩展区间填充算法。它采用上、下可扩展区间两个堆栈,充分利用相邻扫描线相关原理,避免了其他算法的大量重复运算的缺点,具有快速、简明的特点。

In this paper, we discuss the problem of filling closed region and propose the up-down expansible interval fill algorithm. This algorithm uses two stacks for up and down expansible intervals and makes full use of the principle of scan line relation to avoid the inefficiency of other algorithms which do many repeated calculations.