Study On The Boundary Detection Between Grid Sets Based On The Discrete Grid Space

This paper presents the construction and some properties of grid space include how to classify the sets in this space and some method to get the boundary of one grid set. Then put forward a method to get the common boundary between two grid sets, which make use of the testing of its connectivity between two adjacent grids, and give its implementation by MATLAB. At the end of this paper, a proof procedure shows this algorithm will ended in finite steps and both time and space complexity of this algorithm are O(mn) when the sizes of the two sets are m and n respectively.