The Handbook of Geometric Constraint Systems Principles is an entry point to the currently
used principal mathematical and computational tools and techniques of the geometric …

We introduce the notion of universal obstruction of a graph parameter, with respect to some
quasi-ordering relation. Universal obstructions may serve as compact characterizations of …

Let G be a minor-closed graph class. We say that a graph G is a k-apex of G if G contains a
set S of at most k vertices such that G∖ S belongs to G. We denote by A k (G) the set of all …

Abstract A (bar-and-joint) framework is a set of points in a normed space with a set of fixed
distance constraints between them. Determining whether a framework is locally rigid–ie …

A strict bramble of a graph G is a collection of pairwise-intersecting connected subgraphs of
G. The order of a strict bramble B is the minimum size of a set of vertices intersecting all sets …

The concept of graph flattenability, initially formalized by Belk and Connelly and later
expanded by Sitharam and Willoughby, extends the question of embedding finite metric …

We develop a combinatorial rigidity theory for symmetric bar-joint frameworks in a general
finite dimensional normed space. In the case of rotational symmetry, matroidal Maxwell-type …

Belk and Connelly introduced the realizable dimension $\textrm {rd}(G) $ of a finite graph $
G $, which is the minimum nonnegative integer $ d $ such that every framework $(G, p) $ in …

A linkage $(G,\ell) $ is a pair containing a finite simple undirected graph $ G $ and a
squared edge-length map $\ell $ that assigns squared Euclidean lengths to the edges of $ G …

A Euclidean Distance Constraint System (EDCS) or linkage (G, δ) is a graph G=(V, E)
together with a distance vector δ that assigns a distance δe or a distance interval [δl e, δr e] …