Published May 11, 2018
| Version v1
Dataset
Open
The number of realizations of all Laman graphs with at most 12 vertices
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
Data manager:
Description
This data set consists of files for all Laman graphs (minimally rigid graphs) with at most 12 vertices and files for their Laman numbers (number of complex relaizations).
The data is computed by a combinatorial algorithm of Capco, Gallet, Grasegger, Koutschan, Lubbes and Schicho (see 10.1137/17M1118312 for a description and 10.5281/zenodo.1245506 for an implementation).
Files
Description.txt
Files
(346.5 MB)
Name | Size | Download all |
---|---|---|
md5:0319b442ea81a8fc1500f66ae463d3f7
|
2.5 kB | Preview Download |
md5:392c790c3e8d06a4cbc15af66bb1ab54
|
12.6 MB | Preview Download |
md5:2cd4dd36a1d405ddcbdd22b981876201
|
311.5 MB | Preview Download |
md5:d5985faa37d30ef90448db2257040aee
|
650.2 kB | Preview Download |
md5:58cde706edb05548c1e221b3df9ca418
|
786.2 kB | Preview Download |
md5:6bf74d6229931b8f5eeb33391a893da4
|
20.9 MB | Preview Download |
md5:ccc35235909d6b76f20daf07e0a5b50e
|
40.5 kB | Preview Download |
Additional details
Related works
- Is compiled by
- 10.5281/zenodo.1245506 (DOI)
Funding
- FWF Austrian Science Fund
- 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
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
- J. Capco, M. Gallet, G. Grasegger, C. Koutschan, N. Lubbes, and J. Schicho. An algorithm for computing the number of realizations of a Laman graph, doi: 10.5281/zenodo.1245506