folder lists_of_Geiringer_graphs
There is a full classification of minimally rigid graphs in R^3 up to n=8 vertices considering the last Henneberg move and the generic number of complex embeddings. We also provide the number of real embeddings in all cases except for most of the 8-vertex graphs constructed by a Henneberg move in the last step.
Mixed volumes were also computed for all graphs with non-trivial number of embeddings.



folder resultsVerification_Maple
Maple scripts that verify the number of real embeddings for G48, G128 and G160.

edge_lengths.zip
Edge lengths for the graphs G16, G16a, G16b, G24, G32a, G32b, G48, G128 and G160 obtained by sampling based on Coupler curve.
The first number in a file name gives the information about the number of real embeddings.
The first edge lengths in every file were used as the starting point for the computation.