pith. sign in

arxiv: 1805.03708 · v3 · pith:7X4SS4YJnew · submitted 2018-05-09 · ❄️ cond-mat.dis-nn · cond-mat.soft

Disordered auxetic networks with no re-entrant polygons

classification ❄️ cond-mat.dis-nn cond-mat.soft
keywords polygonsre-entrantsimeqdisorderedauxeticdesignnetworkspoisson
0
0 comments X
read the original abstract

It is widely assumed that disordered auxetic structures (i.e. structures with a negative Poisson's ratio) must contain re-entrant polygons in $2$D and re-entrant polyhedra in $3$D. Here we show how to design disordered networks in $2$D with only convex polygons. The design principles used allow for any Poisson ratio $-1 < \nu < 1/3$ to be obtained with a prescriptive algorithm. By starting from a Delaunay triangulation with a mean coordination $<z> \simeq 6$ and $\nu \simeq 0.33$ and removing those edges that decrease the shear modulus by the least without creating any re-entrant polygons, the system evolves monotonically towards the isostatic point with $<z> \simeq 4$ and $\nu \simeq -1$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.