The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence

Title
The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence
Publication Date
2009-05-06
Author(s)
Kalinowski, Thomas
( author )
OrcID: https://orcid.org/0000-0002-8444-6848
Email: tkalinow@une.edu.au
UNE Id une-id:tkalinow
Type of document
Journal Article
Language
en
Entity Type
Publication
Publisher
Elsevier BV, North-Holland
Place of publication
Netherlands
DOI
10.1016/j.dam.2008.06.027
UNE publication id
une:1959.11/26803
Abstract
The use of multileaf collimators (MLCs) is a modern way to realize intensity modulated fields in radiotherapy. An important step in the treatment planning is the shape matrix decomposition: the desired fluence distribution, given by an integer matrix, has to be decomposed into a small number shape matrices, i.e. (0,1)-matrices corresponding to the field shapes that can be delivered by the MLC used. The two main objectives are to minimize the total irradiation time, and the number of shape matrices. Assuming that the entries of the fluence matrix are bounded by a constant, we prove that a shape matrix decomposition with minimal number of shape matrices under the condition that the total irradiation time is minimal, can be determined in time polynomial in the matrix dimensions. The results of our algorithm are compared with Engel’s [K. Engel, A new algorithm for optimal multileaf collimator field segmentation, Discrete Appl. Math. 152 (1–3) (2005) 35–51.] heuristic for the reduction of the number of shape matrices.
Link
Citation
Discrete Applied Mathematics, 157(9), p. 2089-2104
ISSN
1872-6771
0166-218X
Start page
2089
End page
2104
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International

Files:

NameSizeformatDescriptionLink