-
Notifications
You must be signed in to change notification settings - Fork 3
/
slides.qmd
147 lines (93 loc) · 3.78 KB
/
slides.qmd
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
---
title: Reproducible methods for network simplification
format: revealjs
bibliography: references.bib
author:
- name: Robin Lovelace
affiliation: Leeds Institute for Transport Studies, University of Leeds, UK
orcid: 0000-0001-5679-6536
- name: Zhao Wang
affiliation: Leeds Institute for Transport Studies, University of Leeds, UK
orcid: 0000-0002-4054-0533
- name: Will Deakin
affiliation: Digital, Data and Technology services, Network Rail, UK
orcid: 0009-0008-5656-4469
- name: Josiah Parry
affiliation: Environmental Systems Research Institute, Redlands, CA, USA
orcid: 0000-0001-9910-865X
knitr: true
---
```{bash}
#| echo: false
#| eval: false
# Convert networkmerge-talk-gisruk.mp4 to .ogg
ffmpeg -i networkmerge-talk-gisruk.mp4 -c:v libtheora -q:v 7 -c:a libvorbis -q:a 4 networkmerge-talk-gisruk.ogg
ls -lh networkmerge-talk-gisruk.*
```
### Details
- For listen-along audio, download and open this: https://github.com/nptscot/networkmerge/releases/download/v1/networkmerge-talk-gisruk.mp4
- For the associated GISRUK extended abstract, see here: https://github.com/nptscot/networkmerge/releases/download/v1/gisruk.pdf
- For the code, see here: https://github.com/nptscot/
### The problem
::: {#fig-pct layout-ncol="2"}
{#fig-otley-road}
{#fig-armley-road}
Two parallel ways in Leeds, UK, with similar flow but different widths.
:::
------------------------------------------------------------------------
### Issues and live demo
Illustration of issues associated with route network-level results containing multiple parallel ways on the same corridor: it is not clear from the visualisation that the corridor shown in the right hand figure has greater flow than the corridor shown in the left..
Source: open access Propensity to Cycle Tool results available at www.pct.bike.
Demo: https://www.pct.bike/m/?r
=west-yorkshire
------------------------------------------------------------------------
### Solution + demo
::: {#fig-npt layout="[40,-2,40]"}
The Network Planning Tool for Scotland, showing the network results for central Edinburgh without simplification (left) and with simplification (right).
Note that the values on Princes Street (highlighted) are hard to interpret without simplification.
Demo: [www.npt.scot](https://nptscot.github.io/).
:::
------------------------------------------------------------------------
### Prior work
Route network aggregation generates estimates of flow on the network, rasterisation help with visualisatioin [@morgan2020]
---
### Existing simplification algorithms
---
### Buffering
---
### Buffer rasterisation
---
### Skeletonisation
---
### Knot removal
---
### The merge stage
---
### Rust implementation
See https://github.com/nptscot/rnetmatch/blob/main/paper.qmd
---
### The code
::: columns
::: {.column width="40%"}
<small>
The code underlying the results presented in this paper are available from the following repositories:
- The [`nptscot/networkmerge`](https://github.com/nptscot/networkmerge) repository contains the reproducible paper.
- The `parenx` Python for image skeletonization and Voronoi diagram-centreline identification is available on PyPI in the GitHub repo [`anisotropi4/parenx`](https://github.com/anisotropi4/parenx).
- The `rnetmatch` R package for network simplification is available on GitHub in the repo [`nptscot/rnetmatch`](https://github.com/nptscot/rnetmatch).
</small>
:::
::: {.column width="60%"}
:::
:::
---
### References