A note on computing the intersection of spheres in R^n

DOI10.1017/S1446181117000372zbMATH Open1386.51007OpenAlexW2765471166WikidataQ62562105 ScholiaQ62562105MaRDI QIDQ4608951FDOQ4608951

Authors: D. S. Maioli, Douglas S. Gonçalves, Carlile 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

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

zbMATH Keywords

QR decomposition\(n\)-dimensional spheressphere intersection

Mathematics Subject Classification ID

Vector spaces, linear dependence, rank, lineability (15A03) General theory of distance geometry (51K05)

Cites Work

• Title not available (Why is that?)
• An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
• Euclidean distance geometry and applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Distance Geometry
• 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
• The discretizable molecular distance geometry problem
• Title not available (Why is that?)
• Recent advances on the discretizable molecular distance geometry problem
• The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
• Reliable computation of the points of intersection of \(n\) spheres in \({\mathbb{R}}^n\)
• Discretization orders and efficient computation of Cartesian coordinates for distance geometry
• Six mathematical gems from the history of distance geometry
• Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
• Clifford algebra and the discretizable molecular distance geometry problem
• Recent advances on the interval distance geometry problem
• Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem

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
• Volume of the intersection of three spheres
• A new algorithm for the \(^K\mathrm{DMDGP}\) subclass of distance geometry problems with exact distances
• 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)