Skip to main content

A package to determine which geometries are adjacent to each other, accounting for obstacles and gaps between features.

Project description

Geo-Adjacency

Pip repository

Full documentation

Installation

It's recommended to use a virtual environment to install this tool, since its dependencies may require different versions than what is installed on your system.

pip

Recommended installation is with pip:

python -m pip install geo-adjacency

Build from source

You must have Python <3.13,>=3.9 installed.

$ git clone git@github.com:asmyth01/geo-adjacency.git
$ cd geo-adjacency
$ poetry install

Or with build.

$ git clone git@github.com:asmyth01/geo-adjacency.git
$ cd geo-adjacency
$ python -m build

Example Usage

See the docs for details.

  1. Load the data. geo-adjacency expects you to provide your data as Shapely geometries. You will provide three lists: source_geoemtries, target_geometries, and obstacle_geometries. What we are analyzing is which of the source geometries are adjacent to which of the target geometries. Obstacles can prevent a source and target from being adjacent, but they do not participate in the adjacency dictionary.

  2. Create an AdjacencyEngine. In this case, we'll load the sample data which is available on Github <https://github.com/asmyth01/geo-adjacency/>_.

    s, t, o = load_test_geoms("../tests/sample_data")
       engine = AdjacencyEngine(s , t, o, True)
    
  3. Run the analysis

    output = engine.get_adjacency_dict()
    # defaultdict(<class 'list'>, {0: [1, 2], 1: [1], 2: [1], 3: [2], 6: [1], 7: [1]})
    

    The output is a dictionary. Keys are the indices of source geometries in the input list, and values are a list of indices of adjacent target geometries in the input list.

  4. You can visualize the output with a handy built-in method which uses pyplot. engine.plot_adjacency_dict(). (Source geoms are grey, targets are blue, obstacles are red. Linkages are green.

    adjancency diagram

  5. You probably will want to match the adjacency dictionary back to the original data so that you can do something cool with it.

      for source_i, target_i_list in output.items():
          source_geom = source_geometries[source_i]
          target_geoms = [target_geometries[i] for i in target_i_list]

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

geo_adjacency-1.1.1.tar.gz (9.9 kB view details)

Uploaded Source

Built Distribution

If you're not sure about the file name format, learn more about wheel file names.

geo_adjacency-1.1.1-py3-none-any.whl (10.3 kB view details)

Uploaded Python 3

File details

Details for the file geo_adjacency-1.1.1.tar.gz.

File metadata

  • Download URL: geo_adjacency-1.1.1.tar.gz
  • Upload date:
  • Size: 9.9 kB
  • Tags: Source
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/4.0.2 CPython/3.9.18

File hashes

Hashes for geo_adjacency-1.1.1.tar.gz
Algorithm Hash digest
SHA256 3d8cbfb8ec495787e64f04a4ed74ba469accb88fc2fe14a4c423d4e2fae17986
MD5 943354cd194d0ffb067fef16728de459
BLAKE2b-256 f98f265cc17bec3cb4bc0f7f99761739a6e045f3dc0ec3200373dfa8aff8ecee

See more details on using hashes here.

File details

Details for the file geo_adjacency-1.1.1-py3-none-any.whl.

File metadata

  • Download URL: geo_adjacency-1.1.1-py3-none-any.whl
  • Upload date:
  • Size: 10.3 kB
  • Tags: Python 3
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/4.0.2 CPython/3.9.18

File hashes

Hashes for geo_adjacency-1.1.1-py3-none-any.whl
Algorithm Hash digest
SHA256 5bbbd038ae2e70ebb4e600725311b8663eb66340c7250a1c649a7e61e4a5e0be
MD5 69d6ed11483efdc46c6a8498a3c2925d
BLAKE2b-256 71324eb6e1c33b66bed7c62048106ae609f526785386503d51c6b0c3670a0806

See more details on using hashes here.

Supported by

AWS Cloud computing and Security Sponsor Datadog Monitoring Depot Continuous Integration Fastly CDN Google Download Analytics Pingdom Monitoring Sentry Error logging StatusPage Status page