Solving Distance Geometry Problem with Inexact Distances in Integer Plane

DOI10.1007/978-3-319-39441-1_25zbMath1339.68255OpenAlexW2483750424MaRDI QIDQ2815204

Partha Bhowmick, Piyush Kanti Bhunre, Jayanta Mukhopadhyay

Publication date: 27 June 2016

Published in: Computational Topology in Image Context (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-39441-1_25

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
• The discretizable molecular distance geometry problem
• A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
• Distance geometry optimization for protein structures
• The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
• Distance Geometry
• Molecular distance geometry methods: from continuous to discrete
• A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
• An Experimental Study on Distance-Based Graph Drawing
• Euclidean Distance Geometry and Applications
• Graph Drawing

This page was built for publication: Solving Distance Geometry Problem with Inexact Distances in Integer Plane