A Minimal Spanning Tree Algorithm Applied to Spatial Cluster Analysis

Many applications, such as geographical regionalization and communication network districting, have problems that can be formulated as the clustering of n objects with contiguity constraints. In this paper, we present an algorithm based on recursive partitioning of a minimal spanning tree and a tool implementing it named SKATER. We also present some simulations where SKATER has been successfully used.