The algorithmic complexity of the minimization of the number of segments in multileaf collimator field segmentation Kalinowski, Thomas 1980- VerfasserIn aut text Text gw 2004 monographic XA-DE Rostock University of Rostock, Institute of Mathematics publisher 2004 Rostock Universitätsbibliothek distributor eng
electronic resource
remote
Computermedien
Online-Ressource
1 Online-Ressource (31 Seiten) Intensity maps are nonnegative matrices describing the intensity modulation of beams in radiotherapy. In order to use a multileaf collimator in the static mode for the realization of the intensity modulation one has to determine a segmentation, i.e. a representation of an intensity map as a positive combination of special matrices corresponding to fixed positions of the multileaf collimator, called segments. We consider the problem to construct segmentations with the minimal total number of monitor units and the minimal number of segments. Neglecting machine-dependent constraints like the interleaf collision constraint and assuming that the entries of the intensity map are bounded by a constant, we prove that a segmentation with minimal number of segments under the condition that the number of monitor units is minimal, can be determined in time polynomial in the matrix dimensions. The results of our algorithm are compared with Engel's [9] heuristic for the reduction of the number of segments.<eng> Open Access Urheberrechtsschutz 1.0 Thomas Kalinowski 510 https://purl.uni-rostock.de/rosdok/id00005903 The algorithmic complexity of the minimization of the numer of segments in multileaf collimator field segmentation Rostock : Univ., Fachbereich Mathematik, 2004
31 S.
 Druck-Ausgabe (DE-627)468508066 Kalinowski, Thomas Preprints aus dem Institut für Mathematik 04/1 urn:nbn:de:gbv:28-rosdok_id00005903-8 10.18453/rosdok_id00005903 1621961136 rda DE-627 261021 1987274040 20261021T161753.0 Converted from MARCXML to MODS version 3.8 using MARC21slim2MODS3-8_XSLT1-0.xsl (Revision 1.174 20250328) ger