IndexedTriangle.h

Go to the documentation of this file.

// Jolt Physics Library (https://github.com/jrouwe/JoltPhysics)
// SPDX-FileCopyrightText: 2021 Jorrit Rouwe
// SPDX-License-Identifier: MIT
 
#pragma once
 
#include <Jolt/Core/HashCombine.h>
 
JPH_NAMESPACE_BEGIN
 
class IndexedTriangleNoMaterial
{
public:
    JPH_OVERRIDE_NEW_DELETE
 
                    IndexedTriangleNoMaterial() = default;
    constexpr       IndexedTriangleNoMaterial(uint32 inI1, uint32 inI2, uint32 inI3) : mIdx { inI1, inI2, inI3 } { }
 
    bool            operator == (const IndexedTriangleNoMaterial &inRHS) const
    {
        return mIdx[0] == inRHS.mIdx[0] && mIdx[1] == inRHS.mIdx[1] && mIdx[2] == inRHS.mIdx[2];
    }
 
    bool            IsEquivalent(const IndexedTriangleNoMaterial &inRHS) const
    {
        return (mIdx[0] == inRHS.mIdx[0] && mIdx[1] == inRHS.mIdx[1] && mIdx[2] == inRHS.mIdx[2])
            || (mIdx[0] == inRHS.mIdx[1] && mIdx[1] == inRHS.mIdx[2] && mIdx[2] == inRHS.mIdx[0])
            || (mIdx[0] == inRHS.mIdx[2] && mIdx[1] == inRHS.mIdx[0] && mIdx[2] == inRHS.mIdx[1]);
    }
 
    bool            IsOpposite(const IndexedTriangleNoMaterial &inRHS) const
    {
        return (mIdx[0] == inRHS.mIdx[0] && mIdx[1] == inRHS.mIdx[2] && mIdx[2] == inRHS.mIdx[1])
            || (mIdx[0] == inRHS.mIdx[1] && mIdx[1] == inRHS.mIdx[0] && mIdx[2] == inRHS.mIdx[2])
            || (mIdx[0] == inRHS.mIdx[2] && mIdx[1] == inRHS.mIdx[1] && mIdx[2] == inRHS.mIdx[0]);
    }
 
    bool            IsDegenerate(const VertexList &inVertices) const
    {
        Vec3 v0(inVertices[mIdx[0]]);
        Vec3 v1(inVertices[mIdx[1]]);
        Vec3 v2(inVertices[mIdx[2]]);
 
        return (v1 - v0).Cross(v2 - v0).IsNearZero();
    }
 
    void            Rotate()
    {
        uint32 tmp = mIdx[0];
        mIdx[0] = mIdx[1];
        mIdx[1] = mIdx[2];
        mIdx[2] = tmp;
    }
 
    Vec3            GetCentroid(const VertexList &inVertices) const
    {
        return (Vec3(inVertices[mIdx[0]]) + Vec3(inVertices[mIdx[1]]) + Vec3(inVertices[mIdx[2]])) / 3.0f;
    }
 
    uint32          mIdx[3];
};
 
class IndexedTriangle : public IndexedTriangleNoMaterial
{
public:
    using IndexedTriangleNoMaterial::IndexedTriangleNoMaterial;
 
    constexpr       IndexedTriangle(uint32 inI1, uint32 inI2, uint32 inI3, uint32 inMaterialIndex, uint inUserData = 0) : IndexedTriangleNoMaterial(inI1, inI2, inI3), mMaterialIndex(inMaterialIndex), mUserData(inUserData) { }
 
    bool            operator == (const IndexedTriangle &inRHS) const
    {
        return mMaterialIndex == inRHS.mMaterialIndex && mUserData == inRHS.mUserData && IndexedTriangleNoMaterial::operator==(inRHS);
    }
 
    IndexedTriangle GetLowestIndexFirst() const
    {
        if (mIdx[0] < mIdx[1])
        {
            if (mIdx[0] < mIdx[2])
                return IndexedTriangle(mIdx[0], mIdx[1], mIdx[2], mMaterialIndex, mUserData); // 0 is smallest
            else
                return IndexedTriangle(mIdx[2], mIdx[0], mIdx[1], mMaterialIndex, mUserData); // 2 is smallest
        }
        else
        {
            if (mIdx[1] < mIdx[2])
                return IndexedTriangle(mIdx[1], mIdx[2], mIdx[0], mMaterialIndex, mUserData); // 1 is smallest
            else
                return IndexedTriangle(mIdx[2], mIdx[0], mIdx[1], mMaterialIndex, mUserData); // 2 is smallest
        }
    }
 
    uint32          mMaterialIndex = 0;
    uint32          mUserData = 0;              
};
 
using IndexedTriangleNoMaterialList = Array<IndexedTriangleNoMaterial>;
using IndexedTriangleList = Array<IndexedTriangle>;
 
JPH_NAMESPACE_END
 
// Create a std::hash for IndexedTriangleNoMaterial and IndexedTriangle
JPH_MAKE_HASHABLE(JPH::IndexedTriangleNoMaterial, t.mIdx[0], t.mIdx[1], t.mIdx[2])
JPH_MAKE_HASHABLE(JPH::IndexedTriangle, t.mIdx[0], t.mIdx[1], t.mIdx[2], t.mMaterialIndex, t.mUserData)