论文信息 - The number of realizations of a Laman graph

The number of realizations of a Laman graph

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.

[1] Ileana Streinu,et al. The Number of Embeddings of Minimally Rigid Graphs , 2004, Discret. Comput. Geom..

[2] Bill Jackson,et al. The number of equivalent realisations of a rigid graph , 2012, 1204.1228.

[3] Thorsten Theobald,et al. Mixed volume techniques for embeddings of Laman graphs , 2008, Comput. Geom..

[4] Ioannis Z. Emiris,et al. Mixed Volume and Distance Geometry Techniques for Counting Euclidean Embeddings of Rigid Graphs , 2013, Distance Geometry.

[5] Josef Schicho,et al. The number of realizations of a Laman graph , 2018, SIAM J. Appl. Algebra Geom..

[6] G. Laman. On graphs and rigidity of plane skeletal structures , 1970 .