树结构及其在多边形内点匹配中的应用

Tree Structure and It's Application in Matching for Inner Points in Polygon

通过改变矢量多边形数据的存储结构,建立多边形内点匹配搜索树,根据搜索树的逻辑思维方式,提出一种多边形内点匹配程序的设计方法。应用这种方法,可减少内点匹配的时间。

By changing the structure of vetctor polygon data, this paper builds the search tree of matching for points in polygon. According to the search tree, a new program designing method of matching for points in ploygon is presented. It decreases the time of matching.