Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Geometric algorithms for static leaf sequencing problems in radiation therapy
Proceedings of the nineteenth annual symposium on Computational geometry
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
New algorithm for field splitting in radiation therapy
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Shape rectangularization problems in intensity-modulated radiation therapy
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 0.89 |
In this paper, we study several interesting intensity map splitting (IMSp) problems that arise in Intensity-Modulated Radiation Therapy (IMRT), a state-of-the-art radiation therapy technique for cancer treatments. In current clinical practice, a multi-leaf collimator (MLC) with a maximum leaf spread is used to deliver the prescribed intensity maps (IMs). However, the maximum leaf spread of an MLC may require that a large intensity map be split into several abutting sub-IMs each being delivered separately, which results in prolonged treatment time. Few IM splitting techniques reported in the literature have addressed the issue of treatment delivery efficiency for large IMs. We develop a unified approach for solving the IMSp problems while minimizing the total beam-on time in various settings. Our basic idea is to formulate the IMSp problem as computing a k-link shortest path in a directed acyclic graph. We carefully characterize the intrinsic structures of the graph, yielding efficient algorithms for the IMSp problems.