Pages that link to "Item:Q2730453"
From MaRDI portal
The following pages link to Reliable computation of the points of intersection of \(n\) spheres in \({\mathbb{R}}^n\) (Q2730453):
Displaying 14 items.
- Discretization orders and efficient computation of Cartesian coordinates for distance geometry (Q476278) (← links)
- Extending the geometric build-up algorithm for the molecular distance geometry problem (Q975461) (← links)
- Efficient computation of dual space and directional multiplicity of an isolated point (Q1634816) (← links)
- Realizing Euclidean distance matrices by sphere intersection (Q1728090) (← links)
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures (Q1730533) (← links)
- Intersections on the sphere and ellipsoid (Q1771971) (← links)
- The discretizable distance geometry problem (Q1926615) (← links)
- Recent advances on the discretizable molecular distance geometry problem (Q1926689) (← links)
- On the geometry of some localisation problems in robotics (Q2094124) (← links)
- Projection of a point onto the intersection of spheres in linear varieties (Q2228096) (← links)
- Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension (Q2274754) (← links)
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances (Q2392117) (← links)
- On the number of realizations of certain Henneberg graphs arising in protein conformation (Q2448906) (← links)
- A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN (Q4608951) (← links)
