 Trace the incremental algorithm for constructing convex data on the sample point data given below. Intermediate steps should be shown First, two steps.

Slides:



Advertisements
Similar presentations
Three-Step Database Design
Advertisements

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.
Spatial Database Systems. Spatial Database Applications GIS applications (maps): Urban planning, route optimization, fire or pollution monitoring, utility.
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.
Center for Modeling & Simulation.  A Map is the most effective shorthand to show locations of objects with attributes, which can be physical or cultural.
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.
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.
9-2 Polygons  More About Polygons  Congruent Segments and Angles  Regular Polygons  Triangles and Quadrilaterals  Hierarchy Among Polygons.
Spatial Analysis – vector data analysis
Raster Based GIS Analysis
Computational Geometry and Spatial Data Mining
Spatial Database Systems
CS 128/ES Lecture 12b1 Spatial Analysis (3D)
Border around project area Everything else is hardly noticeable… but it’s there Big circles… and semi- transparent Color distinction is clear.
CS 128/ES Lecture 12b1 Spatial Analysis (3D)
WFM 6202: Remote Sensing and GIS in Water Management
Geographic Information Systems : Data Types, Sources and the ArcView Program.
©2005 Austin Troy. All rights reserved Lecture 3: Introduction to GIS Part 1. Understanding Spatial Data Structures by Austin Troy, University of Vermont.
Spatial Database Systems. Spatial Database Applications GIS applications (maps): Urban planning, route optimization, fire or pollution monitoring, utility.
Tips for Map Due for Lab 1 Complete Exercise (Find Potential Youth Center Locations) through step 6. You should now have the potential youth center locations.
Dr. David Liu Objectives  Understand what a GIS is  Understand how a GIS functions  Spatial data representation  GIS application.
GI Systems and Science January 23, Points to Cover  What is spatial data modeling?  Entity definition  Topology  Spatial data models Raster.
Let’s pretty it up!. Border around project area Everything else is hardly noticeable… but it’s there Big circles… and semi- transparent Color distinction.
GIS Analysis. Questions to answer Position – what is here? Condition – where are …? Trends – what has changed? Pattern – what spatial patterns exist?
Slope and Aspect Calculated from a grid of elevations (a digital elevation model) Slope and aspect are calculated at each point in the grid, by comparing.
Fundamentals of GIS Lecture Materials by Austin Troy except where noted © 2008 Lecture 13: Introduction to Raster Spatial Analysis Using GIS-- By.
Spatial Data Models. What is a Data Model? What is a model? (Dictionary meaning) A set of plans (blueprint drawing) for a building A miniature representation.
Spatial Database Souhad Daraghma.
Applied Cartography and Introduction to GIS GEOG 2017 EL
GIS2: Geo-processing and Metadata Treg Christopher.
Chapter 3 Sections 3.5 – 3.7. Vector Data Representation object-based “discrete objects”
Spatial Query Language Group No.15 Dhruv Dhokalia Yash Khandelwal Course Relation- Chapter 11- Object and Object-Relational Databases.
United Nations Regional Seminar on Census Data Dissemination and Spatial Analysis Amman, Jordan, May, 2011 Spatial Analysis & Dissemination of Census.
Applied Cartography and Introduction to GIS GEOG 2017 EL
Introduction to Rasters In ArcGIS 9.2. What can you do with Rasters Lots….
–combines elements of computer science –database design –software design geography –map projections –geographic reasoning mathematics –mathematical topology.
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.
Spatial Analysis.
8. Geographic Data Modeling. Outline Definitions Data models / modeling GIS data models – Topology.
How do we represent the world in a GIS database?
Assignment 3 Cartographic Modeling –Raw Spatial Data  Map Product for Decision Making Steps –Define Goal –Define important social or biophysical factors.
Spatial Concepts and Data Models Reading: Shekhar & Chawla Chapter 2 November 22, 2005.
1 Data models Vector data model Raster data model.
Week Aug-17 – Aug-22 Introduction to Spatial Computing CSE 5ISC Some slides adapted from Worboys and Duckham (2004) GIS: A Computing Perspective, Second.
Intro to Raster GIS GTECH361 Lecture 11. CELL ROW COLUMN.
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?
Raster Analysis. Learning Objectives Develop an understanding of the principles underlying lab 4 Introduce raster operations and functions Show how raster.
Spatial DBMS Spatial Database Management Systems.
NR 143 Study Overview: part 1 By Austin Troy University of Vermont Using GIS-- Introduction to GIS.
1 Overview Importing data from generic raster files Creating surfaces from point samples Mapping contours Calculating summary attributes for polygon features.
L7 - Raster Algorithms L7 – Raster Algorithms NGEN06(TEK230) – Algorithms in Geographical Information Systems.
CS6234 Advanced Algorithms - Convex hull. Terminologies – ◦ Convex hull of a set Q of points is the smallest convex polygon P for which each point in.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2010 O’Rourke Chapter 6 with some material.
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.
CENTENNIAL COLLEGE SCHOOL OF ENGINEERING & APPLIED SCIENCE VS 361 Introduction to GIS SPATIAL OPERATIONS COURSE NOTES 1.
Computer Graphics CC416 Week 14 Filling Algorithms.
Lecture 3: Spatial Data Management Dr. Taysir Hassan Abdel Hamid Associate Professor, Information Systems Dept., Faculty of Computers and Information.
Lesson 3 GIS Fundamentals MEASURE Evaluation PHFI Training of Trainers May 2011.
GIS Analysis Queries Operations Non-spatial Spatial Vector Raster
Vector Analysis Ming-Chun Lee.
Introduction to Polygons
Spatial Database Systems
Raster Analysis and Terrain Analysis
Introduction to Spatial Databases (2)
Spatial Concepts and Data Models
Day 9 – Pre-image and Image under transformation
Hydro Networks in GIS Review of key concepts in Ex 4
Review- vector analyses
Spatial Database Systems
Presentation transcript:

 Trace the incremental algorithm for constructing convex data on the sample point data given below. Intermediate steps should be shown First, two steps have been shown in the figure. Question on Convex Hull: P1 P2 P3 P4 P5 P6 Increasing X- coordinate P1 P2 P3 P4 P5 P6 Step 1 P1 P2 P3 P4 P5 P6 Step 2

P1 P2 P3 P4 P5 P6 P1 P2 P3 P4 P5 P6 Step 3 P1 P2 P3 P4 P5 P6 Step 4 Step 5 P1 P2 P3 P4 P5 P6 P1 P2 P3 P4 P5 P6 Step 6 P1 P2 P3 P4 P5 P6 Step 7 Step 8

Question on Green Yao Algorithm:  Show the final result after applying Green-Yao’s algorithm on the following input image to snap each intersection point to its nearest grid point. Your final figure should show all the break points (to prevent too much drifting) inserted by the green-yao algorithm.

Question on Douglas-Pucker Algorithm Which of the following properties are true for the Douglas-Pucker Algorithm (DPA) for discretizing simple arcs? Briefly justify your answer. Assume that a finite error threshold is provided for distance between linestring and farthest point on arc.  Correctness: Linestring produced by DPA will meet the specified error threshold. In addition, DPA terminates of all given arc.  Solution quality: The line-string produced by DPA is optimal in number of vertices. In other words, any line-string (discretizing given arc withing the error threshold) will have at least as many points as the line-string produced by DPA.  Response time: If input arc is a linestring with N point, worst-case computational complexity of DPA is no worse than O(N*N).  Solution property: If input arc is symmetric along the perpendicular bi-sector of the line joining arc's end-points, the number of points in the linestring produced by DPA will be a integral power of 2.

Question on Spatial Queries Classify following GIS operation by relational algebra operations of select, project, and join:  Slope and aspect, e.g. determine high slope area given elevation data.  Flag soil erosion risk for locations close to rivers, with high slopes, poor vegetation and soil.  Topological modeling, e.g. list countries adjacent Russia.  Map overlay of soil-type polygons, and high-slope polygons, to identify erosion risks.  Networks (e.g. If a pollutant is spilled in a river, how long would it take the pollutant to reach a drinking water plant downstream?)

Question on General Spatial Concepts Q1. Which of the following statements are false ? (a) Inside, outside and boundary are basic topological operations. (b) 9-intersection model formalizes binary topological relationship. (c) Topological relationships change under elastic deformation. (d) Direction (e.g., North, left) is a topological relationship. Q2. Which of the following is not a topological query ? (a) Which country has highest number of neighboring countries? (b) List airports within 100 miles of Chicago, Illinois. (c) Which rivers flow via at least six countries? (d) List four US states whose boundaries are not defined by any rivers. (e) List US cities which are north-west of a Canadian city.

Question on General Spatial Concepts Q3. Which of the following pairs are disjoint ? (a) interior( Vatican City), interior (Italy) (b) boundary( Vatican City), interior (Italy) (c) interior( Vatican City), boundary (Italy) (d) boundary( Vatican City), boundary (Italy) Q4. Which of the following is modeled naturally by Entity Relationship Diagrams? (a) Field (also knows as Raster) geographic data (b) Object (also known as Vector) geographic data (c) Map Algebra (d) All of the above.

Question on General Spatial Concepts Classify following operations into local, focal and zonal operations on an elevation field defined over a grid (square based regular planar tessellation):  ASPECT: identifies the direction of maximum rate of change in z value from each cell.  BOUNDARYCLEAN: smoothes the boundary between zones by expanding and shrinking the boundary.  HILLSHADE: creates a shaded relief grid from a grid by considering the sun illumination angle and shadows.  INT: converts input floating-point values to integer values through truncation.  ISNULL: returns “1” if the input value is NODATA, and “0” if it is not.  MEAN: uses multiple input grids to determine the mean value on a cell-by-cell basis.  SLOPE: identifies the rate of maximum change in z value from each cell.  ZONALAREA: calculates the area of each zone in the input grid.

Question on Spatial Query Languages Suppose we have a CITY table and RIVER table containing a list of cities and rivers, respectively. The shapes of cities are points, while the shapes of rivers are line strings representing their centerlines. Which of the following queries returns different result than others? 1)SELECT C.Name FROM City C, River R WHERE Distance (C.Shape, R.Shape) <= 300 2)SELECT C.Name FROM City C, River R WHERE Within (C.Shape, Buffer (R.Shape, 300)) 3)SELECT C.Name FROM City C, River R WHERE Contains (C.Shape, Buffer (R.Shape, 300)) 4)SELECT C.Name FROM City C, River R WHERE Cross (R.Shape, Buffer (C.Shape, 300))

Question on Spatial Query Languages Provide the English statement of the following SQL query: SELECT Co1.Name FROM COUNTRY_SPATIAL CoS1, COUNTRY_SPATIAL CoS2 WHERE Touch (CoS1.Shape, CoS2.Shape) = 1 AND CoS2.Name = ‘Canada