Process / pipelineHuman GeographyService and trade area analysisPipeline

Catchment Area Analysis

Also known as: Trade Area Analysis, Service Area Delineation, Market Area Analysis, Catchment Delineation

OriginatorDavid L. Huff (probabilistic formulation)Year1964Sources2Related methods6

Catchment area analysis delineates the geographic area that a facility — a shop, hospital, school, or station — actually serves, turning the abstract question of 'who uses this place?' into a mapped polygon. Methods range from the simplest fixed-radius buffer through nearest-facility (Voronoi) tessellation and network drive-time isochrones to David Huff's 1964 probabilistic model, in which patronage is shared among competing facilities by their relative attractiveness and distance. The choice of method reflects how strictly customers are tied to the nearest centre and how much competition and travel cost shape real behaviour.

Key highlights

  • Spans a graded toolkit from quick circles to behaviourally rich probability surfaces, fitting many data and question types.
  • Turns facility and population data into directly mappable, decision-ready service areas.
  • Voronoi and drive-time methods produce exhaustive, non-overlapping or network-realistic partitions of space.
  • The Huff model represents competition and shared patronage that deterministic boundaries cannot capture.

Intuition

This section is available to Pro members. Upgrade to Pro

How it works

This section is available to Pro members. Upgrade to Pro

When to use it

Use catchment area analysis whenever you need to know which population a facility serves — for retail site selection and sales forecasting, for hospital and school enrolment planning, for measuring how many people a transit stop reaches, or for assessing service coverage and gaps. Choose a fixed radius only for quick screening; use Voronoi tessellation when a clean, exhaustive partition under a nearest-centre assumption suffices; use drive-time isochrones when the road or transit network materially shapes access; and use the Huff probabilistic model when facilities compete for the same customers and patronage is shared by attractiveness and distance. It is less suitable when individual choice is driven by factors other than size and distance, or when no facility or population data are available.

Strengths & limitations

Strengths
  • Spans a graded toolkit from quick circles to behaviourally rich probability surfaces, fitting many data and question types.
  • Turns facility and population data into directly mappable, decision-ready service areas.
  • Voronoi and drive-time methods produce exhaustive, non-overlapping or network-realistic partitions of space.
  • The Huff model represents competition and shared patronage that deterministic boundaries cannot capture.
Limitations
  • Fixed-radius and Voronoi methods ignore the road network, barriers, and competition, distorting real catchments.
  • Drive-time and Huff models require detailed network and attractiveness data that may be costly to assemble.
  • All methods are sensitive to the chosen radius, threshold, or decay parameter, which strongly shape results.
  • Catchments are usually static snapshots that ignore temporal variation in travel conditions and behaviour.

Common pitfalls

This section is available to Pro members. Upgrade to Pro

Applications

This section is available to Pro members. Upgrade to Pro

Frequently asked

When should I use a Voronoi catchment versus a drive-time catchment?

Voronoi (Thiessen) catchments assume every location goes to its nearest facility measured as the crow flies and partition space into clean, non-overlapping cells, which is useful for a quick exhaustive model. Drive-time catchments instead measure reachability along the actual road or transit network within a time threshold, producing realistic, possibly overlapping service areas. Use Voronoi for a fast first cut under a nearest-centre assumption, and drive-time when the network, barriers, and real travel times matter.

How is the Huff model different from drawing a single catchment boundary?

A single boundary assigns each location entirely to one facility. The Huff model recognizes that nearby competing centres of different sizes share customers, so it assigns each location a probability of visiting each facility, proportional to that facility's attractiveness and inversely to distance. The catchment becomes a continuous probability surface rather than a hard line, letting you estimate expected market share and patronage where deterministic boundaries would oversimplify.

How does catchment area analysis relate to the two-step floating catchment area method?

Catchment area analysis defines the territory a single facility serves; the two-step floating catchment area (2SFCA) method extends this idea to measure accessibility across a whole region when supply is limited. 2SFCA floats a catchment over each service to compute a supply-to-demand ratio, then floats one over each population site to sum reachable ratios. It is essentially catchment delineation applied twice and combined with competition, and is the standard tool for measuring access to constrained services such as healthcare.

Sources

  1. 1.
    Huff, D. L. (1964). Defining and estimating a trading area. Journal of Marketing, 28(3), 34–38.
  2. 2.
    Luo, W., & Wang, F. (2003). Measures of spatial accessibility to health care in a GIS environment. Environment and Planning B, 30(6), 865–884.

You have read it. What now?

Cite this page

ScholarGate. (2026, June 22). Catchment Area Analysis. ScholarGate. https://scholargate.app/human-geography/catchment-area-analysis