Function LayerGridGraph.Linecast

bool Linecast (

GridNodeBase	fromNode	Node to start from.
GridNodeBase	toNode	Node to try to reach using a straight line.
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 the two nodes on the graph.

This method is very similar to the other Linecast methods however it is a bit faster due to not having to look up which node is closest to a particular input point.

var gg = AstarPath.active.data.gridGraph;
var node1 = gg.GetNode(2, 3);
var node2 = gg.GetNode(5, 7);
bool anyObstaclesInTheWay = gg.Linecast(node1, node2);


bool Linecast (

GridNodeBase	fromNode	Node to start from.
Vector2	normalizedFromPoint	Where in the start node to start. This is a normalized value so each component must be in the range 0 to 1 (inclusive).
GridNodeBase	toNode	Node to try to reach using a straight line.
Vector2	normalizedToPoint	Where in the end node to end. This is a normalized value so each component must be in the range 0 to 1 (inclusive).
outGridHitInfo	hit	Contains info on what was hit, see GridHitInfo
List<GraphNode>	trace=null	If a list is passed, then it will be filled with all nodes the linecast traverses
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.
bool	continuePastEnd=false	If true, the linecast will continue past the end point in the same direction until it hits something.

)

Returns if there is an obstacle between the two nodes on the graph.

This method is very similar to the other Linecast methods but it gives some extra control, in particular when the start/end points are at node corners instead of inside nodes.

Shared edges and corners between walkable and unwalkable nodes are treated as walkable. So for example if the linecast just touches a corner of an unwalkable node, this is allowed.

bool Linecast (

GridNodeBase	fromNode
int2	fixedNormalizedFromPoint
GridNodeBase	toNode
int2	fixedNormalizedToPoint
outGridHitInfo	hit
List<GraphNode>	trace=null
System.Func<GraphNode, bool>	filter=null
bool	continuePastEnd=false

)

Returns if there is an obstacle between the two nodes on the graph.

Like Linecast(GridNodeBase,Vector2,GridNodeBase,Vector2,GridHitInfo,List<GraphNode>,System.Func<GraphNode,bool>,bool) but takes normalized points as fixed precision points normalized between 0 and FixedPrecisionScale instead of between 0 and 1.

bool Linecast (

Vector3	from
Vector3	to

)

Returns if there is an obstacle between from and to on the graph.

This is not the same as Physics.Linecast, this function traverses the graph and looks for collisions.

var gg = AstarPath.active.data.gridGraph;
bool anyObstaclesInTheWay = gg.Linecast(transform.position, enemy.position);


Edge cases are handled as follows:

• Shared edges and corners between walkable and unwalkable nodes are treated as walkable (so for example if the linecast just touches a corner of an unwalkable node, this is allowed).

• If the linecast starts outside the graph, a hit is returned at from.

• If the linecast starts inside the graph, but the end is outside of it, a hit is returned at the point where it exits the graph (unless there are any other hits before that).

bool Linecast (

Vector3	from	Point to linecast from
Vector3	to	Point to linecast to
outGraphHitInfo	hit	Contains info on what was hit, see GraphHitInfo.
List<GraphNode>	trace=null	If a list is passed, then it will be filled with all nodes the linecast traverses
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 from and to on the graph.

This is not the same as Physics.Linecast, this function traverses the graph and looks for collisions.

Edge cases are handled as follows:

• Shared edges and corners between walkable and unwalkable nodes are treated as walkable (so for example if the linecast just touches a corner of an unwalkable node, this is allowed).

• If the linecast starts outside the graph, a hit is returned at from.

• If the linecast starts inside the graph, but the end is outside of it, a hit is returned at the point where it exits the graph (unless there are any other hits before that).

var gg = AstarPath.active.data.gridGraph;
bool anyObstaclesInTheWay = gg.Linecast(transform.position, enemy.position);


bool Linecast (

Vector3	from	Point to linecast from
Vector3	to	Point to linecast to
outGridHitInfo	hit	Contains info on what was hit, see GridHitInfo
List<GraphNode>	trace=null	If a list is passed, then it will be filled with all nodes the linecast traverses
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 from and to on the graph.

This is not the same as Physics.Linecast, this function traverses the graph and looks for collisions.

Edge cases are handled as follows:

• Shared edges and corners between walkable and unwalkable nodes are treated as walkable (so for example if the linecast just touches a corner of an unwalkable node, this is allowed).

• If the linecast starts outside the graph, a hit is returned at from.

• If the linecast starts inside the graph, but the end is outside of it, a hit is returned at the point where it exits the graph (unless there are any other hits before that).

var gg = AstarPath.active.data.gridGraph;
bool anyObstaclesInTheWay = gg.Linecast(transform.position, enemy.position);


bool Linecast (

Vector3	from	Point to linecast from
Vector3	to	Point to linecast to
GraphNode	hint	This parameter is deprecated. It will be ignored.

)

Returns if there is an obstacle between from and to on the graph.

This is not the same as Physics.Linecast, this function traverses the graph and looks for collisions.

var gg = AstarPath.active.data.gridGraph;
bool anyObstaclesInTheWay = gg.Linecast(transform.position, enemy.position);


bool Linecast (

Vector3	from	Point to linecast from
Vector3	to	Point to linecast to
GraphNode	hint	This parameter is deprecated. It will be ignored.
outGraphHitInfo	hit	Contains info on what was hit, see GraphHitInfo

)

Returns if there is an obstacle between from and to on the graph.

This is not the same as Physics.Linecast, this function traverses the graph and looks for collisions.

var gg = AstarPath.active.data.gridGraph;
bool anyObstaclesInTheWay = gg.Linecast(transform.position, enemy.position);


bool Linecast (

Vector3	from	Point to linecast from
Vector3	to	Point to linecast to
GraphNode	hint	This parameter is deprecated. It will be ignored.
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 the linecast traverses
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 from and to on the graph.

This is not the same as Physics.Linecast, this function traverses the graph and looks for collisions.

var gg = AstarPath.active.data.gridGraph;
bool anyObstaclesInTheWay = gg.Linecast(transform.position, enemy.position);