
Accession Number : AD0686130
Title : LINKAGES AND DISTANCE GEOMETRY.
Descriptive Note : Technical summary rept.,
Corporate Author : WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER
Personal Author(s) : Shoenberg,I. J.
Report Date : JUL 1968
Pagination or Media Count : 34
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 (r1). (Author)
Descriptors : (*CONVEX SETS, INEQUALITIES), GEOMETRY, THEOREMS
Subject Categories : Theoretical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE