You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
@@ -65,6 +65,7 @@ library(GreenExp) # If not loaded yet
65
65
library(magrittr) # If not loaded yet (used for piping %>%)
66
66
library (sf) #Need for most spatial operation
67
67
library (sfheaders) #for additional functions to work with sf package
68
+
library(tmaptools) #do some geo-coding for OSM
68
69
69
70
```
70
71
Please note that the examples based on this data serves as an illustration, and you may need to adapt the parameters and function usage to match your specific scenario.
@@ -330,58 +331,92 @@ In this example, the accessibility function is applied using the default setting
330
331
331
332
```r
332
333
#Get the location bounding box to extrat data from OSM
#let us run the Euclidan distance based accessibility, here we are only considering greenspace with size at least 400 m2 or 0.4 ha (based on WHO guideline)
**Example 2: Network Distance to Pseudo Entrances**
368
380
369
-
In this example, the accessibility function considers network distance to the pseudo entrances of the greenspaces. The pseudo entrances are created by buffering the greenspace polygons and intersecting them with the network nodes. The function calculates the network distance from the address location to the nearest pseudo entrance point. The figure below presents an example in Amsterdam, where the parks are shown as green polygons. The blue lines indicate the euclidean distance from the address location to the nearest park centroid. The park centroids are depicted as black points, and the address location is represented by a red point. Additionally, you may observe multiple pseudo entrances within the parks, as roads passing through the parks can also serve as potential entrance points.
381
+
In this example, the accessibility function considers network distance to the pseudo entrances of the greenspaces. The pseudo entrances are created by buffering the greenspace polygons and intersecting them with the network nodes. The function calculates the network distance from the address location to the nearest pseudo entrance point.
|[**tidyr**](https://cran.r-project.org/package=tidyr)| Changing the shape and hierarchy of a dataset |
609
642
|[**Rcpp**](https://cran.r-project.org/package=Rcpp)| R and C++ integration |
610
643
|[**progress**](https://cran.r-project.org/package=progress)| Make a progress bar in loops |
611
-
|[**GVI**](https://doi.org/10.1016/j.scitotenv.2020.143050)| information about the calculation of the visiblity|
644
+
|[**GVI**](https://doi.org/10.1016/j.scitotenv.2020.143050)| information about the calculation of the visibility|
612
645
613
646
614
647
615
648
616
649
## Acknowledgements and contact
617
650
618
-
Project made in collaboration with Dr. SM Labib from the Department of Human Geography and Spatial Planning at Utrecht University. This is a project of the Spatial Data Science and Geo-AI Lab.
651
+
Project conducted user the supervision and in collaboration with Dr. SM Labib from the Department of Human Geography and Spatial Planning at Utrecht University. This is a project of the Spatial Data Science and Geo-AI Lab at Utrecht University.
0 commit comments