SearcharxivSearch

arXiv · 2412.04491

Soft cells, Kelvin's foam and the minimal surfaces of Schwarz

Abstract

Recently, we introduced a new class of shapes, called soft cells which fill space as soft tilings without gaps and overlaps while minimizing the number of sharp corners. We introduced the edge bending algorithm that deforms a polyhedral tiling into a soft tiling and we proved that an infinite class of polyhedral tilings can be smoothly deformed into standard soft tilings. Here, we demonstrate that certain triply periodic minimal surfaces naturally give rise to non-standard soft tilings. By extending the edge-bending algorithm, we further establish that the soft tilings derived from the Schwarz P and Schwarz D surfaces can be continuously transformed into one another through a one-parameter family of intermediate non-standard soft tilings. Notably, by carrying its combinatorial structure, both resulting tilings belong to the first order equivalence class of the Dirichlet-Voronoi tiling on the body-centered cubic bcc lattice, highlighting a deep geometric connection underlying these minimal surface configurations. By requiring identical end-tangents for edges in a first order class, we also define second order equivalence classes among tilings and prove that there exist exactly two such classes among soft tilings which share the full symmetry group of the DV-bcc tiling. Additionally, we construct a one-parameter family of tilings bridging standard and non-standard soft tilings, explicitly including the classic Kelvin foam structure as an intermediate configuration. This construction highlights that both the soft cells themselves and the geometric methods employed in their generation provide valuable insights into the structural principles underlying natural forms. We also present the soft tiling induced by the gyroid structure.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gábor Domokos, Alain Goriely, Ákos G. Horváth, Krisztina Regős. 2024-11-23. Soft cells, Kelvin's foam and the minimal surfaces of Schwarz. https://arxiv.org/abs/2412.04491

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

KEEP EXPLORING

Related papers

Almost Linear Universal Point Sets for Planar Graphs

A point set is universal for planar graphs on $n$ vertices if every such graph has a straight-line drawing without crossings whose vertices belong to the set. We construct universal point sets of size $n^{1+o(1)}$, improving the previous quadratic upper bound. Our construction uses the reduction of Bannister, Cheng, Devanny, and Eppstein from universal point sets to superpatterns for $213$-avoiding permutations. We represent these permutations by ordered rooted forests and construct a small family of intervals containing every such forest. The result follows from a straightforward bound on the size of the family of intervals. GPT-6 Astra assisted in developing the construction and proof.

cs.CG

Some results on Archdeacon's conjecture for rotation systems

A rotation system on $n$ elements assigns to each element a cyclic order of the other $n-1$ elements. A four-element subset is non-planar if its induced rotation system cannot be realized by a crossing-free drawing of $K_4$. As a combinatorial strengthening of Hill's conjecture on the crossing number of the complete graph, Archdeacon conjectured that every rotation system on $n$ elements has at least $H(n)=\frac{1}{4} \lfloor\frac {n}{2}\rfloor \lfloor\frac{n-1}{2}\rfloor \lfloor\frac{n-2}{2}\rfloor \lfloor\frac{n-3}{2}\rfloor$ non-planar four-element subsets. We computationally verify Archdeacon's conjecture for $n\leq 10$ and show that every extremal rotation system in these orders is realizable by a simple drawing. With computer assistance, we prove that every rotation system on $n$ elements has at least $(8/9 - o(1)) H(n)$ non-planar four-element subsets. We also present a proof by hand for a weaker lower bound of $(2/3-o(1)) H(n)$. Finally, extending recent work of Felsner on antipodal pairs in drawings, we show that Archdeacon's conjecture holds for antipodally shellable rotation systems.

cs.CG

The Hyperbolic Surface Distance, Diameter, and Dirichlet Problems

Despite the prominence of hyperbolic surfaces in mathematics, basic algorithmic questions about them, even computing the distance between two points, have remained open, leaving many features of these surfaces inaccessible. The classical machinery assumes a polyhedral structure absent on a smooth surface. We remove these obstacles. We begin with an efficient $O(g^2)$ algorithm for the distance between two points, where $g$ is the genus of the surface. Building on it, we obtain an $O(g^2 \log g)$ method for answering distance queries from a fixed source and, as a consequence, for recentering a Dirichlet domain around an arbitrary point. This understanding of distances on the surface then lets us approximate the diameter to within any $\eps$ in time $O(g^3 \log g / \eps^2)$. We further show that the diameter, a single real number encoding a great deal about the surface, is exactly computable. Its hyperbolic cosine is an algebraic number over the field encoding the coefficients of the hyperbolic isometries defining the surface.

cs.CG