摘要
在此提出两种对递归种子填充算法的改进算法,在该算法中使用链队列而不是递归,而且采用先填充后入队列,减少了很多不必要的操作,使得改进后的算法无论是时间还是空间效率都远远优于递归种子填充算法,而且也可以填充任意大小、任意复杂边界的区域.
Two improved methods to recursion seed filling algorithm were put forward.Instead of recursion,using link queue with first filling and secondaryly entering queue in the methods,it reduced many unnecessary operations.The improved methods are more prior to recursion seed filling algorithm not only in temporal but also in spatial efficiency.
出处
《广西师范大学学报（自然科学版）》
CAS
2003年第3期30-33,共4页
Journal of Guangxi Normal University:Natural Science Edition
