GIS fundamentals / Stephen Wise

Includes bibliographical references and index.

1. Introduction
1.1 How Computers Solve Problems
1.2 How Computers Represent the World: Data Modelling
1.3 The Structure of a Computer
1.4 Pseudocode and Computer Programming Further Reading
2. Databases
2.1 What Are Databases and Why Are They Important?
2.2 Relational Database
2.3 Storing Spatial Data in a Relational Database
2.4 Solutions to the Problems of Storing Spatial Data in RDBMS. Further Reading
3. Vector Data Structures
3.1 Simple Storage of Vector Data 3.2 Topological Storage of Vector Data
3.3 So What Is Topology?,
3.4 And How Does It Help? The Example of DIME
3.5 More on Topological Data Structures
3.6 And a Return to Simple Data Structures
Further Reading
4. Vector Algorithms for Lines
4.1 Simple Line Intersection Algorithm
4.2 Why the Simple Line Intersection Algorithm Would
Not Work: A Better Algorithm
4.3 Dealing with Wiggly Lines
4.4 Calculations on Lines: How Long Is a Piece of String?.
4.5 Line Intersection: How It Is Really Done
Further Reading
5. Vector Algorithms for Areas
5.1 Calculations on Areas: Single Polygons
5.2 Calculations on Areas: Multiple Polygons
5.3 Point in Polygon: Simple Algorithm
5.4 ... and Back to Topology for a Better Algorithm ,
Further Reading
6. The Efficiency of Algorithms
6.1 How Is Algorithm Efficiency Measured?
6.2 Efficiency of the Line Intersection Algorithm ,
6.3 More on Algorithm Efficiency
Further Reading
7. Raster Data Structures.
7.1 Raster Data in Databases.
7.2 Raster Data Structures: The Array
7.3 Saving Space: Run Length Encoding and Quadtrees
7.4 Data Structures for Images.
Further Reading
8. Raster Algorithms
8.1 Raster Algorithms: Attribute Query for Run Length Encoded Data
8.2 Raster Algorithms: Attribute Query for Quadtrees
8.3 Raster Algorithms: Area Calculations
Further Reading
9. Data Structures for Surfaces
9.1 Data Models for Surfaces
9.2 Algorithms for Creating Grid Surface Models
9.3 Algorithms for Creating a Triangulated Irregular Network.
9.4 Grid Creation Revisited
Further Reading
10. Algorithms for Surfaces
10.1 Elevation, Slope and Aspect
10.2 Hydrological Analysis Using a TIN,
10.3 Determining Flow Direction Using a Gridded OEM.
10.4 Using the Flow Directions for Hydrological Analysis
Further Reading
11. Data Structures and Algorithms for Networks
11.1 Networks in Vector and Raster.
11.2 Shortest Path Algorithm
11.3 Data Structures for Network Data
11.4 Faster Algorithms for Finding the Shortest Route
. Further Reading
12. Strategies for Efficient Data Access
12.1 Tree Data Structures
12.2 Indexing and Storing 2D Data Using Both Coordinates
12.3 Space-Filling Curves for Spatial Data
12.4 Spatial Filling Curves and Data Clustering
12.5 Space-Filling Curves for Indexing Spatial Data
12.6 Caching
Further Reading
13. Heuristics for Spatial Data
13.1 Travelling Salesman Problem
13.2 Location Allocation.
13.3 Metaheuristics
13.4 Computability and Decidability.
Further Reading