Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Mountain reduction, block matching, and applications in intensity-modulated radiation therapy
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Notes on searching in multidimensional monotone arrays
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
A new algorithm for optimal multileaf collimator field segmentation
Discrete Applied Mathematics
Efficient algorithms for intensity map splitting problems in radiation therapy
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
The matrix orthogonal decomposition problem in intensity-modulated radiation therapy
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Field splitting problems in intensity-modulated radiation therapy
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
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
An almost linear time algorithm for field splitting in radiation therapy
Computational Geometry: Theory and Applications
Hi-index | 0.00 |
In this paper, we present an almost linear time algorithm for the problem of splitting an intensity map of radiation (represented as an integer matrix) into multiple subfields (submatrices), subject to a given maximum allowable subfield width, to minimize the total delivery error caused by the splitting. This problem arises in intensity-modulated radiation therapy (IMRT) for cancer treatments. This is the first field splitting result on minimizing the total delivery error of the splitting. Our solution models the problem as a shortest path problem on a directed layered graph, which satisfies the staircase Monge property. Consequently, the resulting algorithm runs in almost linear time and generates an optimal quality field splitting.