Jump to content

Point pattern analysis

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Ldecola (talk | contribs) at 18:19, 28 September 2011 (Point Pattern Analysis: Updated image permission. Added some text.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Lee De Cola's Wikipedia page.

Point Pattern Analysis

PPA is the study of the spatial arrangements of points in (usually 2-dimensional) space[1]. The simplest formulation is a set X = {x in D} where D is a subset of Rn, an coordinate system.

Four point patterns

Description

The easiest way to visualize a 2-D point pattern is a map of the locations, which is simply a scatterplot but with the provision that the axes are equally scaled. If D is not the boundary of the map then it should also be indicated.

Modeling

The null model for point patterns is complete spatial randomness, modeled as a Poisson process in Rn, which implies that the number of points in any arbitrary region A in D will be proportional to the area of A.

Inference

A fundamental problem of PPA is inferring whether a given arrangement is merely random or the result of some process. The picture illustrates patterns of 256 points using four point processes. The clustered process results in all points having the same location.

Citations

References

  1. ^ Getis and Boots

Cressie, N. A. C. and C. K. Wikle (2011) Statistics for spatio-temporal data. Hoboken, N.J., Wiley. ISBN 9780471692744