GIS fundamentals. (2018)
- Record Type:
- Book
- Title:
- GIS fundamentals. (2018)
- Main Title:
- GIS fundamentals
- Further Information:
- Note: Stephen Wise.
- Other Names:
- Wise, Stephen
- Contents:
- Introduction; How Computers Solve Problems; How Computers Represent the World: Data Modelling; The Structure of a Computer; Pseudocode and Computer Programming; Further Reading; ; Databases; What Are Databases and Why Are They Important?; Relational Database; Storing Spatial Data in a Relational Database; Solutions to the Problems of Storing Spatial Data in RDBMS; Further Reading; ; Vector Data Structures; Simple Storage of Vector Data; Topological Storage of Vector Data; So What Is Topology?; And How Does It Help? The Example of DIME; More on Topological Data Structures; And a Return to Simple Data Structures; Further Reading; ; Vector Algorithms for Lines; Simple Line Intersection Algorithm; Why the Simple Line Intersection Algorithm Would Not Work: A Better Algorithm; Dealing with Wiggly Lines; Calculations on Lines: How Long Is a Piece of String?; Line Intersection: How It Is Really Done; Further Reading; ; Vector Algorithms for Areas; Calculations on Areas: Single Polygons; Calculations on Areas: Multiple Polygons; Point in Polygon: Simple Algorithm; … and Back to Topology for a Better Algorithm; Further Reading; ; The Efficiency of Algorithms; How Is Algorithm Efficiency Measured?; Efficiency of the Line Intersection Algorithm; More on Algorithm Efficiency; Further Reading; ; Raster Data Structures; Raster Data in Databases; Raster Data Structures: The Array; Saving Space: Run Length Encoding and Quadtrees; Data Structures for Images; Further Reading; ; RasterIntroduction; How Computers Solve Problems; How Computers Represent the World: Data Modelling; The Structure of a Computer; Pseudocode and Computer Programming; Further Reading; ; Databases; What Are Databases and Why Are They Important?; Relational Database; Storing Spatial Data in a Relational Database; Solutions to the Problems of Storing Spatial Data in RDBMS; Further Reading; ; Vector Data Structures; Simple Storage of Vector Data; Topological Storage of Vector Data; So What Is Topology?; And How Does It Help? The Example of DIME; More on Topological Data Structures; And a Return to Simple Data Structures; Further Reading; ; Vector Algorithms for Lines; Simple Line Intersection Algorithm; Why the Simple Line Intersection Algorithm Would Not Work: A Better Algorithm; Dealing with Wiggly Lines; Calculations on Lines: How Long Is a Piece of String?; Line Intersection: How It Is Really Done; Further Reading; ; Vector Algorithms for Areas; Calculations on Areas: Single Polygons; Calculations on Areas: Multiple Polygons; Point in Polygon: Simple Algorithm; … and Back to Topology for a Better Algorithm; Further Reading; ; The Efficiency of Algorithms; How Is Algorithm Efficiency Measured?; Efficiency of the Line Intersection Algorithm; More on Algorithm Efficiency; Further Reading; ; Raster Data Structures; Raster Data in Databases; Raster Data Structures: The Array; Saving Space: Run Length Encoding and Quadtrees; Data Structures for Images; Further Reading; ; Raster Algorithms; Raster Algorithms: Attribute Query for RunLength Encoded Data; Raster Algorithms: Attribute Query for Quadtrees; Raster Algorithms: Area Calculations; Further Reading; ; Data Structures for Surfaces; Data Models for Surfaces; Algorithms for Creating Grid Surface Models; Algorithms for Creating a Triangulated Irregular Network; Grid Creation Revisited; Further Reading; ; Algorithms for Surfaces; Elevation, Slope and Aspect; Hydrological Analysis Using a TIN; Determining Flow Direction Using a Gridded DEM; Using the Flow Directions for Hydrological Analysis; Further Reading; ; Data Structures and Algorithms for Networks; Networks in Vector and Raster; Shortest Path Algorithm; Data Structures for Network Data; Faster Algorithms for Finding the Shortest Route; Further Reading; ; Strategies for Efficient Data Access ; Tree Data Structures; Indexing and Storing D Data Using Both Coordinates; Space-Filling Curves for Spatial Data; Spatial Filling Curves and Data Clustering; Space-Filling Curves for Indexing Spatial Data; Caching; Further Reading; ; Heuristics for Spatial Data; Travelling Salesman Problem; Location Allocation; Metaheuristics; Computability and Decidability; Further Reading; ; Conclusion; Glossary; References; Index … (more)
- Edition:
- Second edition
- Publisher Details:
- Place of publication not identified : CRC Press
- Publication Date:
- 2018
- Extent:
- 1 online resource (338 pages), (218 illustrations)
- Subjects:
- 910.285
Geographic information systems
Geospatial data
TECHNOLOGY & ENGINEERING / Remote Sensing & Geographic Information Systems - Languages:
- English
- ISBNs:
- 9781315360607
1315360608 - Access Rights:
- Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
- Access Usage:
- Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD.DS.372382
- Ingest File:
- 01_358.xml