Scarfski/recastnavigation
1
0
Fork 0
mirror of https://github.com/recastnavigation/recastnavigation.git synced 2026-08-16 08:09:53 +00:00
Code Issues Packages Projects Releases Wiki Activity

Improved return method for node indexes from partitioned mesh queries

Browse Source
This commit is contained in:
Graham Pentheny
2025-08-06 13:03:45 -04:00
parent 47f82a60cd
commit e79906ee48
5 changed files with 39 additions and 52 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
RecastDemo/Source/Sample_TempObstacles.cpp
View File

@@ -597,16 +597,16 @@ int Sample_TempObstacles::rasterizeTileLayers(
tbmin[1] = tcfg.bmin[2];
tbmax[0] = tcfg.bmax[0];
tbmax[1] = tcfg.bmax[2];
int cid[512]; // TODO: Make grow when returning too many items.
const int ncid = partitionedMesh->GetChunksOverlappingRect(tbmin, tbmax, cid, 512);
if (!ncid)
std::vector<int> overlappingNodes;
partitionedMesh->GetNodesOverlappingRect(tbmin, tbmax, overlappingNodes);
if (overlappingNodes.empty())
{
return 0; // empty
return 0;
}
for (int i = 0; i < ncid; ++i)
for (int nodeIndex : overlappingNodes)
{
const PartitionedMesh::Node& node = partitionedMesh->nodes[cid[i]];
const PartitionedMesh::Node& node = partitionedMesh->nodes[nodeIndex];
const int* tris = &partitionedMesh->tris[node.triIndex * 3];
const int ntris = node.numTris;