LINKAGES AND DISTANCE GEOMETRY.
Abstract
A linkage is a connected collection of rigid but articulated rods. If the number of missing connections between vertices is k then the shape of the linkage can be represented by a point in the phase space R superscript k. For each integer r, 1 = or < r = or < n (where n + 1 is the number of vertices of the linkage) the paper presents a method of determining the set of those points of R superscript k, furnishing a shape of the linkage that lies in the space E sub r, but not in E sub (r-1). (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 01, 1968
- Accession Number
- AD0686130
Entities
People
- I. J. Shoenberg
Organizations
- University of Wisconsin–Madison