Blog
Corridor analysis with GTFS-RT trace data
Coordinate aggregation to estimate route performance consistency
Coalescing Networks for Performant Graph Analysis
Performant spectral clustering leveraging raster like graph clustering
Comparative Acyclic Route Graphs
Some notes from early hyperpath exploration with Peartree
Geoprocessing Parcels to Estimate Street Widths
A minimal-data approach to estimate street widths surrounding target parcels
Computing Variation in Peak Hour Spreads
Application of weighted job scheduling optimization algorithm to find max peak service hours count
Better Rendering of Isochrones from Network Graphs
In which I propose an updated, but slower, method of generating isolines from ego graphs
Calculating Betweenness Centrality with GTFS
Brief walkthrough of how Peartree enables graph algorithms to be performed on GTFS data
OSM Graph Data to HPGL
Converting OSM network graph edges to efficient HPGL plot paths