On the ball spanned by balls
From MaRDI portal
Publication:1264087
DOI10.1007/BF02187750zbMATH Open0688.90020OpenAlexW2135412646MaRDI QIDQ1264087FDOQ1264087
Authors: Nimrod Megiddo 
Publication date: 1989
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131099
Recommendations
- Enclosing weighted points with an almost-unit ball
- A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)
- Efficient algorithms for the smallest enclosing ball problem
- The smallest enclosing ball of balls: combinatorial structure and algorithms
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
Quadratic programming (90C20) Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Inventory, storage, reservoirs (90B05)
Cites Work
- The Weighted Euclidean 1-Center Problem
- Linear Programming in Linear Time When the Dimension Is Fixed
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Computing circular separability
- Computing the geodesic center of a simple polygon
- The weighted Euclidean 1-center problem
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
- Linear programming in \(O(n\times 3^{d^2})\) time
Cited In (26)
- QuickhullDisk: a faster convex hull algorithm for disks
- A convex hull algorithm for discs, and applications
- A note on the Lie ball
- Assigning weights to minimize the covering radius in the plane
- Largest bounding box, smallest diameter, and related problems on imprecise points
- Covering convex polygons by two congruent disks
- Covering convex polygons by two congruent disks
- Fuzzy versions of the covering circle problem
- A discrete location problem
- A linear-time algorithm for the geodesic center of a simple polygon
- Helly-type theorems and generalized linear programming
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
- ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS
- A dual simplex-type algorithm for the smallest enclosing ball of balls
- The geodesic 2-center problem in a simple polygon
- Ball, sphere, and all, all, all
- Prune-and-search with limited workspace
- On Removing a Ball without Disturbing the Others
- Facility location problems with uncertainty on the plane
- Fuzzy disk for covering fuzzy points
- Title not available (Why is that?)
- On the planar piecewise quadratic 1-center problem
- A way to retract balls onto spheres
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
- Computing the geodesic center of a simple polygon
- Enclosing weighted points with an almost-unit ball
This page was built for publication: On the ball spanned by balls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1264087)
