Fall 2013 LDA 150/ABT 150 3-Units Introduction to Geographic Information Systems (GIS) Instructors: Assoc.Prof. Dr. Dam Xuan Van Teaching Assistant Msc. Nguyen Huy Trung Lecture : Tuesday, D3O3 Hall, 8:55 AM – 10:45 AM Lab Sections : Friday, computer lab 201, 8:55am – 10:45am Lec #7 Today’s Topics (#7) • Topology • Editing in ArcMap • Polygon data layer creation process Introduction to Topology Recall: simple polygon (spaghetti model) • All entities are represented by coordinate pairs • Coordinate pairs must be in proper order • This is a non-topological data structure A B (5.1,2.3) (6.2,3.3) (6.6,1.4) (4.8,1.3) (5.7,0.2) Polygon Coordinates A (5.1,2.3) (6.2,3.3) (6.6,1.4) (4.8,1.3) B (4.8,1.3) (6.6,1.4) (5.7,0.2) (Lo and Yeung p. 85) (4.8, 1.3) (5.1, 2.3) (6.2, 3.3, (6.6, 1.4) (4.8, 1.3) (4.8, 1.3) *
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
3) Every polygon is surrounded by a cycle of arcs and
nodes.
4) Every node is surrounded by a cycle of arcs and
polygons
5) Every intersection is at a node.
Note: outer (box) polygon is bounding space
= some
example
interior nodes
Every node is surrounded by a
cycle of arcs and polygons
Example of Property
#4:
Fundamental concepts of topology
• Connectivity
• Containment (area definition)
• Adjacency (contiguity)
Lo and Yeung p. 86
Connectivity
• Line segments connect to each other at a node or
a vertex. An arc is defined by two nodes: a start
node and an end node. Connected arcs are
determined by searching through an arc-node list
for matching node numbers.
• Implements topological properties 1 and 5:
– Every arc has 2 nodes
– Every intersection is at a node
Arc-node topology
(implements connectivity)
b
a
1
2
3
(5.1,2.3)
(6.2,3.3)
(6.6,1.4)
(4.8,1.3)
(5.7,0.2)
2. Arc Coordinate List
Arc # Coordinates
1 (4.8,1.3), (5.1,2.3), (6.2,3.3)
2 (4.8,1.3), (6.2,3.3)
3 (6.2,3.3), (5.7,0.2), (4.8,1.3)
(6.6, 1.4)
(6.6, 1.4)
(6.6, 1.4)
1.
1. Arc-Node List
Arc # From-nodeTo- node
1 a b
2 a b
3 b a
2.
Containment (Area definition)
• Closed, connected arcs surrounding an area define a polygon. The polygon is represented by its boundary arcs. A polygon whose boundary is inside that of a second is contained in the second.
• Implements topological property 3:
– Every polygon is surrounded by a cycle of arcs and nodes.
b
a
1
2
A
3
B
Polygon-arc topology
(implements containment)
3. Polygon-Arc List
Poly # Arcs
A 1, 2
B 2, 3
1. Arc-Node List
Arc # From-nodeTo- node
1 a b
2 a b
3 b a
2.
Adjacency
• Arcs have left and right sides. Left-right topology
refers to polygons on each side of an arc.
• Implements topological properties 2 and 4:
– Every arc separates 2 polygons
– Every node is surrounded by a cycle of arcs
and polygons
= some
example
interior nodes
Left-right topology
(implements adjacency)
b
a
1
2
A
3
B4. Left-Right List
Arc# L-Poly R-Poly
1 0 A
2 A B
3 0 B
3. Polygon-Arc List
Poly # Arcs
A 1, 2
B 2, 3
b
a
1
2
A
3
B
4. Left-Right List
Arc# L-Poly R-Poly
1 0 A
2 A B
3 0 B
3. Polygon-Arc List
Poly # Arcs
A 1, 2
B 2, 3
1. Arc-Node List
Arc # From-nodeTo- node
1 a b
2 a b
3 b a
Summary
2. Arc Coordinate List
Arc # Coordinates
1 (4.8,1.3), (5.1,2.3), (6.2,3.3)
2 (4.8,1.3), (6.2,3.3)
3 (6.2,3.3), (5.7,0.2), (4.8,1.3)
(6.6, 1.4)
(6.6, 1.4)
L&Y Fig 3.21
(6.6, 1.4)
connectivitycontainment
adjacency
1.
2.
Error checking by building topology
Building topology involves identifying all nodes, arcs,
and polygons
A
B
(5.1,2.3)
(6.2,3.3)
(6.6,1.4)
(4.8,1.3)
(5.7,0.2)
Zeiler 1999
Example topology in a TIN
Containment, connectivity, and adjacency
Common Topological Errors
Laurini and Thompson p. 191
4 common errors:
• Dangle
• Overshoot
• Overlap
• Nonsensical
vertex order
(ambiguity)
Topology_rules_poster.pdf 26 Rules
Identifies errors in Arc-Node topology
ExamplesIdentifies
polygon
containment
errors
Identifies
adjacency
errors
Identifies
point in
polygon
containment
errors
single
single
multiple
Working with map topology in
ArcGIS
• Topology rules are defined within a feature
dataset in a geodatabase
• The goal is to create a topologically
correct polygon data layer
– Unambiguous lines that define polygons
– No overshoots, undershoots, or overlaps
Vector Mapping
• Creation of feature classes
– Point, line or polygon
– Error checking
• An application of topology
• Creating the database
– Adding attributes manually
– Calculating attribute values
Example polygon feature class
The Land Cover Mapping Process
Red
Bluff
Colusa
Chico
Landing
Polygon feature class
creation process
1) Georeferencing a scan or air photo
2) Digitizing polylines
3) Edge matching • merge or append the data
4) Rubber sheeting
5) Topological validation• checks for line errors
6) Create polygons from polylines
7) Attribute the polygons in the database
8) Attribute error checking
Digitizing concepts and methods
• Creating entities: point, line, polygon
• The Editor Toolbar– Start Editing
– Choose the layer you wish to edit (in a Dialog Box)
– A “Create Features” template window appears and you click the symbol of the layer you wish to digitize on
– A drawing tool cross-hair appears and you can begin digitizing
• Minimum mapping unit (MMU) concept
• On projected imagery (e.g., DOQQs)
• Spatial data creation process– Digitizer tablet (“heads-down”) manual digitizing