Team-Immerse-Yourself/YouDunIt
6
0
Fork 0
Code Issues Pull requests Projects 2 Releases Packages Wiki Activity Actions

feat: modules moved and engine moved to submodule

Browse source
This commit is contained in:
Jan van der Weide 2025-04-12 18:40:44 +02:00
parent dfb5e645cd
commit c33d2130cc
5136 changed files with 225275 additions and 64485 deletions
Download patch file Download diff file Expand all files Collapse all files

30
engine/thirdparty/jolt_physics/Jolt/TriangleSplitter/TriangleSplitter.cpp vendored
View file

@ -13,7 +13,7 @@ TriangleSplitter::TriangleSplitter(const VertexList &inVertices, const IndexedTr
mTriangles(inTriangles)
{
mSortedTriangleIdx.resize(inTriangles.size());
mCentroids.resize(inTriangles.size());
mCentroids.resize(inTriangles.size() + 1); // Add 1 so we can load with Vec3::sLoadFloat3Unsafe
for (uint t = 0; t < inTriangles.size(); ++t)
{
@ -23,44 +23,50 @@ TriangleSplitter::TriangleSplitter(const VertexList &inVertices, const IndexedTr
// Calculate centroid
inTriangles[t].GetCentroid(inVertices).StoreFloat3(&mCentroids[t]);
}
// Make sure Vec3::sLoatFloat3Unsafe doesn't read uninitialized data
mCentroids.back() = Float3(0, 0, 0);
}
bool TriangleSplitter::SplitInternal(const Range &inTriangles, uint inDimension, float inSplit, Range &outLeft, Range &outRight)
{
// Divide triangles
uint start = inTriangles.mBegin, end = inTriangles.mEnd;
uint *start = mSortedTriangleIdx.data() + inTriangles.mBegin;
uint *end = mSortedTriangleIdx.data() + inTriangles.mEnd;
while (start < end)
{
// Search for first element that is on the right hand side of the split plane
while (start < end && mCentroids[mSortedTriangleIdx[start]][inDimension] < inSplit)
while (start < end && mCentroids[*start][inDimension] < inSplit)
++start;
// Search for the first element that is on the left hand side of the split plane
while (start < end && mCentroids[mSortedTriangleIdx[end - 1]][inDimension] >= inSplit)
while (start < end && mCentroids[*(end - 1)][inDimension] >= inSplit)
--end;
if (start < end)
{
// Swap the two elements
std::swap(mSortedTriangleIdx[start], mSortedTriangleIdx[end - 1]);
++start;
--end;
std::swap(*start, *end);
++start;
}
}
JPH_ASSERT(start == end);
uint start_idx = uint(start - mSortedTriangleIdx.data());
#ifdef JPH_ENABLE_ASSERTS
// Validate division algorithm
JPH_ASSERT(inTriangles.mBegin <= start);
JPH_ASSERT(start <= inTriangles.mEnd);
for (uint i = inTriangles.mBegin; i < start; ++i)
JPH_ASSERT(inTriangles.mBegin <= start_idx);
JPH_ASSERT(start_idx <= inTriangles.mEnd);
for (uint i = inTriangles.mBegin; i < start_idx; ++i)
JPH_ASSERT(mCentroids[mSortedTriangleIdx[i]][inDimension] < inSplit);
for (uint i = start; i < inTriangles.mEnd; ++i)
for (uint i = start_idx; i < inTriangles.mEnd; ++i)
JPH_ASSERT(mCentroids[mSortedTriangleIdx[i]][inDimension] >= inSplit);
#endif
outLeft = Range(inTriangles.mBegin, start);
outRight = Range(start, inTriangles.mEnd);
outLeft = Range(inTriangles.mBegin, start_idx);
outRight = Range(start_idx, inTriangles.mEnd);
return outLeft.Count() > 0 && outRight.Count() > 0;
}