Add authors

slides.qmd

@@ -2,6 +2,19 @@
 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
 ---
 
 ### The problem
@@ -81,6 +94,16 @@ Route network aggregation generates estimates of flow on the network, rasterisat
 
 ---
 
+### The merge stage
+
+![](https://docs.ropensci.org/stplanr/reference/rnet_merge-2.png)
+
+---
+
+### 
+
+---
+
 
 ### The code