Abstract
In this paper, we study several rectilinear terrain construction problems, which model leaf sequencing problems in intensitymodulated radiation therapy (IMRT). We present a novel unified approach based on geometric techniques for solving these terrain construction problems. Our approach leads to the first algorithms for several leaf sequencing problems in IMRT that are practically fast and guarantee the optimal quality of the output solutions. Our implementation results show that our terrain construction algorithms run very fast on real medical data.
This research was supported in part by the NSF under Grant CCR-9988468. The contact information of Chen, Hu, Luan, and Wu is Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, USA. chen,shu,sluan,xwu@cse.nd.edu. The contact information of Yu is Department of Radiation Oncology, University of Maryland School of Medicine, Baltimore, MD 21201-1595, USA. cyu002@umaryland.edu.
The work of this author was supported in part by the NSF under Grant MIP- 9701416.
Corresponding author. The work of this author was supported in part by a fellowship from the Center for Applied Mathematics, University of Notre Dame.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T.R. Bortfeld, J. Stein, K. Preiser, and K. Hartwig, Intensity Modulation for Optimized Conformal Therapy, Proc. Symp. Principles and Practice of 3-D Radiation Treatment Planning, Munich, 1996.
A. L. Boyer, Use of MLC for Intensity Modulation, Med. Phys., 21 (1994), p. 1007.
A. L. Boyer and C.X. Yu, Delivery of Intensity-Modulated Radiation Therapy Using Dynamic Multileaf Collimator, Seminar in Radiat. Oncol., 9 (2) (1999).
B. Chazelle, A Minimum Spanning Tree Algorithm with Inverse-Ackermann Type Complexity, Journal of the ACM, 47 (2000), pp. 1028–1047.
D. Z. Chen, O. Daescu, X. Hu, and J. Xu, Finding an Optimal Path without Growing the Tree, accepted to the Special Issue of J. of Algorithms on Selected Papers from the 6th Annual European Symp. on Algorithms (ESA’98).
D. Z. Chen, X. Hu, and X. Wu, Optimal Polygon Cover Problems and Applications, Proc. 11th Annual International Symp. on Algorithms and Computation, 2000, Lecture Notes in Computer Science, Vol. 1969, Springer Verlag, pp. 564–576.
D. Z. Chen, X. Hu, and X. Wu, Maximum Red/Blue Interval Matching with Applications, Proc. 7th Annual International Computing and Combinatorics Conf., 2001, pp. 150–158.
D. J. Convery and S. Webb, Generation of Discrete Beam-Intensity Modulation by Dynamic Multileaf Collimation under Minimum Leaf Separation Constraints, Phys. Med. Biol., 43 (1998), pp. 2521–2538.
C. Cotrutz, C. Kappas, and S. Webb, Intensity Modulated Arc Therapy (IMAT) with Multi-Isocentric Centrally Blocked Rotational Fields, Phys. Med., 15 (1999), p. 239.
C. Cotrutz, C. Kappas, and S. Webb, Intensity Modulated Arc Therapy (IMAT) with Centrally Blocked Rotational Fields, Phys. Med. Biol., 45 (2000), pp. 2185–2206.
J. Dai and Y. Zhu, Minimizing the Number of Segments in a Delivery Sequence for Intensity-Modulated Radiation Therapy with a Multileaf Collimator, Phys. Med., 28 (2001), pp. 2113–2120.
E.A. Dinitz, Algorithm for Solution of a Problem of Maximum Flow in a Network with Power Estimation, Soviet Math. Dokl., 11 (1970), pp. 248–264.
A. Efrat, A. Itai, and M. J. Katz, Geometry Helps in Bottleneck Matching and Related Problems, Algorithmica, 31 (2001), pp 1–28.
J. E. Hopcroft and R.M. Karp, An n5/2 Algorithm for Maximum Matching in Bipartite Graphs, SIAM J. Comput., 2 (1973), pp. 225–231.
J. M. Keil, Decomposing a Polygon into Simpler Components, SIAM J. Comput., 14 (4) (1985), pp. 799–817.
J. M. Keil, Polygon Decomposition, Handbook on Computational Geometry, J.-R. Sack and J. Urrutia (Eds.), Elsevier Science Publishers, Amsterdam, 1999.
R. Liu and S. Ntafos, On Decomposing Polygons into Uniformly Monotone Parts, Information Processing Letters, 27 (1988), pp. 85–89.
A. Schweikard, R. Z. Tombropoulos, and J.R. Adler, Robotic Radiosurgery with Beams of Adaptable Shapes, Proc. 1st Int. Conf. on Computer Vision, Virtual Reality and Robotics in Medicine, Lecture Notes in Computer Science, Vol. 905, Springer, 1995, pp. 138–149.
S. Webb, Configuration Options for Intensity-Modulated Radiation Therapy Using Multiple Static Fields Shaped by a Multileaf Collimator, Phys. Med. Biol., 43 (1998), pp. 241–260.
K.R. Winston and W. Lutz, Linear Accelerator as a Neurosurgical Tool for Stereotactic Radiosurgery, Neurosurgery, 22 (3) (1988), pp. 454–464.
E. Wong, J. Chen, G. Bauman, E. Yu, A.R. Dar, Plan Evaluations for Clinical Use of Simpli.ed Intensity Modulated Arc Therapy, Medical Physics, 28 (6) (2001), p. 1306.
P. Xia and L. J. Verhey, MLC Leaf Sequencing Algorithm for Intensity Modulated Beams with Multiple Static Segments, Med. Phys., 25 (1998), pp. 1424–1434.
C.X. Yu, Intensity-Modulated Arc Therapy with Dynamic Multileaf Collimation: An Alternative to Tomotherapy, Phys. Med. Biol., 40 (1995), pp. 1435–1449.
C.X. Yu, Design Considerations of the Sides of the Multileaf Collimator, Phys. Med. Biol., 43 (5) (1998), pp. 1335–1342.
C. X. Yu, D.-J. Chen, A. Li, L. Ma, D.M. Shepard, and M. Sarfaraz, Intensity-Modulated Arc Therapy: Clinical Implementation and Experience, Proc. 13th Int. Conf. on the Use of Computers in Radiation Therapy, W. Schlegel and T. Bortfeld (eds.), Heidelberg, May 2000.
C.X. Yu, A. Li, L. Ma, D.M. Shepard, M. Sarfaraz, T. Holmes, M. Suntharalingham, and C. Mansfield, Clinical Implementation of Intensity-Modulated Arc Therapy, Elekta Oncology Symposium on IMRT, Thomas Jefferson University, PA, March 2000.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, D.Z., Hu, X.S., Luan, S., Wu, X., Yu, C.X. (2002). Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy. In: Möhring, R., Raman, R. (eds) Algorithms — ESA 2002. ESA 2002. Lecture Notes in Computer Science, vol 2461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45749-6_27
Download citation
DOI: https://doi.org/10.1007/3-540-45749-6_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44180-9
Online ISBN: 978-3-540-45749-7
eBook Packages: Springer Book Archive