Kotagede

Yogyakarta · Kampung kota

The sixteenth-century Mataram core, now dense settlement; its lanes are older than the roads around them.

Drive

34.9 km · 175 intersections/km²

Fig. 1 · r = 800 m — The drivable network inside the sampling disc. Uniform ink, no road-class hierarchy, no basemap: the shape is the subject.

Drive H 2.971 · φ 0.48

Walk

58.6 km · 398 intersections/km²

Fig. 2 · r = 800 m — The walkable network at the same centre, the same disc, the same extract. Every difference from the drawing beside it is the tag mapping, not a different place.

Walk H 2.929 · φ 0.51

Delta

+23.7

km of network reachable only on foot · 40.4% of the walking network

+224
intersections per km²: −8.8%
Dead-end: −0.042
ΔH · orientation entropy

Both roses overlaid

Drive H 2.971 · φ 0.48Walk H 2.929 · φ 0.51

Drive
Walk
Both

Two readings, one table

Hairlines: every site in the set, both modes. Marks: this site. A position, not a value — neither end is better.

Kotagede: driving and walking network metrics, their difference, and their position among 33 sites.
Metric	Drive	Walk	Delta	Position among 33 sites
Orientation entropynat	2.971	2.929	−0.042	Drive: position 9 of 33; Walk: position 7 of 33, when the set is sorted by this metric, smallest first.
H / H max	0.829	0.817	−0.012	Drive: position 9 of 33; Walk: position 7 of 33, when the set is sorted by this metric, smallest first.
φ orientation-order	0.480	0.507	+0.027	Drive: position 25 of 33; Walk: position 27 of 33, when the set is sorted by this metric, smallest first.
Circuitysampled	1.698	1.390	−0.308	Drive: position 29 of 33; Walk: position 8 of 33, when the set is sorted by this metric, smallest first.
Average node degree	2.21	2.42	+0.21	Drive: position 7 of 33; Walk: position 19 of 33, when the set is sorted by this metric, smallest first.
Four-way	3.9%	5.7%	+1.9%	Drive: position 9 of 33; Walk: position 10 of 33, when the set is sorted by this metric, smallest first.
Dead-end	34.9%	26.1%	−8.8%	Drive: position 25 of 33; Walk: position 18 of 33, when the set is sorted by this metric, smallest first.
Intersection density	175 /km²	398 /km²	+224 /km²	Drive: position 20 of 33; Walk: position 31 of 33, when the set is sorted by this metric, smallest first.
Median segment length	36 m	31 m	−5 m	Drive: position 16 of 33; Walk: position 16 of 33, when the set is sorted by this metric, smallest first.
Network length	34.9 km	58.6 km	+23.7 km	Drive: position 18 of 33; Walk: position 31 of 33, when the set is sorted by this metric, smallest first.

H is in nats — the natural-log unit of information. That is why its maximum is ln 36 ≈ 3.584 rather than log₂ 36.

Circuity is an estimate: network distance over straight-line distance, averaged across a seeded sample of node pairs rather than across all of them. Drive: 330 pairs sampled · 160 pairs unreachable.Walk: 477 pairs sampled · 18 pairs unreachable. Pairs with no route between them at all are excluded from the mean. A large count means this network is fragmented — a signal about the data, not about the place.

Each street segment’s bearing goes into one of 36 bins of 10°, weighted by length: a 500 m road counts ten times a 50 m gang. Bar length is the share of network length running that way, not a count of segments. The rose is always 180°-symmetric, because one segment traversed both ways differs by exactly 180°. Boeing 2019 §3

Fig. 3 · r = 800 m

What walking adds

Ink: the edges that exist only in the walking network. Hairline: the network both modes share. Membership is decided by the tag mapping — an edge counts as walk-only when the OSM way it came from is not admitted to the driving network.

Walk-only length: 23.7 km
Share of walking network: 40.4%

Where these numbers come from

Drive

Nodes: 674
Edges: 745
Intersections (degree ≥ 3): 351
Disc area: 2.01 km²
Intersection density: 175 /km²
Rose weighted length: 69.8 km
Per-edge circuity: 1.028

Walk

Nodes: 1279
Edges: 1549
Intersections (degree ≥ 3): 801
Disc area: 2.01 km²
Intersection density: 398 /km²
Rose weighted length: 117.2 km
Per-edge circuity: 1.033

The intermediate values the column above is built from. Intersection density is the intersection count over the disc area; the weighted length is the denominator that turns a rose bar into a share. Two different circuity measures: the per-edge one compares each segment against its own chord, the sampled one compares distances between junctions. The first measures how much streets bend, the second how far out of your way the network takes you.

Rose as a table — 36 bins — Kotagede

Share of network length per 10° bearing bin, for drive and walk.
Bin	Bearing range	P — Drive	P — Walk	−P·ln P	−P·ln P
00	355°–5°	5.13%	4.63%	0.1523	0.1422
01	5°–15°	10.67%	11.35%	0.2388	0.2470
02	15°–25°	5.12%	4.98%	0.1521	0.1494
03	25°–35°	1.38%	1.36%	0.0591	0.0585
04	35°–45°	0.64%	0.52%	0.0322	0.0274
05	45°–55°	0.27%	0.40%	0.0158	0.0223
06	55°–65°	0.28%	0.31%	0.0166	0.0178
07	65°–75°	0.41%	0.37%	0.0227	0.0206
08	75°–85°	0.93%	0.69%	0.0436	0.0344
09	85°–95°	4.12%	4.15%	0.1314	0.1320
10	95°–105°	10.97%	11.87%	0.2425	0.2529
11	105°–115°	5.25%	4.94%	0.1547	0.1485
12	115°–125°	1.96%	1.61%	0.0770	0.0665
13	125°–135°	0.45%	0.45%	0.0244	0.0242
14	135°–145°	0.41%	0.54%	0.0227	0.0282
15	145°–155°	0.55%	0.45%	0.0288	0.0243
16	155°–165°	0.52%	0.46%	0.0272	0.0249
17	165°–175°	0.94%	0.92%	0.0439	0.0431
18	175°–185°	5.13%	4.63%	0.1523	0.1422
19	185°–195°	10.67%	11.35%	0.2388	0.2470
20	195°–205°	5.12%	4.98%	0.1521	0.1494
21	205°–215°	1.38%	1.36%	0.0591	0.0585
22	215°–225°	0.64%	0.52%	0.0322	0.0274
23	225°–235°	0.27%	0.40%	0.0158	0.0223
24	235°–245°	0.28%	0.31%	0.0166	0.0178
25	245°–255°	0.41%	0.37%	0.0227	0.0206
26	255°–265°	0.93%	0.69%	0.0436	0.0344
27	265°–275°	4.12%	4.15%	0.1314	0.1320
28	275°–285°	10.97%	11.87%	0.2425	0.2529
29	285°–295°	5.25%	4.94%	0.1547	0.1485
30	295°–305°	1.96%	1.61%	0.0770	0.0665
31	305°–315°	0.45%	0.45%	0.0244	0.0242
32	315°–325°	0.41%	0.54%	0.0227	0.0282
33	325°–335°	0.55%	0.45%	0.0288	0.0243
34	335°–345°	0.52%	0.46%	0.0272	0.0249
35	345°–355°	0.94%	0.92%	0.0439	0.0431
Sum = H				2.971	2.929

The last column is each bin’s term in H = −Σ P(i)·ln P(i). Add the thirty-six of them and you get the H printed under the rose. An empty bin contributes zero.

Download this site’s data (JSON, ODbL)

Data jalan © OpenStreetMap contributors, ODbL 1.0. Basis data turunan ini ditawarkan dengan lisensi yang sama. · Boeing, G. 2019. Urban Spatial Order: Street Network Orientation, Configuration, and Entropy. Applied Network Science 4(1):67.