lecture07 - SpatialDataTypes...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Spatial Data Types–Data Structure Design at the Discrete Level (I) First idea for a data structure of the spatial data type region Represent a region object as a collection of faces corresponding to the structured definition t f t l d ll ti f 0 t di j i thl Represent a face as an outer cycle and a collection of 0 meet or disjoint hole cycles Represent a cycle as a collection of “meeting” segments (linear approximation) Problem: Data structure is very inappropriate for geometric operations We learn: If your task is to design an efficient data structure, always take into account all operations that have to be supported by it Frequently compromise needed since an efficient data structure does not exist r ll lgorithms for all algorithms Deeper reasons for designing a single data structure for each data type We want to design a type system with several types and many operations We should avoid the data structure transformation problem Better idea of a data structure
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/19/2009 for the course CIS 6930 taught by Professor Staff during the Fall '08 term at University of Florida.

Page1 / 8

lecture07 - SpatialDataTypes...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online