Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/26805
Title: Reducing the tongue-and-groove underdosage in MLC shape matrix decomposition
Contributor(s): Kalinowski, Thomas  (author)orcid 
Publication Date: 2008
Open Access: Yes
Handle Link: https://hdl.handle.net/1959.11/26805
Open Access Link: https://journals.lib.unb.ca/index.php/AOR/article/view/9702/9790Open Access Link
Abstract: We present an algorithm for optimal step-and-shoot multileaf collimator field segmentation minimizing tongue-and-groove effects. Adapting the concepts of [7] we characterize the minimal decomposition time as the maximal weight of a path in a properly constructed weighted digraph. We also show that this decomposition time can be realized by a unidirectional plan, thus proving that the algorithm from [9] is monitor unit optimal in general and not only for unidirectional leaf movement. Our characterization of the minimal decomposition time has the advantage that it can be used to derive a heuristic for the reduction of the number of shape matrices following the ideas of [7].
[7] T. Kalinowski. A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint. Discrete Appl. Math., 152(1-3):52–88, 2005.
[9] S. Kamath, S. Sartaj, J. Palta, S. Ranka, and J. Li. Optimal leaf sequencing with elimination of tongue-and-groove underdosage. Phys. Med. Biol., 49:N7–N19, 2004.
Publication Type: Journal Article
Source of Publication: Algorithmic Operations Research, 3(2), p. 165-174
Publisher: Preeminent Academic Facets
Place of Publication: Canada
ISSN: 1718-3235
Field of Research (FOR): 010303 Optimisation
010206 Operations Research
Peer Reviewed: Yes
HERDC Category Description: C1 Refereed Article in a Scholarly Journal
Other Links: https://journals.lib.unb.ca/index.php/AOR/article/view/9702
Appears in Collections:Journal Article
School of Science and Technology

Files in This Item:
1 files
File SizeFormat 
Show full item record
Google Media

Google ScholarTM

Check


Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.