lecture 16
play

Lecture 16 Spatial Data and Cartography (Part 2) 3/22/2018 1 - PowerPoint PPT Presentation

Jan 17, 2023 •24 likes •584 views

Lecture 16 Spatial Data and Cartography (Part 2) 3/22/2018 1 Plotting 2 Example Data - NC SIDS 1237. (((-76.74506 36.23392, -~ 2. 350. 115. 0. 286. 7 Camd~ ## 5. ## 954. 1838. 7. 6 Hert~ 1452. ## 1197. (((-77.21767 36.24098, -~

  1. Lecture 16 Spatial Data and Cartography (Part 2) 3/22/2018 1

  2. Plotting 2

  3. Example Data - NC SIDS 1237. (((-76.74506 36.23392, -~ 2. 350. 115. 0. 286. 7 Camd~ ## 5. ## 954. 1838. 7. 6 Hert~ 1452. ## 1197. (((-77.21767 36.24098, -~ 3. 1066. 1606. 9. 139. (((-76.00897 36.3196, -7~ 8 Gates ## 748. 1190. ## # ... with 90 more rows 176. (((-80.02567 36.25023, -~ 5. 160. 2038. 1. ## 10 Stok~ 1612. 844. (((-78.30876 36.26004, -~ 2. 4. 420. 968. 9 Warr~ ## 371. (((-76.56251 36.34057, -~ 2. 594. 254. 0. 5 Nort~ 1421. 145. (((-76.00897 36.3196, -7~ nc = st_read ( system.file (”shape/nc.shp”, package=”sf”), quiet = TRUE) %>% <dbl> <dbl> <dbl> 10. 1364. 1. 1091. 1 Ashe ## <MULTIPOLYGON [°]> <dbl> <fct> <dbl> <dbl> 19. (((-81.47276 36.23436, -~ ## geometry BIR74 SID74 NWBIR74 BIR79 SID79 NWBIR79 NAME ## ## # A tibble: 100 x 8 tbl_df (nc) select (-(AREA:CNTY_ID), -(FIPS:CRESS_ID)) 0. ## 2. 208. 3616. 830. 123. 1. 508. 4 Curr~ ## 260. (((-80.45634 36.24256, -~ 6. 5. 2 Alle~ 3 Surry 3188. ## 12. (((-81.23989 36.36536, -~ 3. 542. 10. 0. 487. 3

  4. Base Plots plot (nc) 4 NAME BIR74 SID74 NWBIR74 BIR79 SID79 NWBIR79

  5. Geometry Plot plot ( st_geometry (nc), axes=TRUE) 5 37 ° N 36.5 ° N 36 ° N 35.5 ° N 35 ° N 34.5 ° N 34 ° N 33.5 ° N 84 ° W 82 ° W 80 ° W 78 ° W 76 ° W

  6. Graticules plot (nc[,”SID79”], graticule= st_crs (nc), axes=TRUE) 6 SID79 37 ° N 36.5 ° N 36 ° N 35.5 ° N 35 ° N 34.5 ° N 34 ° N 33.5 ° N 84 ° W 82 ° W 80 ° W 78 ° W 76 ° W 0 10 20 30 40 50 60

  7. Graticules (EPSG:3631) plot ( st_transform (nc[,”SID79”], 3631), graticule= st_crs (nc), axes=TRUE) 7 SID79 37 ° N 36.5 ° N 36 ° N 35.5 ° N 35 ° N 34.5 ° N 34 ° N 33.5 ° N 84 ° W 82 ° W 80 ° W 78 ° W 76 ° W 0 10 20 30 40 50 60

  8. ggplot2 (dev) devtools:: install_github (”tidyverse/ggplot2”) 8 ggplot (nc) + geom_sf ( aes (fill=SID79)) 36.5 ° N SID79 36 ° N 50 35.5 ° N 40 30 35 ° N 20 10 34.5 ° N 0 34 ° N 84 ° W 82 ° W 80 ° W 78 ° W 76 ° W

  9. ggplot2 + projections ggplot ( st_transform (nc, 3631)) + 9 geom_sf ( aes (fill=SID79 / BIR79)) 36.5 ° N SID79/BIR79 36 ° N 0.006 35.5 ° N 0.004 35 ° N 0.002 34.5 ° N 0.000 34 ° N 84 ° W 82 ° W 80 ° W 78 ° W 76 ° W

  10. Example Data - Meuse 0 8 ## 0 2 9.20 1 8.22 0.190 346. 132. 31. 3.20 7 ## 2 29. 7.80 1 7.79 0.364 281. 137. 61. 3.00 6 ## 0 2 8.70 1 7.48 0.277 269. 2.80 150. 48. 0 dist.m <dbl>, geometry <POINT [m]> ## # ## # ... with 145 more rows, and 3 more variables: landuse <fct>, 0 2 6.30 1 9.05 0.310 183. 80. 24. 1.60 ## 10 1 406. 1 10.6 8.67 0.185 347. 133. 37. 2.40 9 ## 0 1 9.50 1 8.49 0.0922 117. 2.80 data (meuse, meuse.riv, package=”sp”) <dbl> <dbl> <dbl> <dbl> 2 ## 1 1 1 7.91 0.00136 13.6 299. 1022. 85. 11.7 1 ## <dbl> <dbl> <fct> <fct> <fct> <dbl> 5 * ## lime om ffreq soil dist elev zinc lead cadmium copper ## ## # A tibble: 155 x 13 tbl_df (meuse) 8.60 81. 277. 1141. 6.98 0.0122 ## 0 2 8.00 1 7.66 0.190 257. 116. 81. 2.60 4 ## 1 1 1 13.0 7.80 0.103 640. 199. 68. 6.50 3 ## 1 1 1 14.0 10 meuse = st_as_sf (meuse, coords= c (”x”, ”y”), crs=28992) meuse_riv = st_polygon ( list (meuse.riv)) %>% st_sfc () %>% st_set_crs (28992)

  11. Meuse plot (meuse, pch=16) 11 cadmium copper lead zinc elev dist om ffreq soil lime

  12. Layering plots plot (meuse[,”lead”], pch=16, axes=TRUE) 12 plot (meuse_riv, col= adjustcolor (”lightblue”, alpha.f=0.5), add=TRUE, border = NA) lead 700 600 333000 500 332000 400 300 331000 200 330000 100 0 177000 178000 179000 180000 181000 182000 183000

  13. Layering plots (oops) plot (meuse, pch=16) plot (meuse_riv, col= adjustcolor (”lightblue”, alpha.f=0.5), add=TRUE, border = NA) 13 cadmium copper lead zinc elev dist om ffreq soil lime

  14. ggplot2 ggplot () + 14 geom_sf (data=meuse, aes (color=lead), size=1) geom_sf (data= st_sf (meuse_riv), fill=”lightblue”, color=NA) + 51.02 ° N 51 ° N lead 600 50.98 ° N 400 200 50.96 ° N 50.94 ° N 50.92 ° N 5.72 ° E 5.73 ° E 5.74 ° E 5.75 ° E 5.76 ° E 5.77 ° E

  15. ggplot2 - axis limits ggplot () + geom_sf (data= st_sf (meuse_riv), fill=”lightblue”, color=NA) + geom_sf (data=meuse, aes (color=lead), size=1) + ylim (50.95, 50.99) 15 lead 600 400 5.7 ° E 5.71 ° E 5.72 ° E 5.73 ° E 5.74 ° E 5.75 ° E 200

  16. ggplot2 - axis limits ylim (329714, 333611) ggplot () + 16 geom_sf (data=meuse, aes (color=lead), size=1) + geom_sf (data= st_sf (meuse_riv), fill=”lightblue”, color=NA) + 50.99 ° N 50.985 ° N 50.98 ° N lead 600 50.975 ° N 400 200 50.97 ° N 50.965 ° N 50.96 ° N 50.955 ° N 5.72 ° E 5.73 ° E 5.74 ° E 5.75 ° E 5.76 ° E 5.77 ° E

  17. ggplot2 - bounding box ylim ( st_bbox (meuse)[”ymin”], st_bbox (meuse)[”ymax”]) ggplot () + 17 geom_sf (data=meuse, aes (color=lead), size=1) + geom_sf (data= st_sf (meuse_riv), fill=”lightblue”, color=NA) + 50.99 ° N 50.985 ° N 50.98 ° N lead 600 50.975 ° N 400 200 50.97 ° N 50.965 ° N 50.96 ° N 50.955 ° N 5.72 ° E 5.73 ° E 5.74 ° E 5.75 ° E 5.76 ° E 5.77 ° E

  18. Geometry Manipulation 18

  19. Casting ## 139. (-76.00897 36.3196, -75.~ 2. 350. 115. 0. 286. 7 Camd~ 1237. (-76.74506 36.23392, -76~ 8 Gates 5. 954. 1838. 7. 6 Hert~ 1452. ## 1197. (-77.21767 36.24098, -77~ 3. 1066. 1606. ## 420. 5 Nort~ 1421. 2. ## # ... with 90 more rows 176. (-80.02567 36.25023, -80~ 5. 160. 2038. 1. ## 10 Stok~ 1612. 844. (-78.30876 36.26004, -78~ 748. 1190. 0. 4. 968. 9 Warr~ ## 371. (-76.56251 36.34057, -76~ 2. 594. 254. 9. ## nc_pts = st_cast (nc, ”MULTIPOINT”) <dbl> 0. 10. 1364. 1. 1091. 1 Ashe ## <MULTIPOINT [°]> <dbl> <dbl> <dbl> ## * <fct> <dbl> <dbl> ## geometry BIR74 SID74 NWBIR74 BIR79 SID79 NWBIR79 NAME ## ## # A tibble: 100 x 8 tbl_df (nc_pts) 19. (-81.47276 36.23436, -81~ 2 Alle~ 145. (-76.00897 36.3196, -76.~ 6. 2. 830. 123. 1. 508. 4 Curr~ ## 260. (-80.45634 36.24256, -80~ 208. 3616. 487. 5. 3 Surry 3188. ## 12. (-81.23989 36.36536, -81~ 3. 542. 10. 0. 19

  20. plot ( st_geometry (nc), border='grey') plot ( st_geometry (nc_pts), pch=16, cex=0.5, add=TRUE) 20

  21. Casting - POINT 19 POINT (-81.69828 36.47178) POINT (-81.7028 36.51934) 19 0 1364 10 1 1091 Ashe ## 7 0 Ashe 1364 10 1 1091 Ashe ## 6 19 POINT (-81.74107 36.39178) 0 1364 10 ## 8 1091 1091 0 19 POINT (-81.34754 36.53791) 0 1364 10 1 1091 ## 10 Ashe POINT (-81.3453 36.57286) 19 1364 1 10 1 1091 Ashe ## 9 POINT (-81.67 36.58965) 19 0 1364 10 1 Ashe st_cast (nc, ”POINT”) ## First 10 features: 1364 10 1 1091 Ashe ## 1 geometry NAME BIR74 SID74 NWBIR74 BIR79 SID79 NWBIR79 ## +proj=longlat +datum=NAD27 +no_defs 19 POINT (-81.47276 36.23436) ## proj4string: 4267 ## epsg (SRID): xmin: -84.32385 ymin: 33.88199 xmax: -75.45698 ymax: 36.58965 ## bbox: XY ## dimension: POINT ## geometry type: ## Simple feature collection with 2529 features and 7 fields 0 ## 2 ## 5 1364 19 POINT (-81.63306 36.34069) 0 1364 10 1 1091 Ashe ## 4 19 POINT (-81.56198 36.27359) 0 10 Ashe 1 1091 Ashe ## 3 19 POINT (-81.54084 36.27251) 0 1364 10 1 1091 21

  22. plot ( st_geometry (nc), border='grey') plot ( st_geometry ( st_cast (nc, ”POINT”)), pch=16, cex=0.5, add=TRUE) 22

  23. Casting - LINESTRING ## 139. ((-76.00897 36.3196, -75~ 2. 350. 115. 0. 286. 7 Camd~ 1237. ((-76.74506 36.23392, -7~ 8 Gates 5. 954. 1838. 7. 6 Hert~ 1452. ## 1197. ((-77.21767 36.24098, -7~ 3. 1066. 1606. ## 420. 5 Nort~ 1421. 2. ## # ... with 90 more rows 176. ((-80.02567 36.25023, -8~ 5. 160. 2038. 1. ## 10 Stok~ 1612. 844. ((-78.30876 36.26004, -7~ 748. 1190. 0. 4. 968. 9 Warr~ ## 371. ((-76.56251 36.34057, -7~ 2. 594. 254. 9. ## st_cast (nc, ”MULTILINESTRING”) %>% as_tibble () <MULTILINESTRING [°]> 19. ((-81.47276 36.23436, -8~ 0. 10. 1364. 1. 1091. 1 Ashe ## <dbl> 2 Alle~ <dbl> <dbl> <dbl> * <fct> <dbl> <dbl> ## geometry BIR74 SID74 NWBIR74 BIR79 SID79 NWBIR79 NAME ## ## # A tibble: 100 x 8 ## 487. 145. ((-76.00897 36.3196, -76~ 260. ((-80.45634 36.24256, -8~ 2. 830. 123. 1. 508. 4 Curr~ ## 6. 0. 208. 3616. 5. 3 Surry 3188. ## 12. ((-81.23989 36.36536, -8~ 3. 542. 10. 23

  24. st_cast (nc, ”MULTILINESTRING”) %>% st_geometry () %>% plot () 24

  25. Grouping Features ## bbox: ## MULTIPOLYGON (((-76.54427 34.58783, -76.55515 3... +proj=longlat +datum=NAD27 +no_defs ## proj4string: 4267 ## epsg (SRID): xmin: -84.32385 ymin: 33.88199 xmax: -75.45698 ymax: 36.58965 XY nc_state = st_union (nc) ## dimension: MULTIPOLYGON ## geometry type: ## Geometry set for 1 feature nc_state plot (nc_state) 25

Recommend

Lecture # 5 - Monday, Aug 30th In this lecture I reviewed the previous lecture 4, and then

Lecture # 5 - Monday, Aug 30th In this lecture I reviewed the previous lecture 4, and then

Lecture # 5 - Monday, Aug 30th In this lecture I reviewed the previous lecture 4, and then reviewed the final point of lecture #3: Hennigs logical approach to tree inference is valid as logic, but we have a hard time using it because our data

660 views • 7 slides
Algorithms (2IL15) Lecture 13 Wrap-up lecture 1 TU/e Algorithms (2IL15) Lecture 13

Algorithms (2IL15) Lecture 13 Wrap-up lecture 1 TU/e Algorithms (2IL15) Lecture 13

TU/e Algorithms (2IL15) Lecture 13 Algorithms (2IL15) Lecture 13 Wrap-up lecture 1 TU/e Algorithms (2IL15) Lecture 13 Part I of the course: Optimization Problems we want to find valid solution minimizing cost (or maximizing

904 views • 20 slides
In 2020SP, this lecture and lecture 20 are both optional extra material CS 5412/LECTURE 17 Ken

In 2020SP, this lecture and lecture 20 are both optional extra material CS 5412/LECTURE 17 Ken

In 2020SP, this lecture and lecture 20 are both optional extra material CS 5412/LECTURE 17 Ken Birman LEAVE NO TRACE BEHIND Spring, 2020 HTTP://WWW.CS.CORNELL.EDU/COURSES/CS5412/2020SP 1 THE PRIVACY PUZZLE FOR I O T We have sensors

1.04k views • 65 slides
Recall last lecture ... Lecture 8 Also last lecture: Painter's Algorithm More Hidden Surface

Recall last lecture ... Lecture 8 Also last lecture: Painter's Algorithm More Hidden Surface

Recall last lecture ... Lecture 8 Also last lecture: Painter's Algorithm More Hidden Surface Removal Sort polygons in depth. Use the farthest vertex in each polygon as the sorting key. Efficient Painter - binary space partition (BSP)

563 views • 6 slides
Plan Lecture 1 - String diagrams and symmetric monoidal categories Lecture 2 -

Plan Lecture 1 - String diagrams and symmetric monoidal categories Lecture 2 -

Plan Lecture 1 - String diagrams and symmetric monoidal categories Lecture 2 - Resource-sensitive algebraic theories Lecture 3 - Interacting Hopf monoids and graphical linear algebra Lecture 4 - Signal Flow Graphs and recurrence

1.2k views • 61 slides
Where are we at - Topic overview Lecture 1A: Security requirements/features Lecture 7A

Where are we at - Topic overview Lecture 1A: Security requirements/features Lecture 7A

Where are we at - Topic overview Lecture 1A: Security requirements/features Lecture 7A Threatens Privacy Threatens Try to achieve Lecture 2B: Network threats Lecture 3A: Attacks on Lecture 6A: Security Protocols Web servers, malware

381 views • 25 slides
Lecture Capture Introduction to Lecture Capture Learning Outcomes What will lecture capture

Lecture Capture Introduction to Lecture Capture Learning Outcomes What will lecture capture

ISDS &amp; Digital Business Skills Lecture Capture Introduction to Lecture Capture Learning Outcomes What will lecture capture actually do? What happens before a lecture? What happens during a lecture? What does the button do?

527 views • 18 slides
CSE 158 Lecture 4 Web Mining and Recommender Systems More Classifiers Last lecture How

CSE 158 Lecture 4 Web Mining and Recommender Systems More Classifiers Last lecture How

CSE 158 Lecture 4 Web Mining and Recommender Systems More Classifiers Last lecture How can we predict binary or categorical variables? {0,1}, {True, False} {1, , N} Last lecture Will I purchase this product? (yes) Will I click

1.74k views • 60 slides
CSE 158 Lecture 4 Web Mining and Recommender Systems More Classifiers Last lecture How

CSE 158 Lecture 4 Web Mining and Recommender Systems More Classifiers Last lecture How

CSE 158 Lecture 4 Web Mining and Recommender Systems More Classifiers Last lecture How can we predict binary or categorical variables? {0,1}, {True, False} {1, , N} Last lecture Will I purchase this product? (yes) Will I click

850 views • 46 slides
CSE 158 Lecture 4 Web Mining and Recommender Systems More Classifiers Last lecture How

CSE 158 Lecture 4 Web Mining and Recommender Systems More Classifiers Last lecture How

CSE 158 Lecture 4 Web Mining and Recommender Systems More Classifiers Last lecture How can we predict binary or categorical variables? {0,1}, {True, False} {1, , N} Last lecture Will I purchase this product? (yes) Will I click

839 views • 58 slides
Usability of Programming Languages Lecture 4 - directed by your research interests Lecture

Usability of Programming Languages Lecture 4 - directed by your research interests Lecture

Overview Practical experimental course lectures are only introductory Lecture 1 - theoretical principles classic approaches l h current trends in leading research. Lecture 2 - candidate research methods advantages and

499 views • 15 slides
Introduction to AI &amp; Intelligent Agents This Lecture Chapters 1 and 2 Next Lecture

Introduction to AI &amp; Intelligent Agents This Lecture Chapters 1 and 2 Next Lecture

Introduction to AI &amp; Intelligent Agents This Lecture Chapters 1 and 2 Next Lecture Chapter 3.1 to 3.4 (Please read lecture topic material before and after each lecture on that topic) What is Artificial Intelligence? Thought

636 views • 31 slides
Introduction to Numerical Optimization Biostatistics 615/815 Lecture 14 Lecture 14 Course is

Introduction to Numerical Optimization Biostatistics 615/815 Lecture 14 Lecture 14 Course is

Introduction to Numerical Optimization Biostatistics 615/815 Lecture 14 Lecture 14 Course is More Than Half Done! If you have comments they are very welcome y y Lectures Lecture notes Weekly Homework Midterm

795 views • 42 slides
Lecture 12: Clustering 1 6.0002 LECTURE 12 Re Reading Chapter 23 6.0002 LECTURE 12 2 Mach Ma

Lecture 12: Clustering 1 6.0002 LECTURE 12 Re Reading Chapter 23 6.0002 LECTURE 12 2 Mach Ma

Lecture 12: Clustering 1 6.0002 LECTURE 12 Re Reading Chapter 23 6.0002 LECTURE 12 2 Mach Ma chine e Lea earn rning Paradigm Observe set of examples: training data Infer something about process that generated that data Use

847 views • 36 slides
Lecture Outline Regeltechniek Previous lecture: Stability and transient response. Lecture 4

Lecture Outline Regeltechniek Previous lecture: Stability and transient response. Lecture 4

Lecture Outline Regeltechniek Previous lecture: Stability and transient response. Lecture 4 Basics of Feedback Control Robert Babu ska Today: Steady-state response. Delft Center for Systems and Control Faculty of Mechanical

388 views • 7 slides
Psycholinguistics Lecture 2 By Dr.Chelli Lecture Objectives At the end of this lecture, students

Psycholinguistics Lecture 2 By Dr.Chelli Lecture Objectives At the end of this lecture, students

Psycholinguistics Lecture 2 By Dr.Chelli Lecture Objectives At the end of this lecture, students will be able to: Discuss the different stages in the history of psycholinguistics Identify the scholars in the field of psycholinguistics

589 views • 28 slides
Methodology for Lecture Methodology for Lecture Computer Graphics (Spring 2008) Computer

Methodology for Lecture Methodology for Lecture Computer Graphics (Spring 2008) Computer

Methodology for Lecture Methodology for Lecture Computer Graphics (Spring 2008) Computer Graphics (Spring 2008) Lecture deals with lighting (teapot shaded as in HW1) Some Nate Robbins tutor demos in lecture COMS 4160, Lecture 14: OpenGL

535 views • 5 slides
Lecture Outline Regeltechniek Previous lecture: Nyquist plot and stability criterion. Lecture 11

Lecture Outline Regeltechniek Previous lecture: Nyquist plot and stability criterion. Lecture 11

Lecture Outline Regeltechniek Previous lecture: Nyquist plot and stability criterion. Lecture 11 State-space models and state feedback control (We are finished with frequency domain methods.) Robert Babu ska Today: Delft Center for

452 views • 6 slides
CSE Fall 2014 311 Lecture 1 Lecture 1 Lecture 1: Propositional Logic Lecture 1 Foundations

CSE Fall 2014 311 Lecture 1 Lecture 1 Lecture 1: Propositional Logic Lecture 1 Foundations

CSE 311: Foundations of Computing I CSE Fall 2014 311 Lecture 1 Lecture 1 Lecture 1: Propositional Logic Lecture 1 Foundations of Computing I Fall 2014 Some Perspective About the Course We will study the theory needed for CSE: Computer

242 views • 7 slides
Proteomics Steven Meinhardt Lectures Lecture 1 Introduction review of proteins

Proteomics Steven Meinhardt Lectures Lecture 1 Introduction review of proteins

11/29/2012 Proteomics Steven Meinhardt Lectures Lecture 1 Introduction review of proteins Lecture 2 Gel Electrophoresis Lecture 3 Mass Spectrometry Lecture 4 Programs for MS analysis Lecture 5 MIAPE (Minimum

900 views • 8 slides
Multiphase Modelling in Cancer Helen Byrne Wolfson Centre for Mathematical Biology Mathematical

Multiphase Modelling in Cancer Helen Byrne Wolfson Centre for Mathematical Biology Mathematical

Lecture 1 Lecture 2 Lecture 3 Lecture 4 Multiphase Modelling in Cancer Helen Byrne Wolfson Centre for Mathematical Biology Mathematical Institute University of Oxford CRM, Barcelona, April 2018 Lecture 1 Lecture 2 Lecture 3 Lecture 4

1.79k views • 141 slides
Lecture 1: Neurons Lecture 2: Coding with spikes Lecture 3: Tuning curves and receptive fields

Lecture 1: Neurons Lecture 2: Coding with spikes Lecture 3: Tuning curves and receptive fields

Lecture 1: Neurons Lecture 2: Coding with spikes Lecture 3: Tuning curves and receptive fields Lecture 4: Population vectors To gain a basic understanding of how population vectors are constructed 4 credit students: First assignment is

584 views • 31 slides
Algorithms (2IL15) Lecture 10 NP-Completeness, II 1 TU/e Algorithms (2IL15) Lecture 10

Algorithms (2IL15) Lecture 10 NP-Completeness, II 1 TU/e Algorithms (2IL15) Lecture 10

TU/e Algorithms (2IL15) Lecture 10 Algorithms (2IL15) Lecture 10 NP-Completeness, II 1 TU/e Algorithms (2IL15) Lecture 10 Summary of previous lecture P: class of decision problems that can be solved in polynomial time NP:

496 views • 34 slides
Lecture 1: Bioinformatic Algorithms In this lecture Logistics of the course

Lecture 1: Bioinformatic Algorithms In this lecture Logistics of the course

Lecture 1: Bioinformatic Algorithms In this lecture Logistics of the course Introduction to basic biology which will continue in the following lecture Logistics of the Course Logistics About the Course Christina Boucher: (email)

546 views • 40 slides

More recommend