A multi-graph $G$ on n vertices is $(k,l)$-sparse if every subset of $n'≤n$ vertices spans at most $kn'-l$ edges, $0 ≤l < 2k$ is tight if, in addition, it has exactly $kn - l$ edges.Expand

We formulate a concise deformation theory for periodic bar-and-joint frameworks in Rd and illustrate our algebraic–geometric approach on frameworks related to various crystalline structures.… Expand

We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the… Expand

A pseudo-triangle is a simple polygon with three convex vertices, and a pseudo-triangulation is a face-to-face tiling of a planar region into pseudo-triangles. Pseudo-triangulations appear as data… Expand