allemang.d/toddcox-visualize
1
0
Fork 0
mirror of https://github.com/allemangD/toddcox-visualize.git synced 2025-11-10 03:52:48 -05:00
Code Issues Packages Projects Releases Wiki Activity
153 Commits 6 Branches 1 Tag
01043e9bce34971c817c0c1e190bd2e9e493fdec
Go to file
Clone
Open with VS Code Open with VSCodium Open with Intellij IDEA
Download ZIP Download TAR.GZ Download BUNDLE
David Allemang 01043e9bce Replace ComboIterator with std::set<std::vector<int>> via combinations.hpp 
Since the number of generators never exceeds 6, the maximum number of combinations is (6, 3) = 20, so the space optimizations of using an iterator is mute.

Doing this way also allows to use set_difference and set_union to deal with collections of subgroups. This is not easily possible otherwise.
2020-10-24 23:06:52 -04:00
.idea
load wireframes from files
2020-03-18 17:29:12 -04:00
examples
remove memo examples since memo is removed
2020-01-30 15:58:43 -05:00
images
pretty pictures
2020-03-11 01:45:27 -04:00
vendor
introduce Mesh class with subgroup context
2020-10-14 17:14:25 -04:00
vis
Replace ComboIterator with std::set<std::vector<int>> via combinations.hpp
2020-10-24 23:06:52 -04:00
.gitignore
create cmake project
2019-12-26 23:21:49 -05:00
.gitmodules
Remove top-level glfw submodule
2020-10-10 23:00:41 -04:00
CMakeLists.txt
Migrate to NanoGUI / Eigen for GUI and linear algebra.
2020-10-10 22:59:51 -04:00
README.md
pretty pictures
2020-03-11 01:45:27 -04:00

README.md

toddcox-visualize

Example render Example render

Example render Example render Example render Example render

Description
A new (basic) implementation of the Todd-Coxeter algorithm for Coxeter groups in C++ that beats GAP.
Readme 2 MiB
Languages
C++ 93.2%
CMake 5.9%
GLSL 0.9%