复杂多边形区域边界搜索算法的研究

A Study of Borderline Search about Polygonal Region

首先分析了经典的区域填充算法的两个问题。在此基础上,借鉴种子填充算法的一些思想,提出了一种针对任意复杂多边形区域的搜索算法,该算法克服了传统算法的一些缺陷,可以满足实际编程需要。

The paper analyzes two questions of the classical region filling algorithm, Based on the seed filling algorithm, we put forward a borderline search algorithm for complex polygonal region, which gets over disadvantages of the traditional algorithm and satisfies the demand of programming.