Skip to main content
Article thumbnail
Location of Repository

Mixed volume techniques for embeddings of Laman Graphs

By Reinhard Steffens and Thorsten Theobald

Abstract

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

Topics: Mixed volume, Laman graphs, minimally rigid graphs, Bernstein’s Theorem
Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.312.9234
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://arxiv.org/pdf/0805.4120... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.