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
Optimal Field Splitting with Feathering in Intensity-Modulated Radiation Therapy
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Optimal Field Splitting, with Applications in Intensity-Modulated Radiation Therapy
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
New algorithm for field splitting in radiation therapy
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Algorithmics in intensity-modulated radiation therapy
Algorithms and theory of computation handbook
Field splitting problems in intensity-modulated radiation therapy
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A new field splitting algorithm for intensity-modulated radiation therapy
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
An almost linear time algorithm for field splitting in radiation therapy
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
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 to split a large intensity map into several abutting sub-IMs each being delivered separately, which results in prolonged treatment time. Few IM splitting techniques reported in the literature has 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.