TM-014Per-edge latent distance along shortest paths spikes at physical barriers

S. Kiedrzyński, M. Nowicki, M. Woliński

SourceGeometry of Geophysical Knowledge in TerraMind's Latent Space

Along a Dijkstra shortest path through a hybrid geographic and latent graph, individual edge distances track real geography. Crossing the Himalayas or leaving the Tibetan plateau appears as sharp local spikes, while movement across flat, uniform terrain remains cheaper.

Evidence
correlational
Caveat
The graph is geographically gated, so local spatial continuity is partly imposed by construction. Barrier alignment is illustrated on one South and Central Asia path without an aggregate correlation or significance test.
Model
TerraMind
Concepts
Distance preservation
Methods
GeoEx feature-plane extraction [supporting], Hybrid geo-latent graph [primary], Dijkstra shortest path [primary], UMAP [supporting], Principal component analysis [supporting]
Related findings
TM-011
Extraction
automatic-extraction