Algorithm computes Dirichlet cells for crystallographic groups via bounded-length words in generators and applies it to topological interlocking.
Goertzen.Constructing Interlocking Assemblies with Crystallographic Symmetries
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.MG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An algorithmic approach for computing fundamental domains of crystallographic groups
Algorithm computes Dirichlet cells for crystallographic groups via bounded-length words in generators and applies it to topological interlocking.