Name
Abstract | ||
|---|---|---|
Laman graphs model planar frameworks that 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. Such realizations can be seen as solutions of systems of quadratic equations prescribing the distances between pairs of points. Using ideas from algebraic and tropical geometry, we provide a recursive formula for the number of complex solutions of such systems. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1137/17M1118312 | SIAM JOURNAL ON APPLIED ALGEBRA AND GEOMETRY |
Keywords | Field | DocType |
Laman graph, minimally rigid graph, tropical geometry, Euclidean embedding, Puiseux series, graph realization, graph embedding | Discrete mathematics,Topology,Combinatorics,Laman graph,Algebraic number,Vertex (geometry),Tropical geometry,Isometry,Quadratic equation,Planar,Mathematics,Recursion | Journal |
Volume | Issue | ISSN |
2 | 1 | 2470-6566 |
Citations | PageRank | References |
3 | 0.58 | 6 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jose Capco | 1 | 3 | 0.58 |
| 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 |