Geometric algorithms for finding a point in the intersection of balls
From MaRDI portal
Recommendations
- On intersecting a point set with Euclidean balls
- ALGORITHMS FOR BALL HULLS AND BALL INTERSECTIONS IN NORMED PLANES
- Intersection algorithms for lines and circles
- Publication:4934236
- An algorithm for finding intersection between ball B-spline curves
- scientific article; zbMATH DE number 480245
- Intersections of balls and the ball hull mapping
- An optimal algorithm for intersecting line segments in the plane
- Computing the convex hull of line intersections
- Efficient dynamic algorithms for some geometric intersection problems
Cites work
- scientific article; zbMATH DE number 193847 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- Linear Matrix Inequalities in System and Control Theory
- On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls
Cited in
(9)- scientific article; zbMATH DE number 124000 (Why is no real title available?)
- ALGORITHMS FOR BALL HULLS AND BALL INTERSECTIONS IN NORMED PLANES
- Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\).
- Inflating balls is NP-hard
- On intersecting a point set with Euclidean balls
- Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces?
- A note on computing the intersection of spheres in \(\mathbb{R}^n\)
- Reliable computation of the points of intersection of \(n\) spheres in \({\mathbb{R}}^n\)
- Projection of a point onto the intersection of spheres in linear varieties
This page was built for publication: Geometric algorithms for finding a point in the intersection of balls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q827997)
