• Create Account

### #ActualIndakung

Posted 19 April 2012 - 11:36 PM

[attachment=8361:navMeshQues.png]
As shown in the graph above, without considering the size of agent, the result path from polygon A to polygon C would be A->B->C.

But if considered the size, because of the minimum passable width α from A to C in B is less than the agent's diameter, the detecting should avoid to across B from A to C while doing a pathfinding, and the result path should be A ->B->D->E->F->B->C.

The question is how to know which polygon or which exit border of a polygon should be avoid during a pathfinding?

### #2Indakung

Posted 19 April 2012 - 11:33 PM

[attachment=8361:navMeshQues.png]
As shown in the graph above, without considering the size of agent, the result path from polygon A to polygon B would be A->B->C.

But if considered the size, because of the minimum passable width α from A to C in B is less than the agent's diameter, the detecting should avoid to across B from A to C while doing a pathfinding, and the result path should be A ->B->D->E->F->B->C.

The question is how to know which polygon or which exit border of a polygon should be avoid during a pathfinding?

### #1Indakung

Posted 19 April 2012 - 11:29 PM

[attachment=8361:navMeshQues.png]
As shown in the graph above, without considering the size of agent, the result path from polygon A to polygon B would be A->B->C.

But if considered the size, because of the minimum passable width α from A to C in B is less than the agent's diameter, the detecting should avoid to across B from A to C while doing a pathfinding, and the result path should be A ->B->D->E->F->B->C.

The question is how to know which polygon or which exit border of a polygon should be avoid during a pathfinding?

PARTNERS