Automated Symmetric Constructions in Discrete GeometryBernardo Subercaseaux, Ethan Mackey, Long Qian, Marijn J. H. Heulehttps://arxiv.org/abs/2506.00224 …
Automated Symmetric Constructions in Discrete GeometryWe present a computational methodology for obtaining rotationally symmetric sets of points satisfying discrete geometric constraints, and demonstrate its applicability by discovering new solutions to some well-known problems in combinatorial geometry. Our approach takes the usage of SAT solvers in discrete geometry further by directly embedding rotational symmetry into the combinatorial encoding of geometric configurations. Then, to realize concrete point sets corresponding to abstract designs …