A computational approach for the analysis of changes in polygon distributions

Abstract.

 This paper develops a computational method for analyzing changes in polygon distributions. Unmovable polygons that change discontinuously without explicit functional linkage information are discussed. Six types of primitive events are used to describe the change: 1) generation, 2) disappearance, 3) expansion, 4) shrinkage, 5) union, and 6) division. The change of polygon distributions is decomposed into a combination of these events. A computational procedure for deducing a set of events from polygon distributions of two times is proposed. The method is applied to the analysis of the spatial competition between the major and small chains of convenience stores in Tokyo, Japan. Some empirical findings are shown.