python package for geometric shortest path computation for given 2D multi-polygon maps
Project description
Python package for fast geometric shortest path computation in 2D multi-polygon or grid environments based on visibility graphs. Please check Github for the documentation with plots: https://github.com/MrMinimal64/extremitypathfinder
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
extremitypathfinder-1.2.0.tar.gz
(28.8 kB
view hashes)
Built Distribution
Close
Hashes for extremitypathfinder-1.2.0.tar.gz
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 311d9ec1d4d3e2c29972f2f179d6e75d1aeffc622c9c5660cc3f774a18baab03 |
|
| MD5 | cd488bee9dd31d4d85fcda4782d3cda3 |
|
| BLAKE2b-256 | 00df261f6589d0bd49ca9426b99a8cf1a6fa311b0ebfb2d06fa09ffe219fb23c |
Close
Hashes for extremitypathfinder-1.2.0-py37.py38-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 11c99e9aa3f3aca12d72810c0d6c91b529d889517889af026dc63ccd9cf180e2 |
|
| MD5 | ad112a6d150dfd9de3472ae33cdf500a |
|
| BLAKE2b-256 | 88dac5ff06a153393279763a17a2aed5f06691001a075687015dae290b444e56 |
