{"repo":"vleue/polyanya","free":true,"listed":false,"github":"https://github.com/vleue/polyanya","clone":"git clone https://github.com/vleue/polyanya.git","description":"Pathfinding using Polyanya","language":"Rust","stars":505,"topics":["game-development","pathfinding","path-planning","rust","any-angle","navmesh"],"license":"Apache-2.0","category":"game-templates","readme_excerpt":"Polyanya - Compromise-free Pathfinding on a Navigation Mesh Implementation of Polyanya in Rust! Polyanya is a any-angle path planning algorithm. WASM demos made with Bevy are available here. Features - Pathfinding using Polyanya : Efficient any-angle path planning algorithm for navigation meshes. - Multi-layer Navigation Mesh Support : - Overlapping navmeshes for 3D navigation (floors, bridges, ...). - One-way layers for directional movement. - Conditional layer traversal with the ability to enable or disable layers. - Layers with different traversal costs for more realistic pathfinding. Usage Navigation meshes can be built by specifying their outer edges and inner obstacles: They can also be built by manually specifying vertices and polygons for complete control. The following produces the same mesh The code above will build the following mesh, with polygons marked in green, and vertices in red: Original Work Check the cpp implementation. This crate seems to generate a few more nodes, but tends to be faster than the cpp implementation. There are a few known cases to still improve it: collinear optimisation, when a search node root and interval are all on a same line triangle optimisation, when searching in a triangle polygon when an intersection is very close to a vertex, it sometimes generates an extra slim search node searching start and end nodes is costlier Compiling this crate with feature stats will output almost the same level of information as the default cpp impleme","default_branch":null,"files":null,"tree":[],"storefront":"/r/vleue","claimed":false,"request_supported":{"post":"https://gitbuyer.com/r/vleue/polyanya/request-supported","requests":0},"note":"indexed from public GitHub; nothing is for sale on this page. Clone it from GitHub. Paid listings live at /search."}