Scarfski/recastnavigation
1
0
Fork 0
mirror of https://github.com/recastnavigation/recastnavigation.git synced 2026-08-15 23:59:59 +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

11
RecastDemo/Source/Sample_TileMesh.cpp
View File

@@ -949,19 +949,18 @@ unsigned char* Sample_TileMesh::buildTileMesh(
tileBoundsMin[1] = config.bmin[2];
tileBoundsMax[0] = config.bmax[0];
tileBoundsMax[1] = config.bmax[2];
int overlappingChunkIndexes[512]; // TODO: Make grow when returning too many items.
const int numOverlappingChunks =
partitionedMesh->GetChunksOverlappingRect(tileBoundsMin, tileBoundsMax, overlappingChunkIndexes, 512);
if (!numOverlappingChunks)
std::vector<int> overlappingNodes;
partitionedMesh->GetNodesOverlappingRect(tileBoundsMin, tileBoundsMax, overlappingNodes);
if (overlappingNodes.empty())
{
return 0;
}
tileTriCount = 0;
for (int i = 0; i < numOverlappingChunks; ++i)
for (int nodeIndex : overlappingNodes)
{
const PartitionedMesh::Node& node = partitionedMesh->nodes[overlappingChunkIndexes[i]];
const PartitionedMesh::Node& node = partitionedMesh->nodes[nodeIndex];
const int* nodeTris = &partitionedMesh->tris[node.triIndex * 3];
const int numNodeTris = node.numTris;