-
Notifications
You must be signed in to change notification settings - Fork 12
/
Copy pathMeshAdjacencyTable.cpp
46 lines (38 loc) · 1012 Bytes
/
MeshAdjacencyTable.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
#include "MeshAdjacencyTable.h"
using namespace std;
using namespace MeshSdf;
namespace
{
pair<int,int> NormalizedEdge(int vert1, int vert2)
{
return minmax(vert1, vert2);
}
}
MeshAdjacencyTable::MeshAdjacencyTable(vector<array<int, 3>> const& tris, int numVerts)
: tris(tris), vert2tris(numVerts)
{
for (auto itri = 0; itri < tris.size(); ++itri)
{
auto v0 = tris[itri][0];
auto v1 = tris[itri][1];
auto v2 = tris[itri][2];
vert2tris[v0].push_back(itri);
vert2tris[v1].push_back(itri);
vert2tris[v2].push_back(itri);
auto e0 = NormalizedEdge(v0, v1);
auto e1 = NormalizedEdge(v1, v2);
auto e2 = NormalizedEdge(v2, v0);
edge2tris[e0].push_back(itri);
edge2tris[e1].push_back(itri);
edge2tris[e2].push_back(itri);
}
}
std::vector<int> MeshAdjacencyTable::Edge2Tris(int edgeVert1, int edgeVert2) const
{
auto e = NormalizedEdge(edgeVert1, edgeVert2);
return edge2tris.at(e);
}
std::vector<int> MeshAdjacencyTable::Vert2Tris(int vert) const
{
return vert2tris.at(vert);
}