A dual algorithm for the minimum covering ball problem in Rn

Authors:
P. M. Dearing;Christiane R. Zeck
Affiliations:
Clemson University, United States;Clemson University, United States and University of Kaiserslautern, United States
Venue:
Operations Research Letters
Year:
2009

Citing 5
Cited 0

A class of convex programs with applications to computational geometry

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Linear Programming in Linear Time When the Dimension Is Fixed

Journal of the ACM (JACM)
An efficient, exact, and generic quadratic programming solver for geometric optimization

Proceedings of the sixteenth annual symposium on Computational geometry
Fast and Robust Smallest Enclosing Balls

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Efficient Algorithms for the Smallest Enclosing Ball Problem

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A dual type algorithm constructs the minimum covering ball of a given finite set of points in R^n by finding the minimum covering balls of a sequence of subsets, each with no more than n+1 points and with strictly increasing radius, until all points are covered.