forked from bit/DotRecastNetSim
56 lines
2.7 KiB
C#
56 lines
2.7 KiB
C#
|
/*
|
||
|
|
recast4j copyright (c) 2021 Piotr Piastucki piotr@jtilia.org
|
||
|
|
|
||
|
|
This software is provided 'as-is', without any express or implied
|
||
|
|
warranty. In no event will the authors be held liable for any damages
|
||
|
|
arising from the use of this software.
|
||
|
|
Permission is granted to anyone to use this software for any purpose,
|
||
|
|
including commercial applications, and to alter it and redistribute it
|
||
|
|
freely, subject to the following restrictions:
|
||
|
|
1. The origin of this software must not be misrepresented; you must not
|
||
|
|
claim that you wrote the original software. If you use this software
|
||
|
|
in a product, an acknowledgment in the product documentation would be
|
||
|
|
appreciated but is not required.
|
||
|
|
2. Altered source versions must be plainly marked as such, and must not be
|
||
|
|
misrepresented as being the original software.
|
||
|
|
3. This notice may not be removed or altered from any source distribution.
|
||
|
|
*/
|
||
|
|
|
||
|
|
using static DotRecast.Detour.DetourCommon;
|
||
|
|
|
||
|
|
namespace DotRecast.Detour.Extras;
|
||
|
|
|
||
|
|
public class BVTreeBuilder {
|
||
|
|
|
||
|
|
public void build(MeshData data) {
|
||
|
|
data.bvTree = new BVNode[data.header.polyCount * 2];
|
||
|
|
data.header.bvNodeCount = data.bvTree.Length == 0 ? 0
|
||
|
|
: createBVTree(data, data.bvTree, data.header.bvQuantFactor);
|
||
|
|
}
|
||
|
|
|
||
|
|
private static int createBVTree(MeshData data, BVNode[] nodes, float quantFactor) {
|
||
|
|
NavMeshBuilder.BVItem[] items = new NavMeshBuilder.BVItem[data.header.polyCount];
|
||
|
|
for (int i = 0; i < data.header.polyCount; i++) {
|
||
|
|
NavMeshBuilder.BVItem it = new NavMeshBuilder.BVItem();
|
||
|
|
items[i] = it;
|
||
|
|
it.i = i;
|
||
|
|
float[] bmin = new float[3];
|
||
|
|
float[] bmax = new float[3];
|
||
|
|
vCopy(bmin, data.verts, data.polys[i].verts[0] * 3);
|
||
|
|
vCopy(bmax, data.verts, data.polys[i].verts[0] * 3);
|
||
|
|
for (int j = 1; j < data.polys[i].vertCount; j++) {
|
||
|
|
vMin(bmin, data.verts, data.polys[i].verts[j] * 3);
|
||
|
|
vMax(bmax, data.verts, data.polys[i].verts[j] * 3);
|
||
|
|
}
|
||
|
|
it.bmin[0] = clamp((int) ((bmin[0] - data.header.bmin[0]) * quantFactor), 0, 0x7fffffff);
|
||
|
|
it.bmin[1] = clamp((int) ((bmin[1] - data.header.bmin[1]) * quantFactor), 0, 0x7fffffff);
|
||
|
|
it.bmin[2] = clamp((int) ((bmin[2] - data.header.bmin[2]) * quantFactor), 0, 0x7fffffff);
|
||
|
|
it.bmax[0] = clamp((int) ((bmax[0] - data.header.bmin[0]) * quantFactor), 0, 0x7fffffff);
|
||
|
|
it.bmax[1] = clamp((int) ((bmax[1] - data.header.bmin[1]) * quantFactor), 0, 0x7fffffff);
|
||
|
|
it.bmax[2] = clamp((int) ((bmax[2] - data.header.bmin[2]) * quantFactor), 0, 0x7fffffff);
|
||
|
|
}
|
||
|
|
return NavMeshBuilder.subdivide(items, data.header.polyCount, 0, data.header.polyCount, 0, nodes);
|
||
|
|
}
|
||
|
|
|
||
|
|
}
|