Update with rasterisation

references.bib

@@ -213,4 +213,17 @@ @inproceedings{nguyen2014realistic
   pages={259--268},
   year={2014},
   organization={Wiley Online Library}
-}
+}
+@article{morgan2020,
+	title = {Travel flow aggregation: nationally scalable methods for interactive and online visualisation of transport behaviour at the road network level},
+	author = {Morgan, Malcolm and Lovelace, Robin},
+	year = {2020},
+	month = {07},
+	date = {2020-07},
+	journal = {Environment & Planning B: Planning & Design},
+	doi = {10.1177/2399808320942779},
+	url = {https://doi.org/10.1177/2399808320942779},
+	note = {tex.ids: morgan{\_}travel{\_}2020a
+publisher: SAGE PublicationsSage UK: London, England
+Citation Key: morgan{\_}travel{\_}2020}
+}

slides.qmd

@@ -1,32 +1,30 @@
 ---
 title: Reproducible methods for network simplification
 format: revealjs
+bibliography: references.bib
 ---
 
 ### The problem
 
-
 ::: {#fig-pct layout-ncol="2"}
-
 ![](images/otley-road-narrow.png){#fig-otley-road}
 
 ![](images/armley-road-narrow.png){#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
+Demo: https://www.pct.bike/m/?r
+=west-yorkshire
 
----
+------------------------------------------------------------------------
 
 ### Solution + demo
 
@@ -36,35 +34,34 @@ Demo: https://www.pct.bike/m/?r=west-yorkshire
 ![](images/paste-3.png)
 
 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/).
+Note that the values on Princes Street (highlighted) are hard to interpret without simplification.
+Demo: [www.npt.scot](https://nptscot.github.io/).
 :::
 
----
+------------------------------------------------------------------------
 
+### Prior work
 
-### The code
+Route network aggregation generates estimates of flow on the network, rasterisation help with visualisatioin [@morgan2020]
 
-:::: {.columns}
+![](images/paste-5.png)
 
-::: {.column width="40%"}
+### 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).
+-   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%"}
-
 ![](images/box.gif)
-
-
 :::
-
-::::
+:::