Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

COMGEO
2010
ACM

favoriteEmaildiscussreport

107views Applied Computing» more COMGEO 2010»

Mixed volume techniques for embeddings of Laman graphs

13 years 4 months ago

Mixed volume techniques for embeddings of Laman graphs

Download www.math.uni-frankfurt.de

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

Real-time Traffic

Applied Computing | Combinatorial Bounds | COMGEO 2010 | Edge Length Constraints | Modulo Rigid Motions |

claim paper

Related Content

» Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs

» Towards highquality untangled meshes via a forcedirected graph embedding approach

» A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Pee...

» From Analysis to Interactive Exploration Building Visual Hierarchies from OLAP Cubes

» Fluorescent immersion range scanning

» Scalable detection of partial nearduplicate videos by visualtemporal consistency

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	COMGEO
Authors	Reinhard Steffens, Thorsten Theobald

Comments (0)