A* Pathfinding Project
3.1.4
The A* Pathfinding Project for Unity 3D
|
Simplifies paths on navmesh graphs using the funnel algorithm. More...
Public Member Functions | |
override void | Apply (Path p, ModifierData source) |
Main Post-Processing function. | |
void | ConstructFunnel (IFunnelGraph funnelGraph, List< Vector3 > vectorPath, List< Node > path, int sIndex, int eIndex, List< Vector3 > funnelPath, List< Vector3 > left, List< Vector3 > right) |
bool | RunFunnel (List< Vector3 > left, List< Vector3 > right, List< Vector3 > funnelPath) |
![]() | |
virtual Vector3[] | Apply (Node[] path, Vector3 start, Vector3 end, int startIndex, int endIndex, NavGraph graph) |
virtual Vector3[] | Apply (Vector3[] path, Vector3 start, Vector3 end) |
virtual void | ApplyOriginal (Path p) |
void | Awake () |
Alerts the Seeker that this modifier exists. | |
void | OnDestroy () |
void | OnDisable () |
void | OnEnable () |
virtual void | PreProcess (Path p) |
![]() | |
void | Apply (Path p, ModifierData source) |
void | ApplyOriginal (Path p) |
void | PreProcess (Path p) |
Properties | |
override ModifierData | input [get] |
override ModifierData | output [get] |
![]() | |
abstract ModifierData | input [get] |
abstract ModifierData | output [get] |
int | Priority [get, set] |
![]() | |
ModifierData | input [get] |
ModifierData | output [get] |
int | Priority [get, set] |
Static Private Attributes | |
static Int3[] | leftFunnel |
static Int3[] | rightFunnel |
static List< Vector3 > | tmpList |
Additional Inherited Members | |
![]() | |
int | priority = 0 |
Higher priority modifiers are executed first. | |
Seeker | seeker |
Simplifies paths on navmesh graphs using the funnel algorithm.
The funnel algorithm is an algorithm which can, given a path corridor with nodes in the path where the nodes have an area, like triangles, it can find the shortest path inside it. This makes paths on navmeshes look much cleaner and smoother.