刚性图的实现
Realizations of Rigid Graphs
摘要:
最小刚性图,也称为拉曼图,模拟一个平面框架,它是刚性的,其顶点之间的距离的一般选择。换句话说,有很多方法,直到等距,在平面上实现这样的图。利用代数和热带几何的思想,我们推导出一个递归公式的数量这样的实现。结合计算结果和通过胶合技术构造新的刚性图,我们可以给出一个新的下界的最大可能实现的图具有给定的顶点数。
英文摘要:
A minimally rigid graph, also called Laman graph, models a planar framework which is rigid for a general choice of distances between its vertices. In other words, there are finitely many ways, up to isometries, to realize such a graph in the plane. Using ideas from algebraic and tropical geometry, we derive a recursive formula for the number of such realizations. Combining computational results with the construction of new rigid graphs via gluing techniques, we can give a new lower bound on the maximal possible number of realizations for graphs with a given number of vertices.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。