Software Open Access
Calligraphs and counting realizations of minimally rigid graphs
Grasegger, Georg;
El Hilany, Boulos;
Lubbes, Niels
Calligraphs.wl is a mathematica package implementing the algorithms described in the paper "Coupler curves of moving graphs and counting realizations of rigid graphs".
This project received funding from
Austrian Science Fund (FWF): P33003
German Research Foundation (DFG): EL1092/1-1
Austrian Science Fund (FWF): P31888
Files
(156.9 kB)
| Name | Size | |
|---|---|---|
|
AlgorithmManual.pdf
md5:c4d0b359c14319f32c8ca77bb3aadd3e |
125.1 kB | Download |
|
Calligraphs.wl
md5:1bea3fea5acde741d2d5df3c353d7983 |
23.5 kB | Download |
|
CalligraphsExamples.wl
md5:26faa92ec2ad5151186604b99ac8239c |
8.3 kB | Download |
69
64
views
downloads
| All versions | This version | |
|---|---|---|
| Views | 69 | 69 |
| Downloads | 64 | 64 |
| Data volume | 7.1 MB | 7.1 MB |
| Unique views | 64 | 64 |
| Unique downloads | 53 | 53 |
Indexed in
- Publication date:
- May 5, 2022
- DOI:
-
- Keyword(s):
- coupler curve minimally rigid graph graph realization edge lengths
- Grants:
-
Austrian Science Fund:
-
Trajectories of motions (P 33003)
- Realizations of Rigid Graphs (P 31888)
-
Trajectories of motions (P 33003)
- Related identifiers:
- Supplement to
- 10.48550/arXiv.2205.02612 (Preprint)
- Requires
- 10.5281/zenodo.1245506 (Software)
- License (for files):
- GNU General Public License v3.0 or later