caa a22 4500 445804297 CHVBK 20180317145152.0 cr unu---uuuuu 170323e20110501xx s 000 0 eng 10.1007/s00453-009-9363-7 doi (NATIONALLICENCE)springer-10.1007/s00453-009-9363-7 Coupled Path Planning, Region Optimization, andApplications in Intensity-modulated Radiation Therapy [Elektronische Daten] [Danny Chen, Shuang Luan, Chao Wang] In this paper, we consider an optimization problem in discrete geometry, called coupled path planning (CPP). Given a finite rectangular grid and a non-negative functionf defined on the horizontal axis of the grid, we seek two non-crossing monotone paths in the grid, such that the vertical difference between the two paths approximatesf in the best possible way. This problem arises in intensity-modulated radiation therapy (IMRT), wheref represents an ideal radiation dose distribution and the two coupled paths represent the motion trajectories (or control sequence) of two opposing metal leaves of a delivery device for controlling the area exposed to the radiation source. By finding an optimal control sequence, the CPP problem aims to deliver precisely a prescribed radiation dose, while minimizing the side-effects on the surrounding normal tissue. We present efficient algorithms for different versions of the CPP problems. Our results are based on several new ideas and geometric observations, and substantially improve the solutions based on standard techniques. Implementation results show that our CPP algorithms run fast and produce better quality clinical treatment plans than the previous methods. Springer Science+Business Media, LLC, 2009 Intensity-modulated radiation therapy (IMRT) nationallicence Intensity-modulated arc therapy (IMAT) nationallicence Single-arc IMRT nationallicence Arc-modulated radiation therapy (AMRT) nationallicence Coupled-path planning nationallicence Dynamic leaf sequencing nationallicence Chen Danny Department of Computer Science and Engineering, University of Notre Dame, 46556, Notre Dame, IN, USA aut Luan Shuang Department of Computer Science, University of New Mexico, 87131, Albuquerque, NM, USA aut Wang Chao Department of Computer Science and Engineering, University of Notre Dame, 46556, Notre Dame, IN, USA aut Algorithmica Springer-Verlag 60/1(2011-05-01), 152-174 0178-4617 60:1<152 2011 60 453 https://doi.org/10.1007/s00453-009-9363-7 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s00453-009-9363-7 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Chen Danny Department of Computer Science and Engineering, University of Notre Dame, 46556, Notre Dame, IN, USA aut NATIONALLICENCE 700 1- Luan Shuang Department of Computer Science, University of New Mexico, 87131, Albuquerque, NM, USA aut NATIONALLICENCE 700 1- Wang Chao Department of Computer Science and Engineering, University of Notre Dame, 46556, Notre Dame, IN, USA aut NATIONALLICENCE 773 0- Algorithmica Springer-Verlag 60/1(2011-05-01), 152-174 0178-4617 60:1<152 2011 60 453 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer