Sciweavers

Share
COMGEO
2010
ACM

Mixed volume techniques for embeddings of Laman graphs

8 years 10 months ago
Mixed volume techniques for embeddings of Laman graphs
We use Bernstein's Theorem [1] to obtain combinatorial bounds for the number of embeddings of Laman graph frameworks modulo rigid motions. For this, we study the mixed volume of suitable systems of polynomial equations obtained from the edge length constraints. The bounds can easily be computed and for some classes of graphs, the bounds are tight.
Reinhard Steffens, Thorsten Theobald
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2010
Where COMGEO
Authors Reinhard Steffens, Thorsten Theobald
Comments (0)
books