Representation of spatial data

Slides:



Advertisements
Similar presentations
GG3019/GG4027/GG5019 An Introduction to
Advertisements

Representation of spatial data
The Role of Error Map and attribute data errors are the data producer's responsibility, GIS user must understand error. Accuracy and precision of map and.
GUS: 0262 Fundamentals of GIS
Data Models There are 3 parts to a GIS: GUI Tools
Geographic Information Systems GIS Data Models. 1. Components of Geographic Data Spatial locations Attributes Topology Time.
Geographic Information Systems
Efficient access to TIN Regular square grid TIN Efficient access to TIN Let q := (x, y) be a point. We want to estimate an elevation at a point q: 1. should.
Label placement Rules, techniques. Labels on a map Text, name of map features No fixed geographical position Labels of point features (0-dim), line features.
WFM 6202: Remote Sensing and GIS in Water Management © Dr. Akm Saiful IslamDr. Akm Saiful Islam WFM 6202: Remote Sensing and GIS in Water Management Akm.
Introduction to Spatial Database System Presented by Xiaozhi Yu.
Raster Based GIS Analysis
Quadtrees Raster and vector.
Spatial Information Systems (SIS)
Query Processing in Databases Dr. M. Gavrilova.  Introduction  I/O algorithms for large databases  Complex geometric operations in graphical querying.
Introduction to Cartography GEOG 2016 E
TERMS, CONCEPTS and DATA TYPES IN GIS Orhan Gündüz.
Cartographic and GIS Data Structures
Lecture 06: Map Data Structures Geography 128 Analytical and Computer Cartography Spring 2007 Department of Geography University of California, Santa Barbara.
Geographic Information Systems : Data Types, Sources and the ArcView Program.
PROCESS IN DATA SYSTEMS PLANNING DATA INPUT DATA STORAGE DATA ANALYSIS DATA OUTPUT ACTIVITIES USER NEEDS.
NPS Introduction to GIS: Lecture 1
Geography 241 – GIS I Dr. Patrick McHaffie Associate Professor Department of Geography Cook County, % population < 5.
GI Systems and Science January 23, Points to Cover  What is spatial data modeling?  Entity definition  Topology  Spatial data models Raster.
Spatial data Visualization spatial data Ruslan Bobov
Basic Spatial Analysis
©2005 Austin Troy. All rights reserved Lecture 3: Introduction to GIS Understanding Spatial Data Structures by Austin Troy, Leslie Morrissey, & Ernie Buford,
Spatial data models (types)
M ETHODS OF REPRESENTING GEOGRAPHIC SPACE Raster Model Vector Model.
SPATIAL DATA STRUCTURES
GIS is composed of layers Layers –land/water –roads –urban areas –pollution levels Data can be represented by VECTORS, or Data can be represented by RASTERS.
Applied Cartography and Introduction to GIS GEOG 2017 EL
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
GIS Applications in Civil Engineering
Map Scale, Resolution and Data Models. Components of a GIS Map Maps can be displayed at various scales –Scale - the relationship between the size of features.
GUS: 0262 Fundamentals of GIS Lecture Presentation 6: Raster Data Model Jeremy Mennis Department of Geography and Urban Studies Temple University.
Faculty of Applied Engineering and Urban Planning Civil Engineering Department Geographic Information Systems Vector and Raster Data Models Lecture 3 Week.
Presented by Rehana Jamal (GIS Expert & Geographer) Dated: Advance Applications of RS/GIS in Geo-Environmental Conservation Subject Lecture# 9&10.
Applied Cartography and Introduction to GIS GEOG 2017 EL Lecture-2 Chapters 3 and 4.
Major parts of ArcGIS ArcView -Basic mapping, editing and Analysis tools ArcEditor -all of ArcView plus Adds ability to deal with topological and network.
8. Geographic Data Modeling. Outline Definitions Data models / modeling GIS data models – Topology.
How do we represent the world in a GIS database?
Cartographic and GIS Data Structures Dr. Ahmad BinTouq URL:
1 Data models Vector data model Raster data model.
URBDP 422 Urban and Regional Geo-Spatial Analysis Lecture 2: Spatial Data Models and Structures Lab Exercise 2: Topology January 9, 2014.
Introduction to Cartographic Modeling
Raster data models Rasters can be different types of tesselations SquaresTrianglesHexagons Regular tesselations.
1 Spatial Data Models and Structure. 2 Part 1: Basic Geographic Concepts Real world -> Digital Environment –GIS data represent a simplified view of physical.
Creating and Maintaining Geographic Databases. Outline Definitions Characteristics of DBMS Types of database Relational model SQL Spatial databases.
Introduction to GIS. Introduction How to answer geographical questions such as follows: – What is the population of a particular city? – What are the.
Spatial data models Raster –exhaustive regular or irregular partitioning of space –associated with the field view –location-based Vector –points, lines,
Geometric Data and Representation Pattern Recognition 2015/2016 Marc van Kreveld.
GIS Data Models III GEOG 370 Instructor: Christine Erlien.
What is GIS? “A powerful set of tools for collecting, storing, retrieving, transforming and displaying spatial data”
Raster Data Models: Data Compression Why? –Save disk space by reducing information content –Methods Run-length codes Raster chain codes Block codes Quadtrees.
Spatial Data Models Geography is concerned with many aspects of our environment. From a GIS perspective, we can identify two aspects which are of particular.
Major Areas of Practical Application of GIS Technology vehicle routing and scheduling location analysis, site selection development of evacuation plans.
Data Storage & Editing GEOG370 Instructor: Christine Erlien.
UNIT 3 – MODULE 3: Raster & Vector
Environmental GIS Nicholas A. Procopio, Ph.D, GISP
Czech Technical University in Prague Faculty of Transportation Sciences Department of Transport Telematics Doc. Ing. Pavel Hrubeš, Ph.D. Geographical Information.
Rayat Shikshan Sanstha’s Chhatrapati Shivaji College Satara
Geographical Information Systems
Query Processing in Databases Dr. M. Gavrilova
Statistical surfaces: DEM’s
Cartographic and GIS Data Structures
The Arc-Node Data Model
Spatial Databases: Digital Terrain Model
Prepared by S Krishna Kumar
Presentation transcript:

Representation of spatial data GIS architecture, raster and vector, conversion, administrative subdivisions: polygon-ring, topology, extended DCEL, continuous data: contours, DEMs, TINs

Thematic map layers Separate storage of data according to theme: map layers GIS typically use tens to hundreds of map layers For example: municipality borders, land use, cadastral boundaries, water pipes, churches, etc.

Example map layers Census data, 1995 (U.S.A.)

Geometry, topology and attributes Geometry: coordinates Topology: adjacency relations of objects Attributes: properties, values Example: Country map of South America Geometry: coordinates of the borders Topology: which countries border which Attributes: names of countries, population, etc.

GIS data architectures Structure/philosophy of how geometrical/ topological and attribute information should be stored and is accessible 1. Twofold or dual architecture 2. Layered architecture 3. Integrated architecture

Pure database approach Geometry and attributes in same relational data model + More concurrent users possible - Objects must be reduced to atomic parts, and partitioned over various tables - Retrieving original objects is expensive (join) - Query language doesn’t know spatial concepts (area, intersects, …)

Twofold architecture Attributes in a DBMS Geometry in separate files (by theme) Connection by unique identifier Two subsystems: the DBMS and one for the geometry E.g. ArcGIS

Twofold: pros and cons + DB generally known (at organizations) + Geometry fast and easily accessible - More users difficult to incorporate concurrently - Maintaining consistency between 2 systems is tricky - Efficient transactions (optimizations) tricky because of two systems

Layered architecture RDBMS with additional, geographically intelligent layer Layer contains extension with geographical data types, e.g. Point, pointcluster, polygon, line Layer offers extension to query language, and translates for the actual RDBMS

Layered: pros and cons + More concurrent users possible + Spatial object types and concepts are present - Middle layer not extendible - Topological relations must be determined when they are needed - Practice: no object type for subdivision

Integrated architecture Spatial object types and functions in the database itself RDBMS or OO E.g. Postgres

Integrated: pros and cons + No translation in middle layer necessary + Extendible with additional types and functions - Extension is rather complex - Practice: less GIS-functionality present by default

Representation of geometry Two main approaches: raster and vector Can also be mixed in a GIS, any map layer Conversion raster-vector and vice versa possible Representation depends on type of data, way of acquisition, desired operations, etc.

Raster structure Division of space into equal-size cells (squares, pixels) Theme gives cells a value (nominal, ordinal, interval, ratio, vector, …) Cells should not contain any further spatial information (more detail)

Data in raster form Point object in raster form Line object in Plane object in raster form

Raster maps

Raster: pros and cons Simple structure Simple operations Obtained after scanning, remote sensing Less suitable for point and line objects: representation does not follow intuition Network analysis difficult Not adaptive: no difference in detail possible in different regions Either expensive in memory, or little precision Not obtained after digitizing

Raster: memory reduction Run-length encoding: no 2-dim array but coding start pixel with value and length of run Block encoding: 2-dim version Disadvantage: makes structure and operations much more complex (34,67) forest 9 (34,67) forest 4,6

Vector structure Objects stored as points, lines and areas Points have coordinates; lines connect points; areas are delimited by lines Attributes are stored with the objects (point, line or areal)

Vector: pros and cons Elegant structure; fits with both point, line and areal objects Small storage consumption Precise Adaptive: additional control points possible Network and cluster analysis possible Obtained after digitizing Relatively complex Map overlay and buffer computation complex

Vector representation of a region Not necessarily simply-connected: NL has islands NL has holes (Baarle-Nassau / Baarle-Hertog); there are even regions in these holes

Representation of subdivisions

Subdivisions: spaghetti model Every chain is represented by a list with coordinate pairs Split nodes are doubly stored Areas are not present explicitly C1 C2 C5 C4 C3 C6 C1: (..,..), (..,..), (..,..), ... C2: (..,..), (..,..), (..,..), ... C3: (..,..), (..,..), (..,..), ...

Subdivisions: polygon ring structure Every area is represented by a list with coordinate pairs Control points are doubly stored Neighbor areas are difficult to determine Consistency is difficult to maintain P1 P2 P3 P1: (..,..), (..,..), (..,..), ... P2: (..,..), (..,..), (..,..), ... P3: (..,..), (..,..), (..,..), ...

Subdivisions: topological structure Nodes are objects with coordinates Edges are connections of nodes Sequences of edges along polygon boundaries are connected Polygons are objects of which the boundary is stored Doubly-connected edge list

Subdivisions: topological chain structure Splitting nodes are objects with coordinates Chains are connections of splitting nodes and contain zero or more nodes with coordinates Sequences of chains along polygon boundaries are connected Polygons are objects of which the boundary is stored Doubly-connected chain list

Vector structures Memory Duplication Polygon Topology retrieve retrieve Spaghetti ++ + -- - Polygon ring - -- ++ - DC edge list -- ++ - + DC chain list ++ ++ + ++

Raster-vector conversion E.g. for data integration Vector-to-raster: Like in computer graphics: scan-conversion of lines, etc. Raster-to-vector: Consider pixel sides between pixels with different values as boundary and put in vector representation  Thinning, line simplification

Thinning Raster-vector conversion Thinning

Line simplification Douglas-Peucker algorithm from 1973 Input: chain p1, …, pn and error   p1 pn

DP-algorithm  Draw line segment between first and last point If all points in between are within error: ready Otherwise, determine farthest point and recursively continue on the part until farthest point and the part after farthest point

DP-algorithm DP-standard(i, j, ) Determine farthest point pk between pi and pj If distance(pk, pi pj) >  then DP-standard(i, k, ) DP-standard(k, j, ) Return the concatenation of the simplifications

  

  

Properties of the DP-algorithm DP-algorithm does not minimize the number of points in the simplification    DP-algorithm Optimal

Properties of the DP-algorithm Determining farthest point takes O(n) time Whole algorithm takes T(n) = T(m) + T(n-m+1) + O(n), T(2) = O(1) time, splitting in m and n-m+1 points “Fair” split gives O(n log n) time Worst case gives quadratic time

Properties of the DP-algorithm DP-algorithm may give self-intersections in the output  Solution: test output for self-intersections and continue adding control points if necessary

Improved DP-algorithm DP-improved(i, j, ) Simp = DP-standard(i, j, ) V = set of intersecting segments of Simp Repeat For all segments s  V Refine(s) in Simp Do 1 refinement à la DP by adding the farthest point V = set of intersecting segments of Simp Until V is empty

Continuous data representation Digital Elevation Model (DEM) Data on interval or ratio measurement scale Data values of points near by will usually be not very different Representation is necessarily an approximation: finite representation of information with infinite detail Raster (1x) or vector (2x)

Elevation models Raster Vector Vector (Elevation) grid 21 20 21 20 15 20 19 25 10 10 (Elevation) grid Contour line model Triangulation (TIN; triangulated irregular network)

Grid elevation model

TIN elevation model

Elevation models Contour model well-suited for visualisation, not for representation or storage Interpretations grid: - elevation whole cel: not a continuous model - elevation middle cel: interpolation needed; how? Advantage grid: simple storage, operations simple too Advantage TIN: more efficient in storage, adaptive

Interpolation for grid 20 18 20 18 18 22 18 22 20 18 Linear interpolation; saddle point problem 18 22 20 18 20 18 18 22 18 22 Linear interpolation; additional point Non-linear interpolation (20+18+18+22) / 4 =19.5

Topological TIN structure With explicit vertex and triangle representation t2 w t3 t1 t1 t2 t t u v u w t3 v x, y-coordinates and elevation

Topological TIN structure With explicit vertex and triangle representation t2 w t3 t1 t1 t2 t t u v u w t3 v Because t1 has pointers to two the same vertices as t, we can determine their shared edge, even though it is not represented explicitly

Topological TIN structure With explicit vertex and triangle representation w w t1 t2 t2 t1 t u v t t3 v u t3

Topological TIN structure Alternatively, edges have an explicit representation too w t1 t2 w t1 t e1 e2 e1 e2 u e3 v t3 t u e3

Summary representation Objects have geometry and attributes, at least the attributes are in a database Geometry can be stored in raster or vector form; each has advantages and disadvantages Important geometric types of representations are those for subdivisions and for elevation models For subdivisions, the doubly-connected chain list is the most suitable structure For elevation models, grids or TINs are most useful