Name
Abstract | ||
|---|---|---|
Laman graphs model planar frameworks which are rigid for a general choice of distances between the vertices. There are finitely many ways, up to isometries, to realize a Laman graph in the plane. In a recent paper we provide a recursion formula for this number of realizations using ideas from algebraic and tropical geometry. Here, we present a concise summary of this result focusing on the main ideas and the combinatorial point of view. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.endm.2017.06.040 | Electronic Notes in Discrete Mathematics |
Keywords | DocType | Volume |
Laman graph,minimally rigid graph,tropical geometry,euclidean embedding,graph realization | Journal | 61 |
ISSN | Citations | PageRank |
1571-0653 | 2 | 0.47 |
References | Authors | |
2 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jose Capco | 1 | 2 | 0.47 |
| Matteo Gallet | 2 | 14 | 5.19 |
| Georg Grasegger | 3 | 25 | 6.98 |
| Christoph Koutschan | 4 | 104 | 20.29 |
| niels lubbes | 5 | 5 | 3.08 |
| Josef Schicho | 6 | 21 | 7.70 |