info prev up next book cdrom email home


Consider a finite collection of points $p=(p_1, \ldots, p_n)$, $p_i\in\Bbb{R}^d$ Euclidean Space (known as a Configuration) and a graph $G$ whose Vertices correspond to pairs of points that are constrained to stay the same distance apart. Then the graph $G$ together with the configuration $p$, denoted $G(p)$, is called a framework.

See also Bar (Edge), Configuration, Rigid

© 1996-9 Eric W. Weisstein