python package for fast shortest path computation on 2D polygon or grid maps
Project description
python package for fast geometric shortest path computation in 2D multi-polygon or grid environments based on visibility graphs.
Quick Guide:
pip install extremitypathfinder
from extremitypathfinder import PolygonEnvironment
environment = PolygonEnvironment()
# counter clockwise vertex numbering!
boundary_coordinates = [(0.0, 0.0), (10.0, 0.0), (9.0, 5.0), (10.0, 10.0), (0.0, 10.0)]
# clockwise numbering!
list_of_holes = [
[
(3.0, 7.0),
(5.0, 9.0),
(4.5, 7.0),
(5.0, 4.0),
],
]
environment.store(boundary_coordinates, list_of_holes, validate=False)
start_coordinates = (4.5, 1.0)
goal_coordinates = (4.0, 8.5)
path, length = environment.find_shortest_path(start_coordinates, goal_coordinates)
For more 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.5.0.tar.gz
(33.3 kB
view hashes)
Built Distribution
Close
Hashes for extremitypathfinder-2.5.0.tar.gz
Algorithm | Hash digest | |
---|---|---|
SHA256 | 0800853a9e23fda643cbf63408066484f1af9efd67b9e053fac5de82c5c0f722 |
|
MD5 | 77f30a5eff2de5d5b9f135e9b29f584e |
|
BLAKE2b-256 | 51d40ba99e0251eeefb808644d710a2b66e434703a49b09b0753e76dd4e2d987 |
Close
Hashes for extremitypathfinder-2.5.0-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 3fa833d81f3dd177ab6d963f3c3ce2db1b5672d746f235622dd6d593f848c642 |
|
MD5 | 3375de6c8459183cd474456e5ab74f97 |
|
BLAKE2b-256 | 678d2a9e072c3f42c1d16c41263decba36a52bce51e5e36b2cb9acebb21f8322 |