Clustering with obstacles for Geographic
β
Vladimir Estivill-Castro; Ickjai Lee
π
Article
π
2004
π
Elsevier Science
π
English
β 381 KB
Clustering algorithms typically use the Euclidean distance. However, spatial proximity is dependent on obstacles, caused by related information in other layers of the spatial database. We present a clustering algorithm suitable for large spatial databases with obstacles. The algorithm is free of use