| Author(s) |
Kalinowski, Thomas
|
| Publication Date |
2008
|
| 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].
</br>[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.
</br>[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.
|
| Citation |
Algorithmic Operations Research, 3(2), p. 165-174
|
| ISSN |
1718-3235
|
| Link | |
| Publisher |
Preeminent Academic Facets
|
| Title |
Reducing the tongue-and-groove underdosage in MLC shape matrix decomposition
|
| Type of document |
Journal Article
|
| Entity Type |
Publication
|
| Name | Size | format | Description | Link |
|---|