An algorithm for realizing Euclidean distance matrices

DOI10.1016/J.ENDM.2015.07.066zbMATH Open1349.68290DBLPjournals/endm/AlencarBLL15OpenAlexW2200084081WikidataQ62562135 ScholiaQ62562135MaRDI QIDQ324865FDOQ324865

Authors: Jorge Alencar, Leo Liberti, Tibérius Bonates, Carlile Lavor 

Publication date: 17 October 2016

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

Recommendations

• Realizing Euclidean distance matrices by sphere intersection
• The isomap algorithm in distance geometry
• An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
• An algorithm and its role in the study of optimal graph realizations of distance matrices
• The cone of distance matrices

zbMATH Keywords

embedding dimensiondistance geometryEDMsphere interesection

Mathematics Subject Classification ID

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

Cites Work

• Euclidean Distance Geometry and Applications
• 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
• On generating instances for the modular distance geometry problem

Cited In (5)

• Realizing Euclidean distance matrices by sphere intersection
• Generalized Euclidean distance matrices
• A genetic algorithm for circulant Euclidean distance matrices
• Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
• An algorithm for the computation of the Hutchinson distance

This page was built for publication: An algorithm for realizing Euclidean distance matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324865)