12. Glossary

Dijkstra Algorithm

Dijkstra’s Algorithm http://en.wikipedia.org/wiki/Dijkstra’s_algorithm a foundational graph search algorithm used for finding the shortest paths between nodes (e.g., road intersections) within a network.

GRASS

Geographic Resources Analysis Support System, https://grass.osgeo.org/ a free, open-source Geographic Information System (GIS) used for raster, vector, and geospatial processing. It is natively included within the standard QGIS installation package.

GTFS

General Transit Feed Specification https://developers.google.com/transit/gtfs a standardized, globally recognized data format used for storing public transportation routes, schedules, stops, and associated network information.

OSM

OpenStreetMap (OSM) https://www.openstreetmap.org/ a free, open, and globally accessible geographic database updated and maintained through open collaboration by a community of volunteers.

QGIS

QGIS http://www.qgis.org a free, open-source Geographic Information System platform utilized for viewing, editing, mapping, and analyzing complex geospatial data.

RAPTOR Algorithm

Round-based Public Transit Routing RAPTOR https://www.microsoft.com/en-us/research/wp-content/uploads/2012/01/raptor_alenex.pdf. An advanced, highly efficient algorithm specifically designed for computing optimal routes and travel times within complex public transit networks.

Voronoi diagram

Voronoi diagram https://en.wikipedia.org/wiki/Voronoi_diagram a partition of a 2D plane into distinct polygonal regions based on distance to a specific dataset of points (e.g., building centroids). Any location within a given Voronoi polygon is closer to its corresponding center point than to any other point in the initial dataset.