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

optimize vertex generation; break edge/face generation

Browse Source
This commit is contained in:
David Allemang
2019-09-19 23:31:53 -04:00
parent 649cec0a9d
commit 583f6fef71
8 changed files with 422 additions and 659 deletions
Download Patch File Download Diff File Expand all files Collapse all files

251
cosets/include/coxeter.hpp
View File

@@ -4,90 +4,233 @@
#include <vector>
#include <algorithm>
template<int NGENS>
struct Mults;
template<int NGENS>
struct Table;
struct IRow;
template<int NGENS>
struct Mults {
int num_gens;
std::map<std::tuple<int, int>, int> mults;
const int dim = NGENS;
std::map<std::tuple<int, int>, int> mults;
Mults();
Mults() {
mults = std::map<std::tuple<int, int>, int>();
}
void set(int a, int b, int mult);
void set(int a, int b, int mult) {
if (a > b) std::swap(a, b);
mults[std::make_tuple(a, b)] = mult;
}
[[nodiscard]] int get(int a, int b) const;
[[nodiscard]] int get(int a, int b) const {
if (a == b) return 1;
if (a > b) std::swap(a, b);
[[nodiscard]] std::vector<int> relation(int a, int b) const;
const auto &tup = std::make_tuple(a, b);
const auto &res = mults.find(tup);
[[nodiscard]] std::vector<std::vector<int>> relations(const std::vector<int> &gens) const;
if (res == mults.end()) return 2;
return res->second;
}
[[nodiscard]] std::vector<std::vector<int>> irelations(const Table *table, const std::vector<int> &gens) const;
[[nodiscard]] std::vector<int> irelation(int a, int b) const {
std::vector<int> res{};
int mult = get(a, b);
[[nodiscard]] Table *solve(const std::vector<int> &subgens) const;
[[nodiscard]] Table *solve(const std::vector<int> &gens, const std::vector<int> &subgens) const;
for (int i = 0; i < mult; ++i) {
res.push_back(a);
res.push_back(b);
}
return res;
}
[[nodiscard]] Table<NGENS> *isolve(const std::vector<int> &isubgens) const;
template<int IGENS>
[[nodiscard]] Table<IGENS> *isolve(const int (&igens)[IGENS], const std::vector<int> &isubgens) const;
};
template<int NGENS>
struct Table {
const std::vector<int> gens;
const Mults mults;
std::vector<int> gen_inds;
std::vector<std::vector<int>> fwd;
std::vector<std::vector<int>> rev;
const Mults<NGENS> mults;
std::vector<std::vector<int>> fwd;
explicit Table(const std::vector<int> &gens, Mults mults);
explicit Table(Mults<NGENS> mults) : mults(mults) {
add_row();
}
[[nodiscard]] int gen_index(int gen) const;
void add_row() {
fwd.emplace_back(NGENS, -1);
}
[[nodiscard]] std::vector<int> gen_index_each(std::vector<int> rel) const;
int add_coset() {
for (int from = 0; from < (int) size(); ++from) {
for (int igen = 0; igen < (int) NGENS; igen++) {
if (iget(from, igen) < 0) {
int to = (int) size();
add_row();
iset(from, igen, to);
return to;
}
}
}
return 0;
}
void add_row();
[[nodiscard]] unsigned size() const {
return fwd.size();
}
int add_coset();
void iset(int from, int igen, int to) {
fwd[from][igen] = to;
fwd[to][igen] = from;
}
[[nodiscard]] unsigned size() const;
[[nodiscard]] int iget(int from, int igen) const {
return fwd[from][igen];
}
void set(int from, int gen, int to);
[[nodiscard]] int irget(int igen, int to) const {
return fwd[to][igen];
}
[[nodiscard]] int get(int from, int gen) const;
[[nodiscard]] int rget(int gen, int to) const;
void iset(int from, int igen, int to);
[[nodiscard]] int iget(int from, int igen) const;
[[nodiscard]] int irget(int igen, int to) const;
[[nodiscard]] std::vector<std::vector<int>> words() const;
[[nodiscard]] int apply(int e, const std::vector<int> &word) const;
[[nodiscard]] int apply(const std::vector<int> &word) const;
[[nodiscard]] std::vector<int> apply_each(int e, const std::vector<std::vector<int>> &words) const;
[[nodiscard]] std::vector<int> apply_each(const std::vector<std::vector<int>> &words) const;
};
struct IRow {
std::vector<int>::const_iterator l;
std::vector<int>::const_iterator r;
std::vector<int>::const_iterator l;
std::vector<int>::const_iterator r;
int from;
int to;
int from;
int to;
IRow(const std::vector<int> &rel, int cos);
IRow(const std::vector<int> &rel, int cos)
: l(rel.begin()), r(rel.end() - 1), from(cos), to(cos) {
}
[[nodiscard]] bool learn(Table *table);
template<int NGENS>
[[nodiscard]] bool learn(Table<NGENS> *table) {
if (r - l == 0) {
return false;
}
while (r - l > 0) {
int next = table->iget(from, *l);
if (next < 0) break;
l++;
from = next;
}
while (r - l > 0) {
int next = table->irget(*r, to);
if (next < 0) break;
r--;
to = next;
}
if (r - l == 0) {
table->iset(from, *l, to);
return true;
}
return false;
}
};
//Table *solve(const std::vector<int> &gens, const std::vector<int> &subgens, const Mults &mults);
//
//Table *solve(const std::vector<int> &subgens, const Mults &mults);
//
//Table *solve_elems(const Mults &mults);
template<int NGENS>
Mults<NGENS> schlafli(const int(&symbol)[NGENS - 1]) {
Mults<NGENS> mults{};
for (int i = 0; i < NGENS; ++i) {
mults.set(i, i + 1, symbol[i]);
}
return mults;
}
Mults schlafli(const std::vector<int> &symbol);
template<int NGENS>
Table<NGENS> *Mults<NGENS>::isolve(const std::vector<int> &isubgens) const {
auto *table = new Table<NGENS>(*this);
for (int igen : isubgens)
table->iset(0, igen, 0);
std::vector<int> all_gens(int N);
std::vector<std::vector<int>> irels{};
for (unsigned a = 0; a < NGENS; ++a) {
for (unsigned b = a + 1; b < NGENS; ++b) {
irels.push_back(irelation(a, b));
}
}
std::vector<IRow> irows;
irows.reserve(irels.size());
for (const auto &irel : irels)
irows.emplace_back(irel, 0);
while (!irows.empty()) {
while (true) {
bool learned = false;
for (int i = (int) irows.size() - 1; i >= 0; i--) {
if (irows[i].learn(table)) {
learned = true;
irows.erase(irows.begin() + i);
}
}
if (!learned)
break;
}
int i = (int) table->size();
if (table->add_coset() > 0) {
for (const auto &irel : irels)
irows.emplace_back(irel, i);
} else {
break;
}
}
return table;
}
template<int NGENS>
template<int IGENS>
Table<IGENS> *Mults<NGENS>::isolve(const int (&igens)[IGENS], const std::vector<int> &isubgens) const {
auto *table = new Table<IGENS>(*this);
for (int igen : isubgens)
table->iset(0, igen, 0);
std::vector<std::vector<int>> irels{};
for (unsigned a = 0; a < igens.size(); ++a) {
for (unsigned b = a + 1; b < igens.size(); ++b) {
irels.push_back(irelation(igens[a], igens[b]));
}
}
std::vector<IRow> irows;
irows.reserve(irels.size());
for (const auto &irel : irels)
irows.emplace_back(irel, 0);
while (!irows.empty()) {
while (true) {
bool learned = false;
for (int i = (int) irows.size() - 1; i >= 0; i--) {
if (irows[i].learn(table)) {
learned = true;
irows.erase(irows.begin() + i);
}
}
if (!learned)
break;
}
int i = (int) table->size();
if (table->add_coset() > 0) {
for (const auto &irel : irels)
irows.emplace_back(irel, i);
} else {
break;
}
}
return table;
}