Tutorial series · 2 parts

Point pattern analysis in Python

Ask whether points are clustered, dispersed or random, then show where they concentrate. The series covers point pattern statistics and kernel density estimation in Python.

Level
Intermediate
Parts
2, all published
Reading time
About 33 minutes

Start with part 1: Point pattern analysis in Python: quadrats, nearest neighbour and Ripley's K on Camden's street trees

The parts, in order

  1. Part 1 Intermediate 17 min read

    Point pattern analysis in Python: quadrats, nearest neighbour and Ripley's K on Camden's street trees

    Test whether points are clustered with point pattern analysis in Python: a quadrat chi-squared test, the Clark-Evans nearest-neighbour index and Ripley's G, F, K and L functions with Monte Carlo CSR envelopes, edge correction, a global MAD test and a random-labelling null, on 3,292 London plane trees in Camden.

  2. Part 2 Intermediate 16 min read

    Kernel density estimation in Python for GIS: bandwidths, GeoTIFF heatmaps and relative risk

    Make a kernel density heatmap from points in Python: compare Scott/Silverman, likelihood cross-validation and a fixed planning distance, Gaussian and Epanechnikov kernels and sample weights, export an edge-corrected GeoTIFF with rasterio, show it on a basemap, and map case-control relative risk on Camden's London plane trees.

All tutorial series