123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197 |
- // David Eberly, Geometric Tools, Redmond WA 98052
- // Copyright (c) 1998-2020
- // Distributed under the Boost Software License, Version 1.0.
- // https://www.boost.org/LICENSE_1_0.txt
- // https://www.geometrictools.com/License/Boost/LICENSE_1_0.txt
- // Version: 4.0.2019.08.13
- #pragma once
- #include <Mathematics/ETManifoldMesh.h>
- // The VETManifoldMesh class represents an edge-triangle manifold mesh
- // but additionally stores vertex adjacency information.
- namespace WwiseGTE
- {
- class VETManifoldMesh : public ETManifoldMesh
- {
- public:
- // Vertex data types.
- class Vertex;
- typedef std::shared_ptr<Vertex>(*VCreator)(int);
- typedef std::map<int, std::shared_ptr<Vertex>> VMap;
- // Vertex object.
- class Vertex
- {
- public:
- virtual ~Vertex() = default;
- Vertex(int vIndex)
- :
- V(vIndex)
- {
- }
- // The index into the vertex pool of the mesh.
- int V;
- // Adjacent objects.
- std::set<int> VAdjacent;
- std::set<std::shared_ptr<Edge>> EAdjacent;
- std::set<std::shared_ptr<Triangle>> TAdjacent;
- };
- // Construction and destruction.
- virtual ~VETManifoldMesh() = default;
- VETManifoldMesh(VCreator vCreator = nullptr, ECreator eCreator = nullptr, TCreator tCreator = nullptr)
- :
- ETManifoldMesh(eCreator, tCreator),
- mVCreator(vCreator ? vCreator : CreateVertex)
- {
- }
- // Support for a deep copy of the mesh. The mVMap, mEMap, and mTMap
- // objects have dynamically allocated memory for vertices, edges, and
- // triangles. A shallow copy of the pointers to this memory is
- // problematic. Allowing sharing, say, via std::shared_ptr, is an
- // option but not really the intent of copying the mesh graph.
- VETManifoldMesh(VETManifoldMesh const& mesh)
- {
- *this = mesh;
- }
- VETManifoldMesh& operator=(VETManifoldMesh const& mesh)
- {
- Clear();
- mVCreator = mesh.mVCreator;
- ETManifoldMesh::operator=(mesh);
- return *this;
- }
- // Member access.
- inline VMap const& GetVertices() const
- {
- return mVMap;
- }
- // If <v0,v1,v2> is not in the mesh, a Triangle object is created and
- // returned; otherwise, <v0,v1,v2> is in the mesh and nullptr is
- // returned. If the insertion leads to a nonmanifold mesh, the call
- // fails with a nullptr returned.
- virtual std::shared_ptr<Triangle> Insert(int v0, int v1, int v2) override
- {
- std::shared_ptr<Triangle> tri = ETManifoldMesh::Insert(v0, v1, v2);
- if (!tri)
- {
- return nullptr;
- }
- for (int i = 0; i < 3; ++i)
- {
- int vIndex = tri->V[i];
- auto vItem = mVMap.find(vIndex);
- std::shared_ptr<Vertex> vertex;
- if (vItem == mVMap.end())
- {
- vertex = mVCreator(vIndex);
- mVMap[vIndex] = vertex;
- }
- else
- {
- vertex = vItem->second;
- }
- vertex->TAdjacent.insert(tri);
- for (int j = 0; j < 3; ++j)
- {
- auto edge = tri->E[j].lock();
- LogAssert(edge != nullptr, "Malformed mesh.");
- if (edge->V[0] == vIndex)
- {
- vertex->VAdjacent.insert(edge->V[1]);
- vertex->EAdjacent.insert(edge);
- }
- else if (edge->V[1] == vIndex)
- {
- vertex->VAdjacent.insert(edge->V[0]);
- vertex->EAdjacent.insert(edge);
- }
- }
- }
- return tri;
- }
- // If <v0,v1,v2> is in the mesh, it is removed and 'true' is returned;
- // otherwise, <v0,v1,v2> is not in the mesh and 'false' is returned.
- virtual bool Remove(int v0, int v1, int v2) override
- {
- auto tItem = mTMap.find(TriangleKey<true>(v0, v1, v2));
- if (tItem == mTMap.end())
- {
- return false;
- }
- std::shared_ptr<Triangle> tri = tItem->second;
- for (int i = 0; i < 3; ++i)
- {
- int vIndex = tri->V[i];
- auto vItem = mVMap.find(vIndex);
- LogAssert(vItem != mVMap.end(), "Malformed mesh.");
- std::shared_ptr<Vertex> vertex = vItem->second;
- for (int j = 0; j < 3; ++j)
- {
- auto edge = tri->E[j].lock();
- LogAssert(edge != nullptr, "Malformed mesh.");
- if (edge->T[0].lock() && !edge->T[1].lock())
- {
- if (edge->V[0] == vIndex)
- {
- vertex->VAdjacent.erase(edge->V[1]);
- vertex->EAdjacent.erase(edge);
- }
- else if (edge->V[1] == vIndex)
- {
- vertex->VAdjacent.erase(edge->V[0]);
- vertex->EAdjacent.erase(edge);
- }
- }
- }
- vertex->TAdjacent.erase(tri);
- if (vertex->TAdjacent.size() == 0)
- {
- LogAssert(vertex->VAdjacent.size() == 0 && vertex->EAdjacent.size() == 0,
- "Malformed mesh: Inconsistent vertex adjacency information.");
- mVMap.erase(vItem);
- }
- }
- return ETManifoldMesh::Remove(v0, v1, v2);
- }
- // Destroy the vertices, edges, and triangles to obtain an empty mesh.
- virtual void Clear() override
- {
- mVMap.clear();
- ETManifoldMesh::Clear();
- }
- protected:
- // The vertex data and default vertex creation.
- static std::shared_ptr<Vertex> CreateVertex(int vIndex)
- {
- return std::make_shared<Vertex>(vIndex);
- }
- VCreator mVCreator;
- VMap mVMap;
- };
- }
|