一种基于行列法离散点边界搜索算法

Boundary searching algorithm for discrete points based on rows and columns method

平面上构建离散点的边界在地理信息系统(GIS)中应用广泛,提出了基于行列法的平面离散点边界搜索的新算法,目的是解决平面离散点边界问题,通过确定步长大小,按步长对离散点分别进行行搜索和列搜索,得到离散点的边界曲线,介绍了行列边界算法的基本思想和实现过程。该算法能够正确地搜索包含凹凸特征的离散点边界,与传统边界生成算法相比,它具有通用、实现简单等特点。该算法在油田GIS领域边界划分中得到了很好的应用,能够准确地构建油田边界。

Boundary of discrete points is widely used in geographic information system（GIS）.This paper proposed a new boundary searching algorithm based on rows and columns method of discrete points,in order to solve the problem of the discrete points＇boundary.Introduced the basic idea of the rows and columns of the boundary algorithm and its implementation process.By determining the size of step,searched discrete points by their rows and columns by step,then obtained the boundary curve.This algorithm had been extended to resolve the discrete points which included concave point or hole,compared with the traditional boundary algorithm,which had a strong universal,simple and so on.The algorithm has been well applied to the oil field of GIS border determined,which can build an accurate oil field boundary.