Published July 8, 2022
| Version v1
Software
Open
Software for counting realizations of minimally rigid graphs on the sphere
Authors/Creators
- 1. Johann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences
- 2. Johannes Kepler University Linz, Research Institute for Symbolic Computation (RISC)
Description
This piece of python code provides functionality for computing the number of complex realizations of minimally rigid graphs on the sphere using a combinatorial algorithm.
Files
Instructions.pdf
Files
(263.1 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:9cffe6977c7787369c6218c439def351
|
252.0 kB | Preview Download |
|
md5:a821a2fe8a1a87fbe8619ef994caee04
|
5.4 kB | Download |
|
md5:15d9a07dd9a7ba2ccbd753b58e899951
|
5.7 kB | Download |
Additional details
Related works
- Is described by
- Journal article: 10.37236/8548 (DOI)
- Is supplement to
- Journal article: 10.37236/8548 (DOI)
Funding
- FWF Austrian Science Fund
- Algebraic Geometry for parallel and serial manipulators J 4253
- FWF Austrian Science Fund
- The Algebra of Motions in 3-Space P 31061
- FWF Austrian Science Fund
- Computational Mathematics: Numerical Analysis and Symbolic Computation W 1214
- FWF Austrian Science Fund
- Trajectories of motions P 33003
- FWF Austrian Science Fund
- Realizations of Rigid Graphs P 31888