SearcharxivSearch

arXiv · 2604.22475

Construction Methods for Space-Filling Heterogeneous Topological Interlocking Assemblies

Abstract

Deforming fundamental domains of wallpaper groups provides a systematic way to generate non-convex blocks which admit topological interlocking assemblies (TIAs). We use this approach to construct TIAs that fully occupy the space between two parallel planes and incorporate multiple block types. In addition to wallpaper groups, semiregular tessellations are employed in the construction of such TIAs. These construction methods open up an extensive design space for TIAs, expanding the possibilities of feasible interlocking systems and creating new opportunities for architectural and material design. Several resulting block families can be interpreted as geometric realizations of generalized Truchet tiles or decorated lozenge tilings and, with suitable colouring rules, we establish a one-to-one correspondence between these tilings and specific TIAs. This framework enables a systematic investigation of symmetric and asymmetric assemblies derived from diverse block types.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Meike Weiß, Alice C. Niemeyer. 2026-04-24. Construction Methods for Space-Filling Heterogeneous Topological Interlocking Assemblies. https://arxiv.org/abs/2604.22475

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR