摘要
在计算机图形学的专著或译著中 ,所给出的种子填充算法 (本文称为纵向搜索算法 ) ,需占用较大的存储空间。本文给出一种改进的新算法 (称为横向搜索算法 ) ,具有较小的存储空间 。
In the computer graphics monographs and translated texts,discussions about a filling algorithm with seed (called as forward search algorithm)have been found,but which needs to have a larger memory space.In this paper an improved algorithm(called as sideward search algorithm)is given and an algorithm analysis is discussed.
出处
《计算机应用与软件》
CSCD
北大核心
2004年第4期84-85,共2页
Computer Applications and Software
