REVIEW 2 cited by
Flexible polyhedral nets in isotropic geometry
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We study flexible polyhedral nets in isotropic geometry. This geometry has a degenerate metric, but there is a natural notion of flexibility. We study infinitesimal and finite flexibility, and classify all finitely flexible polyhedral nets of arbitrary size. We show that there are just two classes, in contrast to Izmestiev's rather involved classification in Euclidean geometry, for size 3x3 only. Using these nets to initialize the optimization algorithms, we turn them into approximate Euclidean mechanisms. We also explore the smooth versions of these classes.
Forward citations
Cited by 2 Pith papers
-
Quasi-symmetric nets: A constructive approach to the equimodular elliptic type of Kokotsakis polyhedra
Quasi-symmetric nets are introduced and shown to be flexible realizations of the equimodular elliptic type of Kokotsakis polyhedra, with closed-form and numerical examples.
-
Unlocking Euclidean Problems with Isotropic Initialization
A two-step method, solve in isotropic geometry then optimize to Euclidean, constructs flexible quad meshes, asymptotic-geodesic webs, and constant-angle asymptotic gridshells.
Discussion (0). Continue with ORCID to comment.