List of the available spatial analysis tools in CartAGen

A list, not exhaustive yet, of the spatial analysis and data enrichment algorithms available in CartAGen platform. Spatial analysis is necessary to generalize a map as it enables the adaptation of the process to the characters of map features. It also enables the enrichment of the dataset with geographic features that were implicit in the input dataset (e.g. roundabouts are only round road sections with no specific semantics in most geographical datasets).

Road network enrichment

Algorithm name Reference Code
Roundabouts (Touya 2010) 16
dual carriageways (Touya 2010) 17
branching crossroads (Touya 2010) 16
simple crossroads (Touya 2010) 16
rest areas (Touya 2010) not yet implemented
highway interchange (Touya 2010) 17
strokes (Thomson & Richardson 1999) 19
dead end zoning (Duchêne et al. 2012) 21

Building measures (for individual buildings and building groups/blocks)

Algorithm name Reference Code
Compactness MacEachren 1985 28
Orientation Duchêne et al. 2003 36
Elongation AGENT project 37
Convexity AGENT project 37
Squareness Lokhat & Touya 2016 29
Block density AGENT project 34
Building classification (Steiniger et al. 2004) 33
Corner buildings Taillandier 2008 30
Empty spaces in blocks Gaffuri & Trévisan 2004 31
Congestion AGENT project 32
Building alignments Renard & Duchêne 2014 35

Geographic spaces from CollaGen (but can be used in other cases)

Algorithm name Reference Code
Urban areas (Touya 2010) UrbanAreas
Mountain areas (Touya 2010) MountainAreas
Rural areas (Touya 2010) RuralAreas
Coastal areas (Touya 2010) CoastalAreas

Other algorithms

Algorithm name Reference Code
Line characterisation (Plazanet 1995) or (Buttenfield 1991) 25
Line coalescence (Mustière 1998) 23
Landmarks (Touya & Dumont 2017) 22
Other network enrichments