An algorithm for realizing Euclidean distance matrices

DOI10.1016/j.endm.2015.07.066zbMath1349.68290OpenAlexW2200084081WikidataQ62562135 ScholiaQ62562135MaRDI QIDQ324865

Leo Liberti, Jorge Alencar, Tibérius O. Bonates, Carlile C. Lavor

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.066

zbMATH Keywords

distance geometryembedding dimensionEDMsphere interesection

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) General theory of distance geometry (51K05)

Related Items

Realizing Euclidean distance matrices by sphere intersection

Cites Work

• Unnamed Item
• A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
• Equality relating Euclidean distance cone to positive semidefinite cone
• Problems of distance geometry and convex properties of quadratic maps
• Solution of the embedding problem and decomposition of symmetric matrices.
• Global Continuation for Distance Geometry Problems
• Euclidean Distance Geometry and Applications