Abstract
The covering problem of a three dimensional body using different radii spheres is considered. The motivating application – the treatment planning of Gamma Knife radiosurgery – is briefly discussed. We approach the problem only by the geometric covering point of view, that is, given a set of spheres and a body, the objective is to cover the body using the smallest possible number of spheres, regardless of the dosage issue. In order to solve this mathematical programming problem, we consider an approach based on the application of penalty and stochastic local search techniques. Finally, some illustrative results and comparisons are presented.
Subject
Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science