An algorithm for computing the number of realizations of a Laman graph

Jose Capco, Matteo Gallet, Georg Grasegger, Christoph Koutschan, Niels Lubbes, Josef Schicho · Zenodo (CERN European Organization for Nuclear Research) · 2018

These files contain implementations of the main algorithm of Capco, Gallet, Grasegger, Koutschan, Lubbes and Schicho (10.1137/17M1118312) for computing the number of complex realizations for minimally rigid graphs. LamanGraphs.wl Mathematica package with implementation including code for constructing Laman graphs LamanGraphsExamples.txt Examples using the Mathematica package for testing functionality laman.cpp C++ implementation

Read the paper · More papers on PaperTik