Consider a finite collection of points , Euclidean Space (known as a Configuration) and a graph whose Vertices correspond to pairs of points that are constrained to stay the same distance apart. Then the graph together with the configuration , denoted , is called a framework.
See also Bar (Edge), Configuration, Rigid