Algorithms for GIS: Syllabus and links
Here is a detailed schedule of the class, to be updated as the
- The link to code/demos: here.
- Sample grid data: here.
- Review of C,
Linux. Introduction to OpenGL. Warm-up assignments leading to the first project: Project 1
- Painter's algorithm, OpenGL Z-buffer's algorithm.
- Space partitioning: BSP trees.
- More space partitioning: Introduction to range searching in 1D (binary search tree) and 2D (the k-d tree and the range tree).
- The ubiquitous B-tree.
- The quad-tree.
Materials: It's hard to find a text solely on quad-trees. Below are some surveys:
- Terrain elevation models (grid vs TIN). Data structures for storing a TIN.
- Contour lines: computing contour lines on TINs and the interval tree.
- Flow (on grids).
- Line simplification. Douglas-Peucker and Imai-Iri algorithms [Thu Nov 22nd].
- Terrain simplification. [Tue Nov 26th, Tue Dec 3rd].
- LIDAR data. LIDAR-to-grid conversion. [Dec 5th]
- Generating raster DEMs from mass points via TIN streaming (Isenburg et al, 2006)
- From point cloud to grid DEM: a scalable approach (Agarwa, Arge, Danner, 2006)
- Hybrid MPI/GPU interpolation for grid DEM construction (Danner etal, 2012)
Last modified: Wed Dec 11 11:36:29 EST 2013