Class RichFunnel Extends RichPathPart

void BuildFunnelCorridor (

List<GraphNode>	nodes	Nodes to build the funnel corridor from
int	start	Start index in the nodes list
int	end	End index in the nodes list, this index is inclusive

)

Build a funnel corridor from a node list slice.

The nodes are assumed to be of type TriangleMeshNode.

Vector3 ClampToNavmesh (

Vector3

position

)

Clamps the position to the navmesh and repairs the path if the agent has moved slightly outside it.

You should not call this method with anything other than the agent's position.

void FindWalls (

List<Vector3>	wallBuffer
float	range

)

Fill wallBuffer with all navmesh wall segments close to the current position.

A wall segment is a node edge which is not shared by any other neighbour node, i.e an outer edge on the navmesh.

RichFunnel Initialize (

RichPath	path
NavmeshBase	graph

)

Works like a constructor, but can be used even for pooled objects.

Returns this for easy chaining

void OnEnterPool ()

RichFunnel ()

Vector3 Update (

Vector3	position	The position of the agent.
List<Vector3>	buffer	Will be filled with up to numCorners points which are the next points in the path towards the target.
int	numCorners	See buffer.
out bool	lastCorner	True if the buffer contains the end point of the path.
out bool	requiresRepath	True if nodes along the path have been destroyed and a path recalculation is necessary.

)

Find the next points to move towards and clamp the position to the navmesh.

TriangleMeshNode CurrentNode

float? DistanceToEndOfPath

Approximate distance (as the crow flies) to the endpoint of this path part.

Vector3 exactEnd

Vector3 exactStart

bool funnelSimplification = true

Post process the funnel corridor or not.

bool CheckForDestroyedNodes ()

True if any node in the path is destroyed.

bool ClampToNavmeshInternal (

ref Vector3

position

)

Searches for the node the agent is inside.

This will also clamp the position to the navmesh and repair the funnel cooridor if the agent moves slightly outside it.

bool FindNextCorners (

Vector3	origin
int	startIndex
List<Vector3>	funnelPath
int	numCorners
out bool	lastCorner

)

void FindWalls (

int	nodeIndex
List<Vector3>	wallBuffer
Vector3	position
float	range

)

void SimplifyPath (

IRaycastableGraph	graph
List<GraphNode>	nodes
int	start
int	end
List<GraphNode>	result
Vector3	startPoint
Vector3	endPoint

)

Simplifies a funnel path using linecasting.

Running time is roughly O(n^2 log n) in the worst case (where n = end-start) Actually it depends on how the graph looks, so in theory the actual upper limit on the worst case running time is O(n*m log n) (where n = end-start and m = nodes in the graph) but O(n^2 log n) is a much more realistic worst case limit.

Requires graph to implement IRaycastableGraph

void UpdateFunnelCorridor (

int	splitIndex
List<TriangleMeshNode>	prefix

)

Split funnel at node index splitIndex and throw the nodes up to that point away and replace with prefix.

Used when the AI has happened to get sidetracked and entered a node outside the funnel.

int checkForDestroyedNodesCounter

int currentNode

Vector3 currentPosition

NavmeshBase graph

List<Vector3> left

Dictionary<TriangleMeshNode,TriangleMeshNode> navmeshClampDict = new Dictionary<TriangleMeshNode, TriangleMeshNode>()

Cached object to avoid unnecessary allocations.

List<TriangleMeshNode> navmeshClampList = new List<TriangleMeshNode>()

Cached object to avoid unnecessary allocations.

Queue<TriangleMeshNode> navmeshClampQueue = new Queue<TriangleMeshNode>()

Cached object to avoid unnecessary allocations.

List<TriangleMeshNode> nodes

RichPath path

List<Vector3> right

int[] triBuffer = new int[3]