New algorithm for field splitting in radiation therapy

  • Authors:

  • Xiaodong Wu;Xin Dou;John Bayouth;John Buatti

  • Affiliations:

  • Department of Electrical and Computer Engineering, University of Iowa, Iowa City, IA and Department of Radiation Oncology, University of Iowa, Iowa City, IA;Department of Electrical and Computer Engineering, University of Iowa, Iowa City, IA;Department of Radiation Oncology, University of Iowa, Iowa City, IA;Department of Radiation Oncology, University of Iowa, Iowa City, IA

  • Venue:
  • ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we study an interesting geometric partition problem, called optimal field splitting, which arises in Intensity-Modulated Radiation Therapy (IMRT). In current clinical practice, a multi-leaf collimator (MLC) 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 overlapping sub-IMs. We develop the first optimal linear time algorithm for solving the field splitting problem while minimizing the total complexity of the resulting sub-IMs. Meanwhile, our algorithm strives to minimize the maximum beam-on time of those sub-IMs. Our basic idea is to formulate the field splitting problem as computing a shortest path in a directed acyclic graph, with a special "layered" structure. The edge weights of the graph satisfy the Monge property, which enables us to speed up the algorithm to optimal linear time. To minimize the maximum beam-on time of the resulting sub-IMs, we consider an interesting min-max slope path problem in a monotone polygon which is solvable in linear time. The min-max slope path problem is of its own interest.