A note on computing the intersection of spheres in R^n
From MaRDI portal
Publication:4608951
Recommendations
- Reliable computation of the points of intersection of \(n\) spheres in \({\mathbb{R}}^n\)
- Realizing Euclidean distance matrices by sphere intersection
- Projection of a point onto the intersection of spheres in linear varieties
- Geometric algorithms for finding a point in the intersection of balls
- Total least squares fitting of \(k\)-spheres in \(n\)-D Euclidean space using an \((n+2)\)-D isometric representation
Cites work
- scientific article; zbMATH DE number 903777 (Why is no real title available?)
- scientific article; zbMATH DE number 2188749 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 3080144 (Why is no real title available?)
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- Clifford algebra and the discretizable molecular distance geometry problem
- Discretization orders and efficient computation of Cartesian coordinates for distance geometry
- Distance Geometry
- Euclidean distance geometry and applications
- Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem
- Recent advances on the discretizable molecular distance geometry problem
- Recent advances on the interval distance geometry problem
- Reliable computation of the points of intersection of \(n\) spheres in \({\mathbb{R}}^n\)
- Six mathematical gems from the history of distance geometry
- The discretizable molecular distance geometry problem
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
Cited in
(12)- Realizing Euclidean distance matrices by sphere intersection
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- Reliable computation of the points of intersection of \(n\) spheres in \({\mathbb{R}}^n\)
- Minimal NMR distance information for rigidity of protein graphs
- Unassigned distance geometry and molecular conformation problems
- Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension
- A new algorithm for the \(^K\mathrm{DMDGP}\) subclass of distance geometry problems with exact distances
- Volume of the intersection of three spheres
- On the common points of two families of \( N \)-spheres in the flat \( N+1 \) dimensional space, each of which passes through the vertexes of a given \( N \)-simplex
- 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
- Geometric algebra and distance matrices
This page was built for publication: A note on computing the intersection of spheres in \(\mathbb{R}^n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608951)
