L1-Spatial Concepts NGEN06 & TEK230: Algorithms in Geographical Information Systems by: Irene Rangel, updated 2015-11-02 by Sadegh Jamali 1.

Slides:



Advertisements
Similar presentations
Spatial Database Systems. Spatial Database Applications GIS applications (maps): Urban planning, route optimization, fire or pollution monitoring, utility.
Advertisements

Geographic Information Systems GIS Data Models. 1. Components of Geographic Data Spatial locations Attributes Topology Time.
Geographic Information Systems
Oracle Spatial and Mapviewer Problems From Real World Applications.
Data Structure and Algorithms (BCS 1223) GRAPH. Introduction of Graph A graph G consists of two things: 1.A set V of elements called nodes(or points or.
From portions of Chapter 8, 9, 10, &11. Real world is complex. GIS is used model reality. The GIS models then enable us to ask questions of the data by.
1 Enviromatics Spatial database systems Spatial database systems Вонр. проф. д-р Александар Маркоски Технички факултет – Битола 2008 год.
Topological Relations from Metric Refinements Max J. Egenhofer & Matthew P. Dube ACM SIGSPATIAL GIS 2009 – Seattle, WA.
Raster Based GIS Analysis
GI Systems and Science January 30, Points to Cover  Recap of what we covered so far  A concept of database Database Management System (DBMS) 
CS 128/ES Lecture 12b1 Spatial Analysis (3D)
TERMS, CONCEPTS and DATA TYPES IN GIS Orhan Gündüz.
CS 128/ES Lecture 12b1 Spatial Analysis (3D)
Cartographic and GIS Data Structures
Spatial Information Systems (SIS) COMP Spatial relations.
Geographic Information Systems
Week 7. Feature relationship and topology Oct. 17 th, 2005.
NPS Introduction to GIS: Lecture 1
GI Systems and Science January 23, Points to Cover  What is spatial data modeling?  Entity definition  Topology  Spatial data models Raster.
GIS Analysis. Questions to answer Position – what is here? Condition – where are …? Trends – what has changed? Pattern – what spatial patterns exist?
Distance Indexing on Road Networks A summary Andrew Chiang CS 4440.
Spatial data Visualization spatial data Ruslan Bobov
Spatial data models (types)
Applied Cartography and Introduction to GIS GEOG 2017 EL
Relative Location of a Point with Respect to a Straight Line (0,0) 5 5 (2, 2) (4, 5) (0, 5) (6, 3) -3x + 2y +2 = 0 s = A x t + B y t + C s < 0 s > 0.
GIS 1110 Designing Geodatabases. Representation Q. How will we model our real world data? A. Typically: Features Continuous Surfaces and Imagery Map Graphics.
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.
GeoUML a conceptual data model for geographical data conformant to ISO TC 211 Main GeoUML constructs Alberto BelussiNovembre 2004.
Applied Cartography and Introduction to GIS GEOG 2017 EL Lecture-2 Chapters 3 and 4.
Distance. Euclidean Distance Minimum distance from a source (Value NoData) Input grid must have at least one source cell with the rest of the grid.
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.
1 The Relational Database Model. 2 Learning Objectives Terminology of relational model. How tables are used to represent data. Connection between mathematical.
URBDP 422 Urban and Regional Geo-Spatial Analysis Lecture 2: Spatial Data Models and Structures Lab Exercise 2: Topology January 9, 2014.
9/7/2012ISC329 Isabelle Bichindaritz1 The Relational Database Model.
1 EAA 502 GIS Data Model Dr. Mohd Sanusi S. Ahamad.
Tables tables are rows (across) and columns (down) common format in spreadsheets multiple tables linked together create a relational database entity equals.
Introduction to Cartographic Modeling
Leonardo Guerreiro Azevedo Geraldo Zimbrão Jano Moreira de Souza Approximate Query Processing in Spatial Databases Using Raster Signatures Federal University.
Addition Principle of Equality and Inequality Copyrighted © by T. Darrel Westbrook.
1 Spatial Data Models and Structure. 2 Part 1: Basic Geographic Concepts Real world -> Digital Environment –GIS data represent a simplified view of physical.
GIS Data Structures How do we represent the world in a GIS database?
1 Spatio-Temporal Predicates Martin Erwig and Markus Schneider IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING Presented by Mamadou Hassimiou Diallo.
Spatial DBMS Spatial Database Management Systems.
NR 143 Study Overview: part 1 By Austin Troy University of Vermont Using GIS-- Introduction to GIS.
Geographic Data in GIS. Components of geographic data Three general components to geographic information Three general components to geographic information.
L6 – Transformations in the Euclidean Plane NGEN06(TEK230) – Algorithms in Geographical Information Systems by: Irene Rangel, updated by Sadegh Jamali.
L3-Network Algorithms L3 – Network Algorithms NGEN06(TEK230) – Algorithms in Geographical Information Systems by: Irene Rangel, updated Nov by Abdulghani.
Spatial Databases: Lecture 2 DT249-4 DT228-4 Semester Pat Browne
L4-Vector Algorithms L4 – Vector Algorithms NGEN06(TEK230) – Algorithms in Geographical Information Systems Abdulghani Hasan.
L8 - Delaunay triangulation L8 – Delaunay triangulation NGEN06(TEK230) – Algorithms in Geographical Information Systems.
Chapter P Prerequisites: Fundamental Concepts of Algebra 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. 1 P.1 Algebraic Expressions, Mathematical.
Lecture 3 Fuzzy sets. 1.1 Sets Elements of sets An universal set X is defined in the universe of discourse and it includes all possible elements.
Spatial Databases - Topology
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.
Topological relations from metric refinements Egenhofer, M. J. and Dube, M. P ACM SIGSPATIAL GIS '09 Presenter : Murat Demiray Narrative : Mustafa Karamavus.
Rayat Shikshan Sanstha’s Chhatrapati Shivaji College Satara
Graphs.
Physical Structure of GDB
Geographical Information Systems
Principles of GIS Fundamental spatial concepts – Part II Shaowen Wang
Geographic Information Systems
Cartographic and GIS Data Structures
Graphs All tree structures are hierarchical. This means that each node can only have one parent node. Trees can be used to store data which has a definite.
Spatial Databases - Topology
Spatial Databases - Topology
Presentation transcript:

L1-Spatial Concepts NGEN06 & TEK230: Algorithms in Geographical Information Systems by: Irene Rangel, updated by Sadegh Jamali 1

L1-Spatial Concepts Concept of Space Object model –> set of objects (vector) Field-based model -> set of locations with properties (raster or grid) How do we store geographic data (geometry)? 2

L1-Spatial Concepts Aim  Understand the relationship between spatial queries and mathematical concepts.  Know how topological relationships are defined in GIS.  Get knowledge about the relationship between type of queries and suitable methods of storing geographic data. 3

L1-Spatial Concepts Content 1.Spatial queries 2.Set-based queries 3.Topological queries 4.Graph-based queries 5.Euclidean queries 6.Storing relationships or deriving in real-time? 4

L1-Spatial Concepts Spatial Queries Set-based query: Is Uganda a country in Africa? Africa 5

L1-Spatial Concepts Spatial Queries Topological queries Which countries are neighbours to Uganda? Africa Topological Relationships 6

L1-Spatial Concepts Spatial Queries Graph-based queries How long is the traveling distance from Uganda to Egypt? Africa Relationships between elements distance between elements 7

L1-Spatial Concepts Spatial Queries Euclidean queries What is the area of Uganda? 8

L1-Spatial Concepts Do we always need coordinates to answer spatial queries? 9

L1-Spatial Concepts We are not always relying on coordinates (or the Euclidean space) in GIS; by storing set-based, topological and graph-based data explicitly (without using coordinates) we can answer many spatial queries without considering coordinates. 10 But how storing explicitly?

L1-Spatial Concepts Set-based queries Countries_in_africa ={Egypt, Uganda,...} Z={..., -2, -1, 0 1 2,...} R= the real numbers R 2 = R x R E= {x=(x1,x2) | x  R 2, 0<x1<100, 0< x2<100 } 11

L1-Spatial Concepts Set algebra Set Operations: Union Intersection Complement Logical Operators: OR AND NOT 12

L1-Spatial Concepts Data structure to store set based data explicitely Is Uganda a country in Africa? Table: Countries_in_Africa CountryCapitalEtc. UgandaKampala EgyptCairo NigeriaLagos 13

L1-Spatial Concepts Topological queries Topology is derived from the Greek and means the science of position. Topological Space: A set and a number of subsets (which follow certain rules) 14

L1-Spatial Concepts Topological Relationships? Using a rubber sheet (where all points, lines and areas are drawn), topological relationships are the properties that remain between the points, lines and areas for all possible kinds of deformation of the rubber sheet (except tearing). <- Rubber sheet transformation Examples: Point is inside a polygon Two lines intersect Not a topological relationship: an object is close to another (spatial relationship) 15

L1-Spatial Concepts Topological transformation 1)There should be one-to-one correspondence between the elements in the original and transformed set (bijection). 2)Two points that are ”connected” in the original set should also be ”connected” in the transformed set. 16

L1-Spatial Concepts Topological Relationships 17

L1-Spatial Concepts 4-intersection model It is defined using the boundary and the interior of objects. This terminology is defined for cells (2 dimensional, connected sets without holes - closed) in R 2. A A A Connected Not Connected 18

L1-Spatial Concepts 4-intersection model Boundary ( )Interior (A o ) PointThe empty setPoint LineThe end pointsThe line apart from the end points AreaThe line(s) that constitute the border of the area The area inside the border lines Definitions of boundary and interiors of connected objects (A) in R 2 19

L1-Spatial Concepts Definitions of topological relationships (using the 4-intersection model) ∂A ∩ ∂BA 0 ∩ B 0 ∂A ∩ B 0 A 0 ∩ ∂ BTopological relationship ØØØØA disjoint B ¬ ØØØØA meets B ¬ Ø ØØA equals B ج Ø ØA inside B ¬ Ø ØA coveredBy B جØØ B inside A ¬ Ø Ø A covers B ¬ Ø A overlaps B Ø = empty set ¬ Ø = not empty set 20

L1-Spatial Concepts Definitions of topological relationships (using the 4-intersection model) A equals B A disjoint BA contains B A inside B A meets B A covers B A coveredBy B A overlaps B 21

L1-Spatial Concepts Other models of topological relationships 9-intersection model (DE-9IM) The 4-intersection model is actually not that suitable for expressing topological relationships between line and/or point objects. DE-9IM was proposed to be an international standard by the International Standard Organization –ISO Defines topological relationships using interior, exterior and boundary of objects. 22

L1-Spatial Concepts Link-node structure: a data structure that consists of a set of data records (nodes) linked together and organized by references (links). Data structures to store topological data explicitly 23

L1-Spatial Concepts Graph-based queries Also called network queries They consider distances Shortest (fastest) route is a typical example. 24

L1-Spatial Concepts Graph-based queries Traveling time between airports. The points (A, B,..., H) are airports (i.e. elements in the set airports). The edges denote that there are flight routes between the airports. 25

L1-Spatial Concepts Graph-based and metric queries In a graph-based query there is no restriction on the distances between the elements in the set. Metric query is a sub-set of a graph-based query that set constraints on the distances-> they must obey the rules of a metric. 26

L1-Spatial Concepts Metric query A metric (d) is a distance measure between two elements in a set. The metric has to obey the 3 following rules (where p,q, and r are elements in the set, d=metric): 1.d(p,q)>=0, d(p,q)=0  p=q 2.d(p,q)=d(q,p) (symmetry) 3.d(p,q)<=d(p,r)+d(r,q) (triangle inequality) 27

L1-Spatial Concepts Metric query There are an infinite number of metrics. Two of the most common metrics (in R 2 ) in GIS are: 1) Euclidean distance: 2) Manhattan distance: d(p,q)= |xp- xq| + |yp- yq| 28

L1-Spatial Concepts Data structures to store graph-based data explicitly Graphs can be stored as matrixes. Sparse graphs are normally stored in adjacency list (Sedgewick, 2002 ). 29

L1-Spatial Concepts Euclidean queries What is the distance between a building and a road? -> Require coordinates to be stored. 30

L1-Spatial Concepts Storing relationships or deriving in real time? In some cases the relationships can be derived from stored coordinate data. –Traveling distance (but not traveling time) Storing relationships explicitly: –Advantages: It saves processing time Could enhance the quality of the answer –Disadvantages: It takes more space in memory It entails redundancy (storing same information twice) 31

L1-Spatial Concepts Storing relationships or deriving in real time? A few things you should consider before you decide what relationships should be stored explicitly: –What type of queries will the database serve? –How will the database be maintained? –Will the database be connected to other databases? –… 32