Cayley-Menger Coordinates
Overview
Authors
Affiliations
A major obstacle in applying distance geometry techniques is the analytical complexity of the Cayley-Menger determinants that are used to characterize euclidian spaces in terms of distances between points. In this paper we show that, with the aid of a theorem of Jacobi, the complex Cayley-Menger determinants can be replaced by simpler determinants, and we derive the concept of Cayley-Menger coordinates, a coordinate system in terms of which each point of En is characterized by n + 1 distances to n + 1 points of a reference. We also show that this coordinate system provides a natural norm for the incomplete embedding problem. This paper provides the tools to treat the problem of filling out an incomplete distance matrix so that our previous procedure can then be used to embed the corresponding structure in a three-dimensional space.
Distributed Relative Localization Algorithms for Multi-Robot Networks: A Survey.
Wang S, Wang Y, Li D, Zhao Q Sensors (Basel). 2023; 23(5).
PMID: 36904602 PMC: 10007377. DOI: 10.3390/s23052399.
Two inequalities about the pedal triangle.
Huang F J Inequal Appl. 2018; 2018(1):72.
PMID: 29628748 PMC: 5882760. DOI: 10.1186/s13660-018-1661-7.
Distance matrix-based approach to protein structure prediction.
Kloczkowski A, Jernigan R, Wu Z, Song G, Yang L, Kolinski A J Struct Funct Genomics. 2009; 10(1):67-81.
PMID: 19224393 PMC: 3018873. DOI: 10.1007/s10969-009-9062-2.
Clore G, Nilges M, Sukumaran D, Brunger A, Karplus M, Gronenborn A EMBO J. 1986; 5(10):2729-35.
PMID: 16453716 PMC: 1167175. DOI: 10.1002/j.1460-2075.1986.tb04557.x.
An approach to the multiple-minima problem by relaxing dimensionality.
Purisima E, Scheraga H Proc Natl Acad Sci U S A. 1986; 83(9):2782-6.
PMID: 3458240 PMC: 323390. DOI: 10.1073/pnas.83.9.2782.