# Exploring the infinitesimal rigidity of planar configurations of points and rods

@inproceedings{Lundqvist2021ExploringTI, title={Exploring the infinitesimal rigidity of planar configurations of points and rods}, author={Signe Lundqvist and Klara Stokes and Lars-Daniel Ohman Umeaa University and Sweden.}, year={2021} }

This article is concerned with the rigidity properties of geometric realizations of incidence geometries of rank two as points and lines in the Euclidean plane; we care about the distance being preserved among collinear points. We discuss the rigidity properties of geometric realizations of incidence geometries in relation to the rigidity of geometric realizations of other well-known structures, such as graphs and hypergraphs. The 2-plane matroid is also discussed. Further, we extend a result…

## Figures from this paper

## One Citation

When is a planar rod configuration infinitesimally rigid?

- Mathematics
- 2021

We provide a way of determining the infinitesimal rigidity of rod configurations realizing a rank two incidence geometry in the Euclidean plane. We model each rod with a cone over its point set and…

## References

SHOWING 1-10 OF 36 REFERENCES

The Union of Matroids and the Rigidity of Frameworks

- Mathematics, Computer ScienceSIAM J. Discret. Math.
- 1988

These techniques are used to characterize the graphs of infinitesimally rigid frameworks on other surfaces, such as the flat torus, the cylinder, cones, etc., using matroid unions of cycle and bicycle matroids of the graph.

A matroid on hypergraphs, with applications in scene analysis and geometry

- Mathematics, Computer ScienceDiscret. Comput. Geom.
- 1989

The plane pictures of vertices and faces which lift to sharp three-dimensional scenes with plane faces are characterized, combinatorially, and two generalizations of Laman's theorem on infinitesimally rigid plane frameworks are proved.

Point-hyperplane frameworks, slider joints, and rigidity preserving transformations

- Mathematics, Computer ScienceJ. Comb. Theory, Ser. B
- 2019

A combinatorial characterization of graphs that can be realized as infinitesimally rigid frameworks in the plane with a given set of points collinear is derived, which extends a result by Jackson and Jordan, which deals with the case when three points are coll inear.

Configurations of Points and Lines

- Engineering
- 2009

This is the only book on the topic of geometric configurations of points and lines. It presents in detail the history of the topic, with its surges and declines since its beginning in 1876. It covers…

Connected rigidity matroids and unique realizations of graphs

- Computer Science, MathematicsJ. Comb. Theory, Ser. B
- 2005

It is deduced that every realization of a 6-connected graph as a two-dimensional generic framework is a unique realization, based on a new inductive characterization of 3-connected graphs whose rigidity matroid is connected.

Generic Global Rigidity

- Computer Science, MathematicsDiscret. Comput. Geom.
- 2005

This condition, together with recent results of Jackson and Jordán, give necessary and sufficient conditions for a graph being generically globally rigid in the plane.

Plane Self Stresses and projected Polyhedra I: The Basic Pattem

- Mathematics
- 1993

ore than a century ago the geometer (and physicist) Clerk Maxwell described a surprising connection between static self stresses in frameworks with planar graphs, and orthogonal projections of…

Isometric Point-Circle Configurations on Surfaces from Uniform Maps

- Mathematics
- 2014

We embed neighborhood geometries of graphs on surfaces as point-circle configurations. We give examples coming from regular maps on surfaces with a maximum number of automorphisms for their genus,…

Pin-Collinear Body-and-Pin Frameworks and the Molecular Conjecture

- Mathematics, Computer ScienceDiscret. Comput. Geom.
- 2008

This paper gives a complete solution for the 2-dimensional version of the Molecular Conjecture and relies on a new formula for the maximum rank of a pin-collinear body-and-pin realization of a multigraph as a 2- dimensional bar- and-joint framework.

Constraining Plane Configurations in Computer-Aided Design: Combinatorics of Directions and Lengths

- Mathematics, Computer ScienceSIAM J. Discret. Math.
- 1999

This work combines the theories of parallel drawings and infinitesimal rigidity of plane frameworks by introducing a new matroid on the edge set of the complete graph with doubled edges to describe the combinatorial properties of direction-length designs.