# An Introduction to Distance Geometry applied to Molecular GeometryThe Distance Geometry Problem (DGP)

An Introduction to Distance Geometry applied to Molecular Geometry: The Distance Geometry... [The fundamental problem of DG, as we have previously stated, is to determine all the coordinates of a set points, in a given geometric space, for which some of the distances are known. Depending on the application, these points can represent stars, reachable points for a robot arm, atoms, or people. Each one of these objects can be represented by a vertex of a graph, and if the distance between them is known, we have an edge connecting the correspondent vertices. Formally, we have the following definition of the Distance Geometry Problem (DGP) [57].] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

# An Introduction to Distance Geometry applied to Molecular GeometryThe Distance Geometry Problem (DGP)

Part of the SpringerBriefs in Computer Science Book Series
7 pages

/lp/springer-journals/an-introduction-to-distance-geometry-applied-to-molecular-geometry-the-57cxXsTFCU
Publisher
Springer International Publishing
ISBN
978-3-319-57182-9
Pages
5 –12
DOI
10.1007/978-3-319-57183-6_2
Publisher site
See Chapter on Publisher Site

### Abstract

[The fundamental problem of DG, as we have previously stated, is to determine all the coordinates of a set points, in a given geometric space, for which some of the distances are known. Depending on the application, these points can represent stars, reachable points for a robot arm, atoms, or people. Each one of these objects can be represented by a vertex of a graph, and if the distance between them is known, we have an edge connecting the correspondent vertices. Formally, we have the following definition of the Distance Geometry Problem (DGP) [57].]

Published: Jul 14, 2017