Spatial Information Systems (SIS) COMP 30110 Spatial data structures (2)

Slides:



Advertisements
Similar presentations
The Normal Distribution
Advertisements

Spatial Information Systems (SIS) COMP Spatial data structures (1)
Spatial Information Systems (SIS) COMP Terrain modeling and geometric problems (part 2)
Spatial Information Systems (SIS) COMP Spatial data structures (3)
1 Building Models. 2 Objectives Introduce simple data structures for building polygonal models ­Vertex lists ­Edge lists OpenGL vertex arrays.
Planar straight line graph A planar straight line graph (PSLG) is a planar embedding of a planar graph G = (V, E) with: 1.each vertex v  V mapped to a.
Week 7 - Monday.  What did we talk about last time?  Specular shading  Aliasing and antialiasing.
Spatial Information Systems (SIS) COMP Formats and Standards.
IE 590 Integrated Manufacturing Systems Lecture 5
The Half-Edge Data Structure Computational Geometry, WS 2007/08 Lecture 3, Part III Prof. Dr. Thomas Ottmann Khaireel A. Mohamed Algorithmen & Datenstrukturen,
IE 590 J Cecil NMSU 1 IE 590 Integrated Manufacturing Systems Lecture 4 CAD & Geometric Modeling.
Exercise Exercise3.1 8 Exercise3.1 9 Exercise
Spatial Information Systems (SIS) COMP Spatial relations.
Spatial Information Systems (SIS) COMP Terrain modeling and geometric problems.
Spatial Information Systems (SIS) COMP Plane Subdivisions.
Exercise Exercise Exercise Exercise
Graph Colouring Lecture 20: Nov 25.
Exercise Exercise Exercise Exercise
Exercise Exercise6.1 7 Exercise6.1 8 Exercise6.1 9.
Curve Curve: The image of a continous map from [0,1] to R 2. Polygonal curve: A curve composed of finitely many line segments. Polygonal u,v-curve: A polygonal.
Using Matrices to Solve a 3-Variable System
CS-321 Dr. Mark L. Hornick 1 3-D Object Modeling.
COLLEGE OF ENGINEERING UNIVERSITY OF PORTO COMPUTER GRAPHICS AND INTERFACES / GRAPHICS SYSTEMS JGB / AAS 1 Shading (Shading) & Smooth Shading Graphics.
Lecture 4: Addition (and free vector spaces) of a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305) Topics in Topology:
Section 8-3 The Hyperbola. Section 8-3 the geometric definition of a hyperbola standard form of a hyperbola with a center at (0, 0) translating a hyperbola.
Module #19: Graph Theory: part I Rosen 5 th ed., chs. 8-9 내년 3 월 ? 교환 학생 프로그램 영어 점수 미리미리 준비하세요.
Topic 11 Lesson 1 = Flat Surfaces, Vertices, and Edges Lesson 2 = Relating Plane Shapes to Solid Figures Lesson 3 = Making New Shapes Lesson 4 = Cutting.
aka “Undirected Graphs”
Goal: Solve a system of linear equations in two variables by the linear combination method.
9-4 Variation Direct Variation Inverse Variation Joint Variation.
Splitting a Face Point edge already split new vertex two new faces one new vertex six new half-edges.
Representation. Objectives Introduce concepts such as dimension and basis Introduce coordinate systems for representing vectors spaces and frames for.
Graphing Quadratic Functions (2.1.1) October 1st, 2015.
Optional Lecture: A terse introduction to simplicial complexes in a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305)
Chapter 5 Graphs  the puzzle of the seven bridge in the Königsberg,  on the Pregel.
1 Building Models Ed Angel Professor Emeritus of Computer Science University of New Mexico Angel and Shreiner: Interactive Computer Graphics 7E © Addison-Wesley.
Vertices, Edges and Faces By Jordan Diamond. Vertices In geometry, a vertices is a special kind of point which describes the corners or intersections.
ساختمانهای گسسته دانشگاه صنعتی شاهرود – فروردین 1392.
Graph Colouring Lecture 20: Nov 25. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including.
Robert Pless, CS 546: Computational Geometry Lecture #3 Last Time: Plane Sweep Algorithms, Segment Intersection, + (Element Uniqueness)
4.1 – ONE-TO-ONE FUNCTIONS; INVERSE FUNCTIONS Target Goals: 1.Obtain the graph of the inverse function 2.Determine the inverse of a function.
Parts of a Circle.
Graphs Basic properties.
CS 318 Intro to Computer Graphics John C. Hart
Joint and Combined Variation Review of Variations Direct Variation Inverse Variation Formula General Equation.
Computer Graphics I, Fall 2010 Building Models.
 I can… ◦ Find the inverse of a given relation or function.
1 Lecture 5 (part 2) Graphs II (a) Circuits; (b) Representation Reading: Epp Chp 11.2, 11.3
3D Object Representations. Introduction Line and circle and polygon algorithms- represented simple and smooth object. Some Natural object are neither.
The point opposite the base of the pyramid
Using Matrices to Solve a 3-Variable System
Geographical Information Systems
Chapter 6: Radical functions and rational exponents
. - t !!l t. - 1f1f J - /\/\ - ' I __.
Complete the missing numbers using the inverse.
Homework solution Problem 2. The number of odd degree vertices in a graph is even. (recom. book: G. Harary: Graph Theory) Solution: Let G=(V,E,w) S=vVdeg(v)
Algebra Methods.
9/16/09 Unit 1 Vocabulary Point – an exact location
.. '.. ' 'i.., \. J'.....,....., ,., ,,.. '"'". ' · · f.. -··-·· '.,.. \...,., '.··.. ! f.f.
Graphing Quadratic Functions (2.1.1)
SOLVING SYSTEMS USING ELIMINATION
Parabola Investigation
Three-Dimensional Object Representation
STORE MANAGER RESPONSIBILITIES.
Unit 3 Review (Calculator)
3D Shape + Addition.
Algebra Methods.
Solving Quadratic Equations by Graphing
Calculate 9 x 81 = x 3 3 x 3 x 3 x 3 3 x 3 x 3 x 3 x 3 x 3 x =
Presentation transcript:

Spatial Information Systems (SIS) COMP Spatial data structures (2)

Symmetric Data Structure (Woo, 1985) Symmetric structure stores: – the three sets of entities V, E, F – relation EV and its inverse VE – relation FE and its inverse EF V F E EF FE EV VE

Example (1) Entities V{P1,P2,….., P11} E{e1, e2,….., e12} F{f0,f1,f2} P9 P8 P3 f1f2 e4 e3 e11 e7 e1 e6 e5 e10 e9 e8 e2 e12 P5 P4 P11 P1 P2 P7P6 P10 f0

Example (2) EVEFVEFE e1P1,P2f1,f2P1e1,e7,e8f0e3, e4,e5,e6,e7,e8,e9,e10,e11,e12 e2P2,P3f1,f2P2e2,e1f1e3,e4,e5,e6,e7,e1,e2 e3P3,P4f1,f0P3e3,e2,e12f2e1,e8,e9,e10,e11,e12,e2 e4P4,P5f1,f0P4e4,e3 e5P5,P6f1,f0P5e5,e4 e6P6,P7f1,f0P6e6,e5 e7P7,P1f1,f0P7e7,e6 e8P1,P8f2,f0P8e8,e9 e9P8,P9f2,f0P9e9,e10 e10P9,P10f2,f0P10e10,e11 e11P10,P11f2,f0P11e11,e12 e12P11,P3f2,f0 P9 P8 P3 f1f2 e4 e3 e11 e7 e1 e6 e5 e10 e9 e8 e2 e12 P5 P4 P11 P1 P2 P7P6 P10 f0

Symmetric structure: space complexity For every edge: 2 constant relations are stored (involving 2 entities): 4e For every face: 1 variable relation (FE). Every edge is common to two faces, so each edge is stored twice: 2e For every vertex: 1 variable relation (VE). Every edge has two endpoints, so each edge is stored twice: 2e Space required to represent relations: 8e For each vertex we also store the two geometric coordinates: 2n

Symmetric structure: calculating EE Calculating relation EE: Obtained by combining EV and VE (or EF and FE) For example, if we want to calculate EE(e2)=(e1,e12), we retrieve the endpoints P2 and P3 of e2 using EV. To retrieve e1 we consider the successor of e2 in the list associated with P2 through VE (for e12 the successor of e2 in the list associated with P3). To do this in constant time, for each edge we need to store the position of the edge in the lists associated to its endpoints through VE. P3 P9 P8 P3 f1f2 e4 e3 e11 e7 e1 e6 e5 e10 e9 e8 e2 e12 P5 P4 P11 P1 P2 P7P6 P10 f0

Symmetric structure: calculating FF, FV, VV, VF As in DCEL…. FF: FE+EF FV: FE+EV VV: VE+EV VF: VE+EF P9 P8 P3 f1f2 e4 e3 e11 e7 e1 e6 e5 e10 e9 e8 e2 e12 P5 P4 P11 P1 P2 P7P6 P10 f0

Symmetric structure: calculating FF Example: FF(f1)=(f0,f2) obtained combining: FE(f1)=(e3,e4,e5,e6,e7,e1,e2)FE(f1)=(e3,e4,e5,e6,e7,e1,e2) EF(e3)=(f1,f0)EF(e3)=(f1,f0) EF(e4)=(f1,f0)EF(e4)=(f1,f0) EF(e5)=(f1,f0)EF(e5)=(f1,f0) EF(e6)=(f1,f0)EF(e6)=(f1,f0) EF(e7)=(f1,f0)EF(e7)=(f1,f0) EF(e1)=(f1,f2)EF(e1)=(f1,f2) EF(e2)=(f1,f2)EF(e2)=(f1,f2) P9 P8 P3 f1f2 e4 e3 e11 e7 e1 e6 e5 e10 e9 e8 e2 e12 P5 P4 P11 P1 P2 P7P6 P10 f0

Symmetric strucutre: FV, VV, VF Exercise!! For next week