axelrodR d2306cacdd improving path aesthetics at tile crossing: in the old code, when a new node is found a single 3D position is associated with it. This position is used regardless of arriving from a new tile. A minor issue on a normal navmesh, this produces many problems when crossing tiles. Points might be located on different borders altogether depending on where one arrived from first. ...

The new code assigns several (consecutive) dtNodes for polygons that lie on tile boundary. Each node gets its own point. since the nodes are packed together consecutively, it is easy to find the right node by reference even though there are several.

2014-01-30 11:57:13 +02:00

..

DetourAlloc.cpp

Custom allocator for Recast.

2010-07-09 12:55:14 +00:00

DetourCommon.cpp

Add wrappers for the standard math library

2013-09-15 20:09:01 -07:00

DetourNavMesh.cpp

Added define to compile Detour with 64bit dtPolyRefs

2013-12-22 18:01:06 +02:00

DetourNavMeshBuilder.cpp

Add wrappers for the standard math library

2013-09-15 20:09:01 -07:00

DetourNavMeshQuery.cpp

improving path aesthetics at tile crossing: in the old code, when a new node is found a single 3D position is associated with it. This position is used regardless of arriving from a new tile. A minor issue on a normal navmesh, this produces many problems when crossing tiles. Points might be located on different borders altogether depending on where one arrived from first.

2014-01-30 11:57:13 +02:00

DetourNode.cpp

improving path aesthetics at tile crossing: in the old code, when a new node is found a single 3D position is associated with it. This position is used regardless of arriving from a new tile. A minor issue on a normal navmesh, this produces many problems when crossing tiles. Points might be located on different borders altogether depending on where one arrived from first.

2014-01-30 11:57:13 +02:00