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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
