A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN
From MaRDI portal
Publication:4608951
DOI10.1017/S1446181117000372zbMath1386.51007OpenAlexW2765471166WikidataQ62562105 ScholiaQ62562105MaRDI QIDQ4608951
Douglas S. Gonçalves, D. S. Maioli, Carlile C. Lavor
Publication date: 29 March 2018
Published in: The ANZIAM Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1446181117000372
General theory of distance geometry (51K05) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items
Unassigned distance geometry and molecular conformation problems, Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem, An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization, Realizing Euclidean distance matrices by sphere intersection, Minimal NMR distance information for rigidity of protein graphs, Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures, Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension, A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discretization orders and efficient computation of Cartesian coordinates for distance geometry
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- The discretizable molecular distance geometry problem
- Clifford algebra and the discretizable molecular distance geometry problem
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- Recent advances on the interval distance geometry problem
- Recent advances on the discretizable molecular distance geometry problem
- Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- Six mathematical gems from the history of distance geometry
- Distance Geometry
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Euclidean Distance Geometry and Applications
