Packing of Unequal Spheres and Automated Radiosurgical Treatment Planning |
| |
Authors: | Jie Wang |
| |
Affiliation: | (1) Department of Mathematical Sciences, University of North Carolina at Greensboro, Greensboro, NC 27402, USA |
| |
Abstract: | We study an optimization problem of packing unequal spheres into a three-dimensional (3D) bounded region in connection with radiosurgical treatment planning. Given an input (R, V, S, L), where R is a 3D bounded region, V a positive integer, S a multiset of spheres, and L a location constraint on spheres, we want to find a packing of R using the minimum number of spheres in S such that the covered volume is at least V; the location constraint L is satisfied; and the number of points on the boundary of R that are touched by spheres is maximized. Such a packing arrangement corresponds to an optimal radiosurgical treatment planning. Finding an optimal solution to the problem, however, is computationally intractable. In particular, we show that this optimization problem and several related problems are NP-hard. Hence, some form of approximations is needed. One approach is to consider a simplified problem under the assumption that spheres of arbitrary (integral) diameters are available with unlimited supply, and there are no location constraints. This approach has met with certain success in medical applications using a dynamic programming algorithm (Bourland and Wu, 1996; Wu, 1996). We propose in this paper an improvement to the algorithm that can greatly reduce its computation cost. |
| |
Keywords: | sphere packing radiosurgical treatment planning NP-hardness dynamic programming |
本文献已被 SpringerLink 等数据库收录! |
|