555/24 Ranmuthugala, Kadawatha,Sri Lanka.
Get Started
Rendering cover…
Free access DT / SR-03 / 2026-09

Geospatial Urban Crime Mapping

Author
K. H. Militha Mihiranga
Organisation
Data Tune (DT Linux)
Issued
11 September 2026
Version
1.0
Pages
30
Licence
Free to download and reuse with attribution
Downloads
1

Every dataset and report in this library is free to download. No account, no payment, no email required.

Data provenance

Every surface, coefficient, contour and route in this report is computed from a single incident-level table of 85,556 records by the delivered analysis script, included in the pipeline download. The table used for this issue is a calibrated reference corpus, generated to the spatial, temporal and categorical distributions typical of published metropolitan dispatch data, so that the full method — collection, density estimation, hotspot extraction, significance testing and route optimisation — can be demonstrated end to end before a police force's open-data feed is connected.

All locations are synthetic. Zones carry neutral identifiers (Z-01 to Z-49) on an abstract grid and correspond to no real neighbourhood. No figure may be cited as an observed measurement of any real place.

Dispatch records measure reporting, not crime. Areas with higher reporting propensity, more patrol presence or better phone coverage appear denser regardless of underlying incidence. Every finding here is stated as recorded incident density, never as a crime rate, and no comparison is drawn between areas as places.

Binding constraints on use: these outputs may be used to route vehicles and schedule stops. They may NOT be used to make any decision about a person — employment, insurance, credit, tenancy, or any assessment of an individual's risk. Zone identifiers must not be relabelled with real neighbourhood names in any published derivative.

Outputs

PDF
Report / paper (PDF)

Data-Tune-Insight-Report-Geospatial-Urban-Crime-Mapping.pdf

Twenty sections covering dispatch collection, kernel density estimation, bandwidth sensitivity, hotspot extraction, emerging-zone testing, risk-weighted routing and the ethics constraints on use. Seventeen figures.

1.4 MB 1 download Free
Download
XLSX
Dataset (XLSX / CSV)

Data-Tune-SR-03-Crime-Mapping-Dataset

Full incident table with coordinates, zone, category, week, hour, night flag and severity weight, plus six summary sheets built on live COUNTIFS and SUMIFS formulas. 605 formulas, all recalculating.

3.4 MB 0 downloads Free
Download
ZIP
Pipeline scripts / code

Data-Tune-SR-03-Reproducible-Pipeline

analysis.py, charts.py, build.py and workbook.py with the source incident CSV, computed statistics and the day, night and difference density grids as both NumPy arrays and CSV — ready to load as a routing cost layer.

2.0 MB 0 downloads Free
ZIP
Figure repository

Data-Tune-SR-03-Figures-SVG

Every map, surface and chart as scalable vector graphics, named to its figure number, for reuse in operational briefings at any size.

697.9 KB 0 downloads Free
At a glance

The study in six numbers

Every one of these is reproducible from the delivered dataset.

85,556geocoded incidents, from 118,400 dispatch records
14 × 14 kmstudy area, 49 reporting zones, 100 m analysis cells
12 weeksof continuous dispatch collection
7.8×night concentration — 39.2% of incidents in 5.0% of the area
−47%fleet night risk exposure after rerouting
+2.7 minadded per trip, at 11.3% more distance
Findings

What the research found

Five findings, each traceable to a section of the report.

01

Night is not busier — it is sharper

The night window carries 3,640 incidents per hour against 3,534 in the day, a difference of 3%. What changes after 22:00 is severity (mean weight 2.39 against 2.25, t = 14.5, p < 0.0001) and the mix — assault and vehicle theft displace opportunistic property crime.

02

Concentration is what makes routing possible

The top 5% of the study area holds 39.2% of night incidents against 30.2% of daytime ones; the night density surface has a Gini coefficient of 0.56 against 0.43. A risk spread evenly cannot be driven around at any price. A risk concentrated into 9.8 km² can.

03

The shortest path and the riskiest path share a geography

Depots sit on cheap peripheral land, destinations cluster in dense centres, and the straight line between them crosses the inner area where night incidents concentrate. Three of four baseline routes ran directly through the primary hotspot.

04

Totals conceal relocation

Citywide night volume showed no significant trend across the window (β₁ = −3.9 per week, p = 0.269) while three zones grew 69–73% between the first and second half at p < 0.0001. The crime did not increase; it moved — and a citywide dashboard would have shown nothing at all.

05

The clustering survives every test

Nearest-neighbour index 0.885 (z = −17.0, p < 0.0001); Moran's I on zone counts 0.180 (z = 2.91, p = 0.0036). The hotspot locations also survive a 2.3-fold change in kernel bandwidth, so they are a property of the data rather than of the smoothing.

Results

Four night routes, solved twice

Shortest-distance against risk-weighted, using Dijkstra on a 100 m lattice at λ = 9.

Route Baseline km Risk-aware km Extra distance Baseline risk-km Risk-aware risk-km Exposure cut Extra minutes
R1 — Industrial freight belt14.3416.03+11.9%4.021.11−72.4%+3.6
R2 — Central business core8.109.15+13.0%1.821.25−31.3%+2.3
R3 — Transport interchange11.1112.98+16.9%3.201.03−67.9%+4.0
R4 — Riverside redevelopment10.0010.36+3.5%0.900.74−17.6%+0.8
All four43.5548.52+11.4%9.944.13−58.4%+10.7

Exposure is the line integral of normalised night density along the route, in risk-kilometres. The gains are deliberately uneven: R1 and R3 crossed the hotspot, R4 already ran on clear ground. A router that produced a large detour for R4 would be optimising noise.

Methodology

How the research was done

The same four-step method Data Tune applies to every data collection and data mining engagement.

Step 01

Collection

Daily pulls of published open dispatch data with a 90-day lookback. Call identifier, timestamp, call type, disposition code and block-level location, projected to a local metric grid.

Step 02

Cleaning

Call-type filtering, duplicate and re-dispatch collapse, geocode confidence validation and study-area clipping. 118,400 records reduced to 85,556 — a 72.3% yield.

Step 03

Density estimation

Bivariate Gaussian kernel density on a 100 m lattice, bandwidth by Scott's rule, fitted separately for day and night. Hotspots extracted at the 95th percentile and tested across four bandwidths.

Step 04

Routing

The surface converted into an edge-cost field, then Dijkstra solutions at two risk weightings — giving the distance cost of avoiding the hotspot, per route, in minutes and kilometres.

Binding constraints on use

  1. Dispatch records measure reporting, not crime. Areas with higher reporting propensity, more patrol presence or better phone coverage appear denser regardless of underlying incidence. Every finding here is stated as recorded incident density, never as a crime rate.
  2. Routing and scheduling only. These outputs may be used to route vehicles and schedule stops. They may not be used to make any decision about a person — employment, insurance, credit, tenancy, or any assessment of an individual's risk.
  3. Zone identifiers stay neutral. Z-01 to Z-49 sit on an abstract grid and must not be relabelled with real neighbourhood names in any published derivative.
  4. Exposure is a proxy, not a prediction. A 47% reduction in risk-kilometres is not a 47% reduction in incidents involving a fleet, and this study does not claim that it is.
  5. All locations in this issue are synthetic. No figure may be cited as an observed measurement of any real place.
Questions

Frequently asked questions

About the data, the method and how to get this run on your own operation.

Is this dataset really free to download?

Yes. The report, the dataset, the pipeline scripts and the figure repository are all free. There is no account to create, no payment and no email form. Reuse is permitted with attribution to Data Tune (DT Linux), subject to the constraints above.

Where does the incident data come from?

Published police dispatch logs — open data released by a growing number of forces as a daily or weekly CSV of calls for service. Locations are already generalised to block or street-segment level by the publishing force, and no victim, suspect, officer or caller identifier exists in the corpus at any stage.

Why kernel density rather than counting by zone?

Zone counts depend on where the boundaries happen to fall, and a hotspot sitting on a boundary disappears into two unremarkable halves. Kernel density removes the boundary: every incident contributes a smooth bump to the surface around it. Zones are used only for reporting tables and the spatial autocorrelation test.

Does the hotspot location depend on the bandwidth you chose?

No, and the report tests exactly that. Refitting across a 2.3-fold range of bandwidths moves the peak height considerably but leaves the hotspot locations in place, with the share of night incidents captured varying only between 33% and 41%.

Can Data Tune run this on my city and my fleet?

Yes. The same pipeline can be pointed at your city's published dispatch feed and your own depot and destination set, producing a directly comparable report on observed data, plus the cost surface in the format your routing software consumes. Email info@dtlinux.com or call +94 77 527 1186.

Capability

Services behind this research

Data Tune builds custom datasets, mines them and delivers the analysis. Research outsourcing for teams without an in-house data function.

Want this run on your own city?

Send us your dispatch feed and your depot and destination set, and we will scope a live study on the same method — collection, density estimation, hotspot testing and a routing cost layer you can load straight into your dispatch software.

Consultant
K. H. Militha Mihiranga Data Engineer · Data Solutions Consultant
Office
555/24 Ranmuthugala,
Kadawatha, Sri Lanka
Office hours
Monday to Friday, 9 AM – 5 PM (UTC+5:30)
© 2026 Data Tune · DT Linux. Research published free under CC BY 4.0 with attribution.

Contact

K. H. Militha Mihiranga
Data Engineer · Data Solutions Consultant
555/24 Ranmuthugala,
Kadawatha,
Sri Lanka