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 refer to the documentation.
Project details
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-2.0.0.tar.gz
(30.2 kB
view hashes)
Built Distribution
Close
Hashes for extremitypathfinder-2.0.0.tar.gz
Algorithm | Hash digest | |
---|---|---|
SHA256 | 0588ea1d92d861a3d91082ae08168d8f0b7f8fca4570d36422f7ef1a4d7f8b0b |
|
MD5 | ed2171846477fcbcdd61a30426a9349b |
|
BLAKE2b-256 | ca5a894b6d1c4240bfefa00f243dfdfabe5065dc421fbd18b3a42859591a1f19 |
Close
Hashes for extremitypathfinder-2.0.0-py37.py38-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 0d7f1e61dfd4f02b70eadcdfd810606a786c9f9a954932a0af30a013989c8043 |
|
MD5 | d69781fe2c20f5e287989562bd066810 |
|
BLAKE2b-256 | 2274762257e96b81527c16f64a53b1fa8dfdbcdb661740c0ab9c998a7516c75f |