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.
|
override void | Apply (Path p, ModifierData source) |
| Main Post-Processing function.
|
|
bool | RunFunnel (List< Vector3 > left, List< Vector3 > right, List< Vector3 > funnelPath) |
| Calculate a funnel path from the left and right portal lists.
|
|
virtual Vector3[] | Apply (GraphNode[] 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) |
|