ENH: Use Eigen for mirrors

vis/include/mirror.hpp

@@ -8,50 +8,23 @@
 
 #include <geometry.hpp>
 
-template<class V>
+template<unsigned int N>
-float dot(int n, const V &a, const V &b) {
+Eigen::Matrix<float, N, N> mirror(const tc::Group<> &group) {
-    float sum = 0;
+    Eigen::Matrix<float, N, N> res;
-    for (int i = 0; i < n; ++i) {
+    res.setZero();
-        sum += a[i] * b[i];
-    }
-    return sum;
-}
 
-template<unsigned N>
+    for (int c = 0; c < group.rank(); ++c) {
-std::vector<vec<N>> mirror(const tc::Group<> &group) {
+        for (int r = 0; r < c; ++r) {
-    std::vector<std::vector<float>> mirrors;
+            auto angle = M_PI / group.get(c, r);
+            auto dot = res.col(c).dot(res.col(r));
 
-    for (int p = 0; p < group.rank(); ++p) {
+            res(r, c) = (cos(angle) - dot) / res(r, r);
-        std::vector<float> vp;
-        for (int m = 0; m < p; ++m) {
-            auto &vq = mirrors[m];
-            vp.push_back((cos(M_PI / group.get(p, m)) - dot(m, vp, vq)) / vq[m]);
-        }
-        vp.push_back(std::sqrt(1 - dot(p, vp, vp)));
-
-        for (const auto &v : mirrors) {
-            if (dot(p, vp, vp) > 0) {
-                for (auto &e : vp) {
-                    e *= -1;
-                }
-                break;
-            }
         }
 
-        mirrors.push_back(vp);
+        res(c, c) = sqrt(1 - res.col(c).squaredNorm());
+        res.col(c) *= -1;
     }
 
-    std::vector<vec<N>> res;
-    for (const auto &v : mirrors) {
-        vec<N> rv = vec<N>::Zero();
-
-        // ortho proj
-        for (int i = 0; i < std::min(v.size(), (size_t) N); ++i) {
-            rv[i] = v[i];
-        }
-
-        res.push_back(rv);
-    }
     return res;
 }
 
@@ -83,37 +56,42 @@ V reflect(const V &a, const V &axis) {
     return a - 2.f * project(a, axis);
 }
 
-template<class V>
+template<class Point, class Axis>
-V gram_schmidt_last(std::vector<V> vecs) {
+auto project_(const Point &point, const Axis &axis) {
-    for (int i = 0; i < vecs.size(); ++i) {
+    return axis.dot(point) / axis.dot(axis) * axis;
-        for (int j = 0; j < i; ++j) {
-            vecs[i] -= project(vecs[i], vecs[j]);
-        }
-    }
-
-    return vecs[vecs.size() - 1].normalized();
 }
 
-template<class V, class C>
+template<class Mat>
-V barycentric(const std::vector<V> &basis, const C &coords) {
+Mat gram_schmidt(Mat mat) {
-    V res = V::Zero();
+    for (int i = 0; i < mat.cols(); ++i) {
-
+        for (int j = i + 1; j < mat.cols(); ++j) {
-    int N = std::min((int) basis.size(), (int) coords.rows());
+            mat.col(j) -= project_(mat.col(j), mat.col(i));
-    for (int i = 0; i < N; ++i) {
-        res += basis[i] * coords[i];
         }
-    return res;
+    }
+    return mat;
 }
 
-template<class V>
+template<class Mat>
-std::vector<V> plane_intersections(std::vector<V> normals) {
+Mat plane_intersections(Mat normals) {
-    std::vector<V> results(normals.size());
+    auto last = normals.cols() - 1;
 
-    for (int i = 0; i < normals.size(); ++i) {
+    Mat results(normals.rows(), normals.cols());
-        std::rotate(normals.begin(), normals.begin() + 1, normals.end());
+    results.setZero();
-        results[i] = gram_schmidt_last(normals);
+
+    Eigen::Matrix<int, Mat::ColsAtCompileTime, 1> indices(normals.cols());
+    std::iota(indices.begin(), indices.end(), 0);
+
+    for (int i = 0; i < normals.cols(); ++i) {
+        std::rotate(indices.begin(), indices.begin() + 1, indices.end());
+
+        Mat cur = normals * Eigen::PermutationMatrix<Mat::ColsAtCompileTime>(indices);
+        Mat res = gram_schmidt(cur);
+
+        results.col(i) = res.col(last);
     }
 
+    results.colwise().normalize();
+
     return results;
 }
 

vis/src/main.cpp

@@ -83,12 +83,12 @@ template<class C>
 std::vector<vec4> points(const tc::Group<> &group, const C &coords) {
     auto cosets = group.solve();
     auto mirrors = mirror<5>(group);
-
-    tc::Path<vec5> path(cosets, mirrors);
-
     auto corners = plane_intersections(mirrors);
 
-    auto start = barycentric(corners, coords);
+    vec5 coord = coords;
+    auto start = corners * coord;
+
+    tc::Path<vec5> path(cosets, mirrors.colwise());
 
     std::vector<vec5> higher(path.order());
     path.walk(start, reflect<vec5>, higher.begin());