diff --git a/vis/include/geometry.hpp b/vis/include/geometry.hpp
index 2b89093..265d834 100644
--- a/vis/include/geometry.hpp
+++ b/vis/include/geometry.hpp
@@ -284,173 +284,3 @@ Mesh<1> triangulate<1>(
     res.prims.emplace_back();
     return res;
 }
-
-//template<unsigned N>
-//struct GeomGen {
-//    std::vector<std::vector<std::optional<tc::Cosets>>> coset_memo;
-//    std::vector<std::optional<Mesh<N>>> triangulate_memo;
-//    tc::Group &context;
-//
-//    explicit GeomGen(tc::Group &g) : context(g) {
-//        size_t num_sg = std::pow(2, g.ngens);
-//        coset_memo.resize(num_sg);
-//        triangulate_memo.resize(num_sg);
-//        for (size_t i = 0; i < num_sg; i++) {
-//            auto num_sg_sg = std::pow(2, num_gens_from_key(i));
-//            coset_memo[i].resize(num_sg_sg, std::nullopt);
-//        }
-//    }
-//
-//    std::vector<int> group_gens() {
-//        std::vector<int> gens(context.ngens);
-//        for (int i = 0; i < context.ngens; i++) {
-//            gens[i] = i;
-//        }
-//        return gens;
-//    }
-//
-//    std::vector<int> prepare_gens(std::vector<int> &g_gens, std::vector<int> &sg_gens) {
-//        std::sort(g_gens.begin(), g_gens.end());
-//
-//        int inv_gen_map[context.ngens];
-//        for (size_t i = 0; i < g_gens.size(); i++) {
-//            inv_gen_map[g_gens[i]] = i;
-//        }
-//
-//        std::vector<int> s_sg_gens;
-//        s_sg_gens.reserve(sg_gens.size());
-//        for (const auto gen : sg_gens) {
-//            s_sg_gens.push_back(inv_gen_map[gen]);
-//        }
-//        std::sort(s_sg_gens.begin(), s_sg_gens.end());
-//
-//        return s_sg_gens;
-//    }
-//
-//    int get_parity(std::vector<int> &g_gens, std::vector<int> &sg_gens) {
-//        if (g_gens.size() != sg_gens.size() + 1)
-//            return 0;
-//        auto s_sg_gens = prepare_gens(g_gens, sg_gens);
-//        const int loop_max = g_gens.size() - 1;
-//        for (int i = 0; i < loop_max; i++) {
-//            if (s_sg_gens[i] != i)
-//                return i % 2;
-//        }
-//        return loop_max % 2;
-//    }
-//
-//    tc::Cosets _solve(std::vector<int> &g_gens, std::vector<int> &sg_gens) {
-//        auto s_sg_gens = prepare_gens(g_gens, sg_gens);
-//
-//        size_t group_key = get_key_from_gens(g_gens);
-//        size_t subgroup_key = get_key_from_gens(s_sg_gens);
-//
-//        if (!coset_memo[group_key][subgroup_key]) {
-//            tc::SubGroup g = context.subgroup(g_gens);
-//            coset_memo[group_key][subgroup_key] = g.solve(s_sg_gens);
-//        }
-//        return *coset_memo[group_key][subgroup_key];
-//    }
-//
-//    tc::Cosets solve(std::vector<int> g_gens, std::vector<int> sg_gens) {
-//        return _solve(g_gens, sg_gens);
-//    }
-//
-//    tc::Cosets solve_sg(std::vector<int> &sg_gens) {
-//        auto g_gens = group_gens();
-//        return _solve(g_gens, sg_gens);
-//    }
-//
-//    tc::Cosets solve_g(std::vector<int> &g_gens) {
-//        std::vector<int> sg_gens;
-//        return _solve(g_gens, sg_gens);
-//    }
-//
-//    tc::Cosets solve() {
-//        std::vector<int> sg_gens;
-//        return solve_sg(sg_gens);
-//    }
-//
-//    Mesh<N> recontext(std::vector<int> &g_gens, std::vector<int> &sg_gens, const Mesh<N> &items) {
-//        auto s_sg_gens = prepare_gens(g_gens, sg_gens);
-//        auto table = solve_g(g_gens);
-//        auto path = solve_g(sg_gens).path;
-//
-//        auto coset_map = [table](int coset, int gen) { return table.get(coset, gen); };
-//
-//        auto map = path.template walk<int, int>(0, s_sg_gens, coset_map);
-//
-//        Mesh<N> ret;
-//        ret.vals.reserve(items.size());
-//        for (const auto val : items.vals) {
-//            ret.vals.push_back(map[val]);
-//        }
-//        if (get_parity(g_gens, sg_gens) == 1)
-//            ret.flip();
-//        return ret;
-//    }
-//
-//    Mesh<N> tile(std::vector<int> &g_gens, std::vector<int> &sg_gens, const Mesh<N> &items) {
-//        Mesh<N> base = recontext(g_gens, sg_gens, items);
-//        auto s_sg_gens = prepare_gens(g_gens, sg_gens);
-//        auto table = solve_g(g_gens);
-//        auto path = _solve(g_gens, sg_gens).path;
-//
-//        auto simplex_map = [table](Mesh<N> from, int gen) -> Mesh<N> {
-//            for (auto &prim : from.prims) {
-//                prim.apply(table, gen);
-//            }
-//            from.flip();
-//            return from;
-//        };
-//
-//        auto r = path.template walk<Mesh<N>, int>(base, group_gens(), simplex_map);
-//
-//        return merge(r);
-//    }
-//
-//    Mesh<N> triangulate(std::vector<int> &g_gens);
-//
-//    Mesh<1> _triangulate(std::vector<int> &g_gens) {
-//        Mesh<1> m;
-//        m.prims.emplace_back();
-//        return m;
-//    }
-//
-//    Mesh<N> _triangulate(std::vector<int> &g_gens) {
-//
-//        Mesh<N> S;
-//        if (g_gens.empty()) {
-//            S.prims.push_back(Primitive<N>());
-//            return S;
-//        }
-//
-//        GeomGen<N - 1> gg(context);
-//        for (std::vector<int> sg_gens : Combos(g_gens, g_gens.size() - 1)) {
-//            Mesh<N - 1> sub_simps = gg.triangulate(sg_gens);
-//            int start = sub_simps.size();
-//            Mesh<N - 1> raised = tile(g_gens, sg_gens, sub_simps);
-//
-//            for (const Primitive<N - 1> &prim : raised.prims) {
-//                S.prims.push_back(Primitive<N>(prim, 0));
-//            }
-//
-////            for (int l = start; l < raised.size(); l += g_gens.size()) {
-////                for (int m = l; m < l + g_gens.size(); m++) {
-////                    S.vals.push_back(raised.vals[m]);
-////                }
-////                S.vals.push_back(0);
-////            }
-//        }
-//        return S;
-//    }
-//};
-//
-//template<unsigned N>
-//Mesh<N> GeomGen<N>::triangulate(std::vector<int> &g_gens) {
-//    int key = get_key_from_gens(g_gens);
-//    if (!triangulate_memo[key]) {
-//        triangulate_memo[key] = _triangulate(g_gens);
-//    }
-//    return *triangulate_memo[key];
-//}