Conference paper Open Access
Grasegger, Georg;
Legerský, Jan;
Schicho, Josef
In this paper we use a recent algorithm for finding flexible realizations of graphs. In particular we consider generically rigid graphs that have special non-generic instances in which edge lengths can be found such that we get a continuous motion. The graphs we present have a symmetric structure and allow flexible unit distance realizations.
Original publication available at https://archive.bridgesmathart.org/2019/bridges2019-255.html
Name | Size | |
---|---|---|
Animations.zip
md5:703fe4bb361f2689a81ecaffa39d85e5 |
771.9 kB | Download |
FlexibleGraphs.pdf
md5:82986399a866d2e8ecbc07ac5528d6ac |
2.6 MB | Download |
All versions | This version | |
---|---|---|
Views | 89 | 89 |
Downloads | 36 | 36 |
Data volume | 78.6 MB | 78.6 MB |
Unique views | 78 | 78 |
Unique downloads | 31 | 31 |