1 citations · 1 across the 6 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.CG2025
Unfolding Boxes with Local Constraints
Long Qian, Eric Wang, Bernardo Subercaseaux +1
We consider the problem of finding and enumerating polyominos that can be folded into multiple non-isomorphic boxes. While several computational approaches have been proposed, incl…
cs.DM2025
Automated Symmetric Constructions in Discrete Geometry
Bernardo Subercaseaux, Ethan Mackey, Long Qian +1
We present a computational methodology for obtaining rotationally symmetric sets of points satisfying discrete geometric constraints, and demonstrate its applicability by discoveri…