Algorithms for Geospatial Computing
Geometric primitives and algorithms for discrete and continuous spatial data processing. Point data representation and analysis: spatial data structures, neighbor finding and range queries, clustering algorithms. Terrain modeling: grids and TINs, algorithms and data structures for building and querying TINs, gridding and interpolation. Terrain analysis: segmentation through watershed computation, algorithms for visibility computation. Applications to LiDAR data processing and analysis for forest management, urban modeling, and coastal data mapping.
Prerequisites & course information
Prerequisite: GEOG276 or permission of instructor. Jointly offered with: GEOG470 . Credit Only Granted for: CMSC498Q, CMSC401 , CMSC788I, GEOG470 , GEOG498I, GEOG770 , or GEOG788I. Formerly: GEOG788I.
Sources
- Course catalogue ↗2026-2027