A new algorithm for optimal multileaf collimator field segmentation

Authors:
Konrad Engel
Affiliations:
Universität Rostock, Institut für Mathematik, D-18051 Rostock, Germany
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 3
Cited 21

Minimizing beam-on time in cancer radiation treatment using multileaf collimators

Networks
A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint

Discrete Applied Mathematics
Realization of intensity modulated radiation fields using multileaf collimators

General Theory of Information Transfer and Combinatorics

A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint

Discrete Applied Mathematics
Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Optimal Field Splitting, with Applications in Intensity-Modulated Radiation Therapy

FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Coupled Path Planning, Region Optimization, and Applications in Intensity-Modulated Radiation Therapy

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Multiobjective Decomposition of Positive Integer Matrix: Application to Radiotherapy

EMO '09 Proceedings of the 5th International Conference on Evolutionary Multi-Criterion Optimization
A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint

Discrete Applied Mathematics
New algorithm for field splitting in radiation therapy

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning

Operations Research
Algorithmics in intensity-modulated radiation therapy

Algorithms and theory of computation handbook
Approximated matrix decomposition for IMRT planning with multileaf collimators

OR Spectrum
CP and IP approaches to cancer radiotherapy delivery optimization

Constraints
Faster optimal algorithms for segment minimization with small maximal value

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
A shortest path-based approach to the multileaf collimator sequencing problem

Discrete Applied Mathematics
A function approximation approach to the segmentation step in IMRT planning

OR Spectrum
Field splitting problems in intensity-modulated radiation therapy

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Hybrid methods for the multileaf collimator sequencing problem

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Iterative variable aggregation and disaggregation in IP: An application

Operations Research Letters
A new field splitting algorithm for intensity-modulated radiation therapy

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Faster optimal algorithms for segment minimization with small maximal value

Discrete Applied Mathematics
An almost linear time algorithm for field splitting in radiation therapy

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.04

Visualization

Abstract

We present a new efficient leaf sequencing algorithm for the generation of intensity maps by a nonnegative combination of segments. Intensity maps describe the intensity modulation of beams in radiotherapy. We only study the static case (step and shoot). We exactly optimize the total number of monitor units and heuristically optimize the number of segments. We present a short exact proof for a formula giving the smallest total number of monitor units and describe a class of algorithms yielding this minimal value. A special member of this class provides a solution with a very small number of segments.