Function RecastGraph.Linecast

Linecast (NavmeshBase graph, Vector3 origin, Vector3 end, GraphNode hint, outGraphHitInfo hit, List<GraphNode> trace, System.Func<GraphNode, bool> filter=null)

Returns if there is an obstacle between origin and end on the graph.

Public Static

bool Linecast (

NavmeshBase

graph

The graph to perform the search on

Vector3

origin

Point to start from. This point should be on the navmesh. It will be snapped to the closest point on the navmesh otherwise.

Vector3

end

Point to linecast to

GraphNode

hint

If you already know the node which contains the origin point, you may pass it here for slighly improved performance. If null, a search for the closest node will be done.

outGraphHitInfo

hit

Contains info on what was hit, see GraphHitInfo

List<GraphNode>

trace

If a list is passed, then it will be filled with all nodes along the line up until it hits an obstacle or reaches the end.

System.Func<GraphNode, bool>

filter=null

If not null then the delegate will be called for each node and if it returns false the node will be treated as unwalkable and a hit will be returned. Note that unwalkable nodes are always treated as unwalkable regardless of what this filter returns.

)

Returns if there is an obstacle between origin and end on the graph.

This is not the same as Physics.Linecast, this function traverses the graph and looks for collisions instead of checking for collider intersections.

Note

This method only makes sense for graphs in which there is a definite 'up' direction. For example it does not make sense for e.g spherical graphs, navmeshes in which characters can walk on walls/ceilings or other curved worlds. If you try to use this method on such navmeshes it may output nonsense.

var graph = AstarPath.active.data.recastGraph; var start = transform.position; var end = start + Vector3.forward * 10; var trace = new List<GraphNode>(); if (graph.Linecast(start, end, out GraphHitInfo hit, trace, null)) { Debug.Log("Linecast traversed " + trace.Count + " nodes before hitting an obstacle"); Debug.DrawLine(start, hit.point, Color.red); Debug.DrawLine(hit.point, end, Color.blue); } else { Debug.Log("Linecast traversed " + trace.Count + " nodes"); Debug.DrawLine(start, end, Color.green); }

A* Pro Feature

This is an A* Pathfinding Project Pro feature only. This function/class/variable might not exist in the Free version of the A* Pathfinding Project or the functionality might be limited.
The Pro version can be bought here

Linecast (NavmeshBase graph, Vector3 start, Vector3 end, GraphNode hint, outGraphHitInfo hit)