TriangleSplitter.cpp 2.0 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667
  1. // Jolt Physics Library (https://github.com/jrouwe/JoltPhysics)
  2. // SPDX-FileCopyrightText: 2021 Jorrit Rouwe
  3. // SPDX-License-Identifier: MIT
  4. #include <Jolt/Jolt.h>
  5. #include <Jolt/TriangleSplitter/TriangleSplitter.h>
  6. JPH_NAMESPACE_BEGIN
  7. TriangleSplitter::TriangleSplitter(const VertexList &inVertices, const IndexedTriangleList &inTriangles) :
  8. mVertices(inVertices),
  9. mTriangles(inTriangles)
  10. {
  11. mSortedTriangleIdx.resize(inTriangles.size());
  12. mCentroids.resize(inTriangles.size());
  13. for (uint t = 0; t < inTriangles.size(); ++t)
  14. {
  15. // Initially triangles start unsorted
  16. mSortedTriangleIdx[t] = t;
  17. // Calculate centroid
  18. inTriangles[t].GetCentroid(inVertices).StoreFloat3(&mCentroids[t]);
  19. }
  20. }
  21. bool TriangleSplitter::SplitInternal(const Range &inTriangles, uint inDimension, float inSplit, Range &outLeft, Range &outRight)
  22. {
  23. // Divide triangles
  24. uint start = inTriangles.mBegin, end = inTriangles.mEnd;
  25. while (start < end)
  26. {
  27. // Search for first element that is on the right hand side of the split plane
  28. while (start < end && mCentroids[mSortedTriangleIdx[start]][inDimension] < inSplit)
  29. ++start;
  30. // Search for the first element that is on the left hand side of the split plane
  31. while (start < end && mCentroids[mSortedTriangleIdx[end - 1]][inDimension] >= inSplit)
  32. --end;
  33. if (start < end)
  34. {
  35. // Swap the two elements
  36. swap(mSortedTriangleIdx[start], mSortedTriangleIdx[end - 1]);
  37. ++start;
  38. --end;
  39. }
  40. }
  41. JPH_ASSERT(start == end);
  42. #ifdef JPH_ENABLE_ASSERTS
  43. // Validate division algorithm
  44. JPH_ASSERT(inTriangles.mBegin <= start);
  45. JPH_ASSERT(start <= inTriangles.mEnd);
  46. for (uint i = inTriangles.mBegin; i < start; ++i)
  47. JPH_ASSERT(mCentroids[mSortedTriangleIdx[i]][inDimension] < inSplit);
  48. for (uint i = start; i < inTriangles.mEnd; ++i)
  49. JPH_ASSERT(mCentroids[mSortedTriangleIdx[i]][inDimension] >= inSplit);
  50. #endif
  51. outLeft = Range(inTriangles.mBegin, start);
  52. outRight = Range(start, inTriangles.mEnd);
  53. return outLeft.Count() > 0 && outRight.Count() > 0;
  54. }
  55. JPH_NAMESPACE_END