Patches and boundaries

Multivariate data may be condensed into spatially-constrained clusters. These may be displayed on maps, using different colours or shades. The present Section explains how clustering algorithms can be constrained to produce groups of spatially contiguous sites; study of the boundaries between homogeneous zones is also discussed. Prior to clustering, one must state unambiguously which sites are neighbours in space; the most common solutions to this are presented in Subsection 1.

(a) Rectangular grid, rook connection

(b) Rectangular grid, bishop connection

(b) Rectangular grid, bishop connection

(c) Rectangular grid, king (or queen) connection

(f) Hollow grid, rook connection

(d) Staggered rows, six neighbours

(d) Staggered rows, six neighbours

(e) Staggered rows, eight neighbours

(f) Hollow grid, rook connection

Figure 13.19 Connecting schemes for regular grids of points. See text.

Was this article helpful?

0 0

Post a comment