Configurations of lines in space and combinatorial rigidity
From MaRDI portal
Abstract: Let be a sequence of lines in . We define the {it intersection graph} of , where , and with if and only if and the corresponding lines and intersect, or are parallel (or coincide). For a graph , we say that a sequence is a {it realization} of if . One of the main results of this paper is to provide a combinatorial characterization of graphs that have the following property: For every {it generic} realization of that consists of pairwise distinct lines, we have , in which case the lines of 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 52497 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 621806 (Why is no real title available?)
- scientific article; zbMATH DE number 952952 (Why is no real title available?)
- Algebraic methods in discrete analogs of the Kakeya problem
- Algorithms in real algebraic geometry
- Conditions for Unique Graph Realizations
- Coning, symmetry and spherical frameworks
- Connected rigidity matroids and unique realizations of graphs
- Definability and fast quantifier elimination in algebraically closed fields
- Generic global rigidity
- Geometry of graph varieties
- Global rigidity: The effect of coning
- Globally linked pairs of vertices in equivalent realizations of graphs
- Incidences between points and lines in \({\mathbb {R}}^4\)
- Incidences in three dimensions and distinct distances in the plane
- On graphs and rigidity of plane skeletal structures
- On lines and joints
- On the Erdős distinct distances problem in the plane
- Rank bounds for design matrices with block entries and geometric applications
- Rigidity and polarity. II: Weaving lines and tensegrity frameworks
- The Rigidity of Graphs
- The joints problem in \(\mathbb{R}^n\)
Cited in
(9)- scientific article; zbMATH DE number 6832315 (Why is no real title available?)
- Dense graphs have rigid parts
- On linearly rigid tuples
- An improved bound for joints in arrangements of lines in space
- The number of realizations of a Laman graph
- Constructions for large spatial point-line (n_k) congurations
- Freeness of line arrangements with many concurrent lines
- When is a planar rod configuration infinitesimally rigid?
- Implicit descriptions of piecewise-linear configurations
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)