Published May 1, 2018 | Version v1
Software Open

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

Creators

  • 1. Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz
  • 2. Johann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences

Contributors

Contact person:

Description

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

Files

LamanGraphsExamples.txt

Files (34.6 kB)

Name Size Download all
md5:0a4c3c79f061af612dffa58d3ea5e55b
12.3 kB Download
md5:33c0532f951089e3d715fdf0a9a0b3e2
19.8 kB Download
md5:fa00b9dc568260ce830ca3b9987057c2
1.4 kB Preview Download
md5:50da26f3c51133b72f1b55f6461da341
1.1 kB Preview Download

Additional details

Related works

Compiles
10.5281/zenodo.1245517 (DOI)
Is documented by
10.1137/17M1118312 (DOI)

Funding

Algebraic Methods in Kinematics: Motion Factorisation and Bond Theory P 26607
FWF Austrian Science Fund
Algebraic path-planning of 6R/P Manipulators P 28349
FWF Austrian Science Fund
Computational Mathematics: Numerical Analysis and Symbolic Computation W 1214
FWF Austrian Science Fund
Algorithmic and Enumerative Combinatorics F 50
FWF Austrian Science Fund

References

  • J. Capco, M. Gallet, G. Grasegger, C. Koutschan, N. Lubbes, and J. Schicho. The number of realizations of a Laman graph. SIAM Journal on Applied Algebra and Geometry, 2(1):94–125, 2018, doi: 10.1137/17M1118312