Conference paper Open Access
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