Home
Softono

Cityseer Api

Open source Python
121
Stars
11
Forks
10
Issues
7
Watchers
3 months
Last Commit

 About Cityseer Api

Computational tools for urban analysis

Platforms

Web Self-hosted

Languages

Python

Need Help Installing Cityseer Api?

We provide expert installation service for this software. Our team will install, configure, and secure Cityseer Api on your server. plans start at just $30.

Cityseer Api

View on GitHub

cityseer

A Python package for pedestrian-scale network-based urban analysis: network analysis, landuse accessibilities & mixed uses, statistical aggregations.

PyPI version

publish package

deploy docs

Examples: https://benchmark-urbanism.github.io/cityseer-examples/

API Documentation: https://cityseer.benchmarkurbanism.com/

Issues: https://github.com/benchmark-urbanism/cityseer-api/issues

Questions: https://github.com/benchmark-urbanism/cityseer-api/discussions

Installation

pip install cityseer

Development

brew install uv rust rust-analyzer rustfmt uv sync

Cite

Cite as: The cityseer Python package for pedestrian-scale network-based urban analysis

Background

The cityseer-api Python package addresses a range of issues specific to computational workflows for urban analytics from an urbanist's point of view and contributes a combination of techniques to support developments in this field:

  • High-resolution workflows including localised moving-window analysis with strict network-based distance thresholds; spatially precise assignment of land-use or other data points to adjacent street-fronts for improved contextual sensitivity; dynamic aggregation workflows which aggregate and compute distances on-the-fly from any selected point on the network to any accessible land-use or data point within a selected distance threshold; facilitation of workflows eschewing intervening steps of aggregation and associated issues such as ecological correlations; and the optional use of network decomposition to increase the resolution of the analysis.
  • Localised computation of network centralities using shortest paths on primal or dual graphs, and simplest-path heuristics on dual graphs, including tailored methods such as harmonic closeness centrality, and segmented versions of centrality (which convert centrality methods from a discretised to an explicitly continuous form). For more information, see "Network centrality measures and their correlation to mixed-uses at the pedestrian-scale".
  • Land-use accessibilities and mixed-use calculations incorporate dynamic and directional aggregation workflows with the optional use of spatial-impedance-weighted forms. Shortest-path workflows operate on primal or dual graphs, while simplest-path workflows require dual graphs. For more information, see "The application of mixed-use measures at the pedestrian-scale".
  • Network centralities dovetailed with land-use accessibilities, mixed-uses, and general statistical aggregations from the same points of analysis to generate multi-scalar and multi-variable datasets facilitating downstream data science and machine learning workflows. For examples, see "Untangling urban data signatures: unsupervised machine learning methods for the detection of urban archetypes at the pedestrian scale" and "Prediction of 'artificial' urban archetypes at the pedestrian-scale through a synthesis of domain expertise with machine learning methods".
  • The inclusion of graph cleaning methods reduce topological distortions for higher quality network analysis and aggregation workflows while accommodating workflows bridging the wider NumPy ecosystem of scientific and geospatial packages.
  • Underlying loop-intensive algorithms are implemented in rust, allowing these methods to be applied to large and, optionally, decomposed graphs, which have substantial computational demands.