Non-Crossing Frameworks with Non-Crossing Reciprocals

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 G 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 stress on G; 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 for such pseudo-triangulation embeddings of planar Laman circuits which are sufficiently generic, the reciprocal is non-crossing and again a pseudo-triangulation embedding of a planar Laman circuit. For a singular (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 Laman circuits. All self-stresses on a planar graph correspond to liftings to piecewise linear surfaces in 3-space. We prove characteristic geometric properties of the lifts of such non-crossing reciprocal pairs.

[1]  Imre Bárány,et al.  The limit shape of convex lattice polygons , 1995, Discret. Comput. Geom..

[2]  Yin-Feng Xu,et al.  On Constrained Minimum Pseudotriangulations , 2003, COCOON.

[3]  Günter Rote,et al.  A Central Limit Theorem for Convex Chains in the Square , 2000, Discret. Comput. Geom..

[4]  Bill Jackson,et al.  Egerváry Research Group on Combinatorial Optimization Connected Rigidity Matroids and Unique Realizations of Graphs Connected Rigidity Matroids and Unique Realizations of Graphs , 2022 .

[5]  Francisco Santos,et al.  Expansive Motions and the Polytope of Pointed Pseudo-Triangulations , 2002 .

[6]  Walter Whiteley,et al.  Plane Self Stresses and projected Polyhedra I: The Basic Pattem , 1993 .

[7]  Ileana Streinu,et al.  Combinatorial Roadmaps in Configuration Spaces of Simple Planar Polygons , 2001, Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science.

[8]  Luigi Cremona Le figure reciproche nella statica grafica , 1872 .

[9]  Walter Whiteley Matroid Applications: Matroids and Rigid Structures , 1992 .

[10]  D. Chand,et al.  On Convex Polyhedra , 1970 .

[11]  Ileana Streinu,et al.  A combinatorial approach to planar non-colliding robot arm motion planning , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[12]  Günter Rote,et al.  Planar minimally rigid graphs and pseudo-triangulations , 2003, SCG '03.

[13]  G. Laman On graphs and rigidity of plane skeletal structures , 1970 .

[14]  Francisco Santos,et al.  The polytope of non-crossing graphs on a planar point set , 2004, ISSAC '04.

[15]  H. Hahn Encyklopädie der mathematischen Wissenschaften , 1928 .

[16]  W. Whiteley Motions and stresses of projected polyhedra , 1982 .

[17]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

[18]  W. Whiteley,et al.  THE ALGEBRAIC GEOMETRY OF STRESSES IN FRAMEWORKS , 1983 .