Mapping Networks - PowerPoint PPT Presentation

About This Presentation
Title:

Mapping Networks

Description:

Mapping Networks Or, the costs and benefits of abstraction Mapping Networks What are Networks Elements of Network Mapping Schematic Maps Networks, Defined What is a ... – PowerPoint PPT presentation

Number of Views:37
Avg rating:3.0/5.0
Slides: 37
Provided by: kirkgol3
Category:

less

Transcript and Presenter's Notes

Title: Mapping Networks


1
Mapping Networks
  • Or, the costs and benefits of abstraction

2
Mapping Networks
  • What are Networks
  • Elements of Network Mapping
  • Schematic Maps

3
Networks, Defined
  • What is a network?

4
Networks, Defined
  • What is a network?
  • An interconnected group or system
  • a system of intersecting lines or channels "a
    railroad network" "a network of canals
  • Networks are important in geography and mapping

5
Elements of Networks
  • Networks are a collection of
  • Nodes
  • AKA Vertices
  • Edges
  • AKA Links

6
Early Quantitative Geography
  • The Seven Bridges of Königsberg
  • Famous network problem based on an actual place
    (An urban riddle)
  • Lets try and solve the riddle

7
  • The city of Königsberg is set on the Pregel
    River.
  • The city included 2 large islands and was
    connected to the mainland by exactly 7 large
    bridges
  • Is it possible to walk a route that crosses each
    bridge exactly once?

8
Is it possible to walk a route that crosses each
bridge exactly once?
9
Is it possible to walk a route that crosses each
bridge exactly once?
10
Is it possible to walk a route that crosses each
bridge exactly once?
11
The problem becomes simpler with abstraction.
12
So, whats the solution?
  • There is no solution! It is impossible.
  • In 1736, Leonhard Euler proved it impossible
  • Formulated solution in terms of graph theory
  • Eliminated all features except land masses and
    the bridges (nodes, edges)

13
A Eulerian Path
  • A solution did not exist
  • Problem concerned degrees of nodes
  • Degree of a node is the number of edges touching
    it
  • Konisberg 1 5-degree node, 3 3-degree nodes
  • Euler proved that a circuit is only possible
    if there are exactly 0 or 2 nodes of an odd
    degree
  • This type of walk is called a Eulerian Path

14
Harry Beck
  • Electrical Draftsman, English, 1903-1974
  • Created the most famous network map of all-time
  • What is it?

15
Becks Original
16
(No Transcript)
17
(No Transcript)
18
(No Transcript)
19
Direct descendents
20
(No Transcript)
21
The Tube Map
  • Network Map of the London Underground
  • A Schematic Diagram
  • More Topological than Geographic

22
Tube Map
  • Emphasizes connectivity over geographic
    congruence
  • How?

23
Octilinearity
  • Every line on the map is drawn in one of 8
    directions
  • Multiples of 45 degrees
  • Octilinearity
  • Reduces geographic congruence, increases clarity

24
The Beck Map
  • First drafts made between 1931-1933
  • Designed in the form of the electrical circuitry
    diagrams of that time
  • Style adopted worldwide
  • Subway maps are among the most used network maps

25
(No Transcript)
26
(No Transcript)
27
Dangers of the schematic style
  • What are the dangers of the beck map?

28
Dangers of the schematic style
  • What are the dangers of the beck map?
  • Result in warped mental maps of actual geography
  • Since distance and direction are inaccurate

29
Roman place-to-place maps
30
Peutingers Table
31
Speaking of routes
32
1643  Matthew Simons in A Direction for the
English Traviller pub. Thomas Jenner (distance
tables by John Norden)
33
Santa Fe Trail
Zebulon PikeMap of the "Santa Fe Trail"St.
Louis ca. 1806Manuscript mapNational Archives,
Washington, D.C.
34
First map of the Arpanet
35
Map of the Internet
36
Conclusion
  • Graphs are useful to simplify geographic spaces
  • Sacrifices are made to achieve increased clarity
Write a Comment
User Comments (0)
About PowerShow.com