Configurations of lines in space and combinatorial rigidity

From MaRDI portal




Abstract: Let L be a sequence (ell1,ell2,ldots,elln) of n lines in mathbbC3. We define the {it intersection graph} GL=([n],E) of L, where [n]:=1,ldots,n, and with i,jinE if and only if ieqj and the corresponding lines elli and ellj intersect, or are parallel (or coincide). For a graph G=([n],E), we say that a sequence L is a {it realization} of G if GsubsetGL. One of the main results of this paper is to provide a combinatorial characterization of graphs G=([n],E) that have the following property: For every {it generic} realization L of G that consists of n pairwise distinct lines, we have GL=Kn, in which case the lines of L are either all concurrent or all coplanar. The general statements that we obtain about lines, apart from their independent interest, turns out to be closely related to the notion of graph rigidity. The connection is established due to the so-called Elekes--Sharir framework, which allows us to transform the problem into an incidence problem involving lines in three dimensions. By exploiting the geometry of contacts between lines in 3D, we can obtain alternative, simpler, and more precise characterizations of the rigidity of graphs.









This page was built for publication: Configurations of lines in space and combinatorial rigidity

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