Non-crossing frameworks with non-crossing reciprocals

DOI10.1007/S00454-004-1139-XzbMATH Open1062.05047arXivmath/0309156OpenAlexW3105785969MaRDI QIDQ1764166FDOQ1764166

Authors: David Orden, Günter Rote, Brigitte Servatius, Herman J. Servatius, Walter Whiteley, Francisco Santos 

Publication date: 23 February 2005

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: We study non-crossing frameworks in the plane for which the classical reciprocal on the dual graph is also non-crossing. We give a complete description of the self-stresses on non-crossing frameworks whose reciprocals are non-crossing, in terms of: the types of faces (only pseudo-triangles and pseudo-quadrangles are allowed); the sign patterns in the self-stress; and a geometric condition on the stress vectors at some of the vertices. As in other recent papers where the interplay of non-crossingness and rigidity of straight-line plane graphs is studied, pseudo-triangulations show up as objects of special interest. For example, it is known that all planar Laman circuits can be embedded as a pseudo-triangulation with one non-pointed vertex. We show that if such an embedding is sufficiently generic, then the reciprocal is non-crossing and again a pseudo-triangulation embedding of a planar Laman circuit. For a singular (i.e., non-generic) pseudo-triangulation embedding of a planar Laman circuit, the reciprocal is still non-crossing and a pseudo-triangulation, but its underlying graph may not be a Laman circuit. Moreover, all the pseudo-triangulations which admit a non-crossing reciprocal arise as the reciprocals of such, possibly singular, stresses on pseudo-triangulation embeddings of Laman circuits. All self-stresses on a planar graph correspond to liftings to piece-wise linear surfaces in 3-space. We prove characteristic geometric properties of the lifts of such non-crossing reciprocal pairs.

Full work available at URL: https://arxiv.org/abs/math/0309156

Recommendations

• scientific article; zbMATH DE number 482343
• Planar minimally rigid graphs and pseudo-triangulations
• Enumerating non-crossing minimally rigid frameworks
• Enumerating Non-crossing Minimally Rigid Frameworks
• Enumerating constrained non-crossing minimally rigid frameworks

zbMATH Keywords

self-stressframeworksLaman circuits

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Graph representations (geometric and intersection representations, etc.) (05C62) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Statics (70C20)

Cited In (5)

• Geometry of configuration spaces of tensegrities
• Planar minimally rigid graphs and pseudo-triangulations
• Combinatorial pseudo-triangulations
• Title not available (Why is that?)
• Smooth polyhedral surfaces

This page was built for publication: Non-crossing frameworks with non-crossing reciprocals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1764166)