server/game2004
5
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

完成navmesh寻路基础

Browse Source
This commit is contained in:
aozhiwei 2020-08-10 19:22:52 +08:00
parent 74baec90e6
commit 0dd4f74bee
1 changed files with 41 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

43
server/gameserver/mapservice.cc
View File

@ -15,6 +15,8 @@
#include "room.h"
#include "roomobstacle.h"
static const int INVALID_NAVMESH_POLYREF = 0;
MapService::MapService()
{
INIT_LIST_HEAD(&findpath_list_);
@ -360,7 +362,7 @@ void MapService::FindPathUpdate(FindPathStatus* find_status)
filter.setExcludeFlags(0);
const float extents[3] = {2.f, 4.f, 2.f};
#if 0
dtPolyRef startRef = INVALID_NAVMESH_POLYREF;
dtPolyRef endRef = INVALID_NAVMESH_POLYREF;
@ -368,7 +370,44 @@ void MapService::FindPathUpdate(FindPathStatus* find_status)
float endNearestPt[3];
find_status->navmesh_query->findNearestPoly(spos, extents, &filter, &startRef, startNearestPt);
find_status->navmesh_query->findNearestPoly(epos, extents, &filter, &endRef, endNearestPt);
#endif
if (!startRef || !endRef) {
find_status->navmesh_search_state = kNavMesh_SearchFailed;
return;
}
const int MAX_POLYS = 256;
dtPolyRef polys[MAX_POLYS];
int npolys;
float straightPath[MAX_POLYS * 3];
unsigned char straightPathFlags[MAX_POLYS];
dtPolyRef straightPathPolys[MAX_POLYS];
int nstraightPath;
int pos = 0;
find_status->navmesh_query->findPath(startRef, endRef, startNearestPt, endNearestPt, &filter, polys, &npolys, MAX_POLYS);
nstraightPath = 0;
if (npolys) {
float epos1[3];
dtVcopy(epos1, endNearestPt);
if (polys[npolys-1] != endRef) {
find_status->navmesh_query->closestPointOnPoly(polys[npolys-1], endNearestPt, epos1, 0);
}
find_status->navmesh_query->findStraightPath(startNearestPt, endNearestPt, polys, npolys, straightPath, straightPathFlags, straightPathPolys, &nstraightPath, MAX_POLYS);
#if 0
a8::Vec3 currpos;
for(int i = 0; i < nstraightPath * 3; ) {
currpos.x = straightPath[i++];
currpos.y = straightPath[i++];
currpos.z = straightPath[i++];
paths.push_back(currpos);
pos++;
}
#endif
}
} else {
do {
find_status->search_state = find_status->astar_search.SearchStep();