Answers are grounded in this paper and cite their sources.
Finding the global positioning of points in Euclidean space from a local or partial set of pairwise distances is a problem in geometry that emerges naturally in sensor networks and NMR spectroscopy of proteins. We observe that the eigenvectors of a certain sparse matrix exactly match the sought coordinates. This translates to a simple and efficient algorithm that is robust to noisy distance data.
No takes yet. Share an insight, caveat, or question.
Amit Singer (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: