Open Research Areas in Distance Geometry

Leo Liberti () and Carlile Lavor ()
Additional contact information
Leo Liberti: CNRS LIX, Ecole Polytechnique
Carlile Lavor: University of Campinas

A chapter in Open Problems in Optimization and Data Analysis, 2018, pp 183-223 from Springer

Abstract: Abstract Distance geometry is based on the inverse problem that asks to find the positions of points, in a Euclidean space of given dimension, that are compatible with a given set of distances. We briefly introduce the field, and discuss some open and promising research areas.

Keywords: Computational geometry; Fundamental distance geometry problem; Problem variants and extensions; Rigidity structure; Protein backbones; Clifford algebra; Computational complexity (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (2)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-99142-9_11

Ordering information: This item can be ordered from
http://www.springer.com/9783319991429

DOI: 10.1007/978-3-319-99142-9_11

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().