Advertisement

The Distance Geometry Problem

  • Leo LibertiEmail author
  • Carlile Lavor
Chapter
Part of the Springer Undergraduate Texts in Mathematics and Technology book series (SUMAT)

Abstract

The Distance Geometry Problem (DGP) is an inverse problem. The corresponding “direct problem” is to compute some pairwise distances of a given set of points. Whereas the direct problem is obviously trivial (just carry out the computation), the inverse problem is generally difficult to solve.

Copyright information

© Springer International Publishing Switzerland 2017

Authors and Affiliations

  1. 1.CNRS LIXÉcole PolytechniquePalaiseauFrance
  2. 2.Department of Applied Mathematics, IMECC-UNICAMPUniversity of CampinasCampinasBrazil

Personalised recommendations