The number of realizations of a Laman graph

01/19/2017
by   Jose Capco, et al.
0

Laman graphs model planar frameworks that 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. Such realizations can be seen as solutions of systems of quadratic equations prescribing the distances between pairs of points. Using ideas from algebraic and tropical geometry, we provide a recursive formula for the number of complex solutions of such systems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/12/2017

Computing the number of realizations of a Laman graph

Laman graphs model planar frameworks which are rigid for a general choic...
research
01/03/2022

Realizations of Rigid Graphs

A minimally rigid graph, also called Laman graph, models a planar framew...
research
06/16/2020

Distinct distances in the complex plane

We prove that if P is a set of n points in ℂ^2, then either the points i...
research
06/21/2022

Near-Linear ε-Emulators for Planar Graphs

We study vertex sparsification for distances, in the setting of planar g...
research
01/23/2020

Canonical form of modular hyperbolas with an application to integer factorization

For a composite n and an odd c with c not dividing n, the number of solu...
research
07/31/2020

Fast computation of all pairs of geodesic distances

Computing an array of all pairs of geodesic distances between the pixels...
research
08/04/2019

Computing the inverse geodesic length in planar graphs and graphs of bounded treewidth

The inverse geodesic length of a graph G is the sum of the inverse of th...

Please sign up or login with your details

Forgot password? Click here to reset