An Approach to Dynamical Distance Geometry
Résumé
We introduce the dynamical distance geometry problem (dynDGP), where vertices of a given simple weighted undirected graph are to be embedded at different times t. Solutions to the dynDGP can be seen as motions of a given set of objects. In this work, we focus our attention on a class of instances where motion inter-frame distances are not available, and reduce the problem of embedding every motion frame as a static distance geometry problem. Some preliminary computational experiments are presented.
Domaines
Informatique [cs]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...