Abstract
Two primal approaches, the shrinking approach and the dual approach, have been studied for the exact Minimum Bounding Sphere (MBS) problem. In this paper, we present a dual algorithm that uses the shrinking approach to solve subproblems. The experiments show our hybrid algorithm is faster than the dedicated shrinking algorithm and dual algorithm for solving the exact MBS problem in large point sets.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have