文件列表:

DebugUtils (0, 2016-05-17)
DebugUtils\Include (0, 2016-05-17)
DebugUtils\Include\DebugDraw.h (7942, 2016-05-17)
DebugUtils\Include\DetourDebugDraw.h (2544, 2016-05-17)
DebugUtils\Include\RecastDebugDraw.h (3045, 2016-05-17)
DebugUtils\Include\RecastDump.h (1728, 2016-05-17)
DebugUtils\Source (0, 2016-05-17)
DebugUtils\Source\DebugDraw.cpp (15778, 2016-05-17)
DebugUtils\Source\DetourDebugDraw.cpp (23549, 2016-05-17)
DebugUtils\Source\RecastDebugDraw.cpp (28499, 2016-05-17)
DebugUtils\Source\RecastDump.cpp (13145, 2016-05-17)
Detour (0, 2016-05-17)
Detour\Include (0, 2016-05-17)
Detour\Include\DetourAlloc.h (2630, 2016-05-17)
Detour\Include\DetourAssert.h (1376, 2016-05-17)
Detour\Include\DetourCommon.h (18378, 2016-05-17)
Detour\Include\DetourMath.h (401, 2016-05-17)
Detour\Include\DetourNavMesh.h (30051, 2016-05-17)
Detour\Include\DetourNavMeshBuilder.h (6754, 2016-05-17)
Detour\Include\DetourNavMeshQuery.h (25692, 2016-05-17)
Detour\Include\DetourNode.h (3569, 2016-05-17)
Detour\Include\DetourStatus.h (2587, 2016-05-17)
Detour\Source (0, 2016-05-17)
Detour\Source\DetourAlloc.cpp (1509, 2016-05-17)
Detour\Source\DetourCommon.cpp (10138, 2016-05-17)
Detour\Source\DetourNavMesh.cpp (42616, 2016-05-17)
Detour\Source\DetourNavMeshBuilder.cpp (22557, 2016-05-17)
Detour\Source\DetourNavMeshQuery.cpp (94046, 2016-05-17)
Detour\Source\DetourNode.cpp (4176, 2016-05-17)
DetourCrowd (0, 2016-05-17)
DetourCrowd\Include (0, 2016-05-17)
DetourCrowd\Include\DetourCrowd.h (16480, 2016-05-17)
DetourCrowd\Include\DetourLocalBoundary.h (1903, 2016-05-17)
DetourCrowd\Include\DetourObstacleAvoidance.h (5000, 2016-05-17)
DetourCrowd\Include\DetourPathCorridor.h (7328, 2016-05-17)
DetourCrowd\Include\DetourPathQueue.h (2222, 2016-05-17)
DetourCrowd\Include\DetourProximityGrid.h (1963, 2016-05-17)
DetourCrowd\Source (0, 2016-05-17)
... ...

# HPA-NavMesh Hierarchical Pathfinding for Navigation Meshes (HNA*) Path finding is a common problem in computer games. Most videogames require to simulate thousands or millions of agents who interact and navigate in a 3D world showing capabilities such as chasing, seeking or intercepting other agents. A new hierarchical path finding solution is proposed for large environments. Thus, a navigation mesh as abstract data structure is used in order to divide the 3D world. Then, a hierarchy of graphs is built to perform faster path finding calculations than a common A*. The benefits of this new approach are demonstrated on large world models.

近期下载者：

相关文件：

评论：[我要评论] [举报此文件]

收藏者：