Flexible polyhedral nets in isotropic geometry
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917992892203008 |
|---|---|
| author | Pirahmad, O. Pottmann, H. Skopenkov, M. |
| author_facet | Pirahmad, O. Pottmann, H. Skopenkov, M. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_15060 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Flexible polyhedral nets in isotropic geometry Pirahmad, O. Pottmann, H. Skopenkov, M. Metric Geometry 52C25, 53A35, 53A70, 53A05 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. |
| title | Flexible polyhedral nets in isotropic geometry |
| topic | Metric Geometry 52C25, 53A35, 53A70, 53A05 |
| url | https://arxiv.org/abs/2504.15060 |