Gives every reachable H3 cell to the one location that reaches it quickest: a travel time catchment map with no overlaps and one territory per location. Use it to answer which of my locations is each place quickest to reach.
The tool sends one /h3 search per location. If any of them fails, the whole run fails, whatever the Robust Mode setting: a missing location would make the answer wrong rather than smaller.
| Description | |
|---|---|
| Locations | The point layer whose territories are mapped, such as stores, depots or sites |
| ID | The field identifying each location in the output |
| Travel Mode | Any of the 13 transport modes the Custom tools offer |
| Departing / Arriving | Whether journeys depart from the locations or arrive at them |
| Time Zone | The time zone the departure or arrival time is in |
| Departing / Arriving Time | The departure or arrival time |
| Travel time (in minutes) | The maximum journey time. The limit depends on the resolution, as for H3 Custom. |
| Resolution | The size of the cells, from 4 (largest) to 12 (smallest). Defaults to 8. |
| Fields To Keep [winning location] | Fields from the Locations layer to copy onto each cell, from the location that wins it |
| Output Layer | Where to save the output - must be in the project geodatabase |
The optional Transportation options, Search range, Snapping and Remove Water Bodies are described on Common parameters.
A polygon layer with one row per reachable cell:
| Field | Description |
|---|---|
Index_id | The ID of the location that reaches the cell quickest |
h3_id | The H3 cell ID |
travel_time_mean | That location's mean travel time to the cell, in seconds |
Cells no location reaches are left out. An exact tie goes to the location read first from the input layer. Each territory gets its own colour, repeating from the eleventh location on, and the tool reports how many cells each location won.