View in EDS

Angular constraints on planar frameworks.

Saved in:

Bibliographic Details
Title:	Angular constraints on planar frameworks.
Authors:	Dewar, Sean¹ (AUTHOR), Grasegger, Georg² (AUTHOR), Nixon, Anthony³ (AUTHOR) a.nixon@lancaster.ac.uk, Rosen, Zvi⁴ (AUTHOR), Sims, William⁵ (AUTHOR), Sitharam, Meera⁶ (AUTHOR), Urizar, David⁷ (AUTHOR)
Source:	Discrete Applied Mathematics. Sep2026, Vol. 390, p151-166. 16p.
Subjects:	Matroids, Matrices (Mathematics), Graph theory, Planar graphs, Combinatorics
Abstract:	Consider a collection of points in the plane and the sets of slopes or directions of the lines between pairs of points. It is known that the algebraic matroid on the set of direction constraints between the points is equivalent to the algebraic matroid on the set of distances between the points. This is the well-studied generic 2-dimensional rigidity matroid of a graph. This article studies a higher-level construction built on the slope data: an angle constraint system obtained by prescribing relationships between pairs of slopes. The central question we analyze is: when is an angle system rigid, in the sense that every nontrivial motion alters one of the fixed angles? We formulate the problem in matricial terms for certain edge-colored graphs, finding precise necessary conditions for when such edge-colored graphs are rigid, and a combinatorial characterization of generic rigidity for a special case. We also prove the validity of an equivalent formulation of the angle matroid as the algebraic matroid of a field extension. [ABSTRACT FROM AUTHOR]
	Copyright of Discrete Applied Mathematics is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	Consider a collection of points in the plane and the sets of slopes or directions of the lines between pairs of points. It is known that the algebraic matroid on the set of direction constraints between the points is equivalent to the algebraic matroid on the set of distances between the points. This is the well-studied generic 2-dimensional rigidity matroid of a graph. This article studies a higher-level construction built on the slope data: an angle constraint system obtained by prescribing relationships between pairs of slopes. The central question we analyze is: when is an angle system rigid, in the sense that every nontrivial motion alters one of the fixed angles? We formulate the problem in matricial terms for certain edge-colored graphs, finding precise necessary conditions for when such edge-colored graphs are rigid, and a combinatorial characterization of generic rigidity for a special case. We also prove the validity of an equivalent formulation of the angle matroid as the algebraic matroid of a field extension. [ABSTRACT FROM AUTHOR]
ISSN:	0166218X
DOI:	10.1016/j.dam.2026.03.009