me/toddcox-visualize-v0
Archived
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

easier distinction between orientations

Browse Source
This commit is contained in:
David Allemang
2019-09-15 16:19:10 -04:00
parent bf3eb139b4
commit 5451196183
2 changed files with 10 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
cosets/src/main.cpp
View File

@@ -40,7 +40,7 @@ public:
const int N = 3;
const Mults &mults = schlafli<N>({5, 3});
vert_data = vertices<N>(mults, {5, 1, 1});
vert_data = vertices<N>(mults, {1, 1, 1});
edge_data = edges<N>(mults);
face_data = faces<N>(mults);
@@ -112,8 +112,8 @@ public:
glEnable(GL_CULL_FACE);
glBindVertexArray(vert_vao);
glUniform4f(0, 1, 1, 1, 1);
// glDrawArrays(GL_POINTS, 0, vert_data.size());
glUniform4f(0, 1, 0, 0, 1);
glDrawArrays(GL_POINTS, 0, vert_data.size());
glBindVertexArray(edge_vao);
glUniform4f(0, 1, 0, 0, 1);

14
cosets/src/util/mesh.hpp
View File

@@ -70,11 +70,15 @@ std::vector<int> faces(const Mults &mults) {
Table *t_vert = solve<N>({}, mults);
// todo: try the combinations individually and try to find the pattern.
// for each *kind* of face
// std::vector<int> sg_face{0,1};
for (const auto &sg_face : combinations(N, 2)) {
Table *cs_face = solve<N>(sg_face, mults);
// for each *kind* of edge
// std::vector<int> sg_edge{1};
for (const auto &sg_edge : combinations(sg_face, 1)) {
Table *cs_edge = solve(sg_face, sg_edge, mults);
@@ -95,17 +99,13 @@ std::vector<int> faces(const Mults &mults) {
}
res.push_back(t_vert->apply(0, c_face));
int s = 0;
s += c_edge.size();
s += c_face.size();
s += sg_edge[0];
s += sg_face[0] + sg_face[1];
int s = c_edge.size() + sg_edge[0];
int t = c_face.size() + sg_face[0] + sg_face[1];
if (s % 2 == 0) {
if (s % 2 == 0 xor t % 2 == 0) {
std::swap(res[res.size() - 1], res[res.size() - 2]);
}
}
// break;
}
}
}