You are currently viewing an archived version of Topic Neighborhoods.
If updates or revisions have been published you can find them at Neighborhoods.
Author and Citation Info:
DiBiase, D., DeMers, M., Johnson, A., Kemp, K., Luck, A. T., Plewe, B., and Wentz, E. (2006). Neighborhoods. The Geographic Information Science & Technology Body of Knowledge. Washington, DC: Association of American Geographers. (2nd Quarter 2016, first digital).
Learning Objectives:
Discuss the role of Voronoi polygons as the dual graph of the Delaunay triangulation
Explain how Voronoi polygons can be used to define neighborhoods around a set of points
Outline methods that can be used to establish non-overlapping neighborhoods of similarity in raster datasets
Create proximity polygons (Thiessen/Voronoi polygons) in point datasets
Write algorithms to calculate neighborhood statistics (minimum, maximum, focal flow) using a moving window in raster datasets
Explain how the range of map algebra operations (local, focal, zonal, and global) relate to the concept of neighborhoods
You are currently viewing an archived version of Topic Neighborhoods. If updates or revisions have been published you can find them at Neighborhoods.
DiBiase, D., DeMers, M., Johnson, A., Kemp, K., Luck, A. T., Plewe, B., and Wentz, E. (2006). Neighborhoods. The Geographic Information Science & Technology Body of Knowledge. Washington, DC: Association of American Geographers. (2nd Quarter 2016, first digital).