An algorithm for segmenting a feature set into equitable regions

Abstract

A set of geographic features of the same class representing a geographic area is often required to be divided in to several subsets/regions so that the sum of a numeric attribute of the features in each subset/region remains almost equal and the bounding polygon of regions do not overlap with each other. This kind of non-overlapping regions formation with similar collective feature value is of great importance especially in the field of optimization and spatial decision support. The paper presents a novel algorithm to solve the above mentioned spatial analysis work. The algorithm is further implemented, tested and the results are discussed.