The following pages link to On the ball spanned by balls (Q1264087):
Displaying 15 items.
- Prune-and-search with limited workspace (Q473192) (← links)
- Computing the geodesic center of a simple polygon (Q582099) (← links)
- A linear-time algorithm for the geodesic center of a simple polygon (Q728492) (← links)
- A convex hull algorithm for discs, and applications (Q1188286) (← links)
- Helly-type theorems and generalized linear programming (Q1338955) (← links)
- The geodesic 2-center problem in a simple polygon (Q1615885) (← links)
- Facility location problems with uncertainty on the plane (Q1779686) (← links)
- Fuzzy disk for covering fuzzy points (Q1887918) (← links)
- A dual simplex-type algorithm for the smallest enclosing ball of balls (Q2044498) (← links)
- Largest bounding box, smallest diameter, and related problems on imprecise points (Q2269143) (← links)
- QuickhullDisk: a faster convex hull algorithm for disks (Q2286150) (← links)
- Assigning weights to minimize the covering radius in the plane (Q2331208) (← links)
- On the planar piecewise quadratic 1-center problem (Q2379920) (← links)
- ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS (Q3007722) (← links)
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING (Q3647614) (← links)
