solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看2690次
Computing the number of realizations of a Laman graph. (arXiv:1707.03633v2 [math.CO] UPDATED)
来源于:arXiv
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. 查看全文>>