作者: Peter H. Scho̎nemann
DOI: 10.1002/J.2333-8504.1969.TB00773.X
关键词: Least squares 、 Metric (mathematics) 、 Euclidean distance matrix 、 Pure mathematics 、 Mathematics 、 Combinatorics 、 Euclidean distance 、 Space (mathematics) 、 Euclidean geometry
摘要: The problem of locating two sets points in a joint space, given the Euclidean distances between elements from distinct sets, is solved algebraically. For error free data solution exact, for fallible it has least squares properties.