A two-step method, solve in isotropic geometry then optimize to Euclidean, constructs flexible quad meshes, asymptotic-geodesic webs, and constant-angle asymptotic gridshells.
Flexible polyhedral nets in isotropic geometry
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
fields
cs.CG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
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.