Chapitre D'ouvrage Année : 2012

Mixed volume and distance geometry techniques for counting Euclidean embeddings of rigid graphs

Résumé

A graph G is called generically minimally rigid in \RRd if, for any choice of sufficiently generic edge lengths, it can be embedded in \RRd in a finite number of distinct ways, modulo rigid transformations. Here, we deal with the problem of determining tight bounds on the number of such embeddings, as a function of the number of vertices. The study of rigid graphs is motivated by numerous applications, mostly in robotics, bioinformatics, and architecture. We capture embeddability by polynomial systems with suitable structure, so that their mixed volume, which bounds the number of common roots, yields interesting upper bounds on the number of embeddings. We explore different polynomial formulations so as to reduce the corresponding mixed volume, namely by introducing new variables that remove certain spurious roots, and by applying the theory of distance geometry. We focus on \RR2 and \RR3, where Laman graphs and 1-skeleta of convex simplicial polyhedra, respectively, admit inductive Henneberg constructions. Our implementation yields upper bounds for n10 in \RR2 and \RR3, which reduce the existing gaps and lead to tight bounds for n7 in both \RR2 and \RR3; in particular, we describe the recent settlement of the case of Laman graphs with 7 vertices. We also establish the first lower bound in \RR3 of about 2.52n, where n denotes the number of vertices.
Fichier principal
Vignette du fichier
etv-distance.pdf (414) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00776252 , version 1 (15-01-2013)

Identifiants

Citer

Ioannis Z. Emiris, Elias Tsigaridas, Antonios Varvitsiotis. Mixed volume and distance geometry techniques for counting Euclidean embeddings of rigid graphs. C. Lavor and L. Liberti and N. Maculan and A. Mucherino. Distance Geometry: With Applications to Molecular Conformation and Sensor Networks, Springer-Verlag, pp.23-45, 2012, 978-1-4614-5128-0. ⟨10.1007/978-1-4614-5128-0_2⟩. ⟨hal-00776252⟩
273 Consultations
211 Téléchargements

Altmetric

Partager

More