GEOMETRIC ALGORITHMS FOR STATIC LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY

DOI10.1142/S0218195904001494zbMath1084.68931MaRDI QIDQ4824661

Danny Z. Chen, Shuang Luan, Chao Wang, Xiao Dong Wu, Xiaobo Sharon Hu

Publication date: 1 November 2004

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

network flowsmonotone polygonspolygon partition

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Biomedical imaging and signal processing (92C55)

Related Items

EFFICIENT ALGORITHM FOR OPTIMAL MATRIX ORTHOGONAL DECOMPOSITION PROBLEM IN INTENSITY-MODULATED RADIATION THERAPY, MOUNTAIN REDUCTION, BLOCK MATCHING, AND APPLICATIONS IN INTENSITY-MODULATED RADIATION THERAPY, A new algorithm for a field splitting problem in intensity-modulated radiation therapy, Mathematical optimization in intensity modulated radiation therapy, Mathematical optimization in intensity modulated radiation therapy, GENERALIZED GEOMETRIC APPROACHES FOR LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY

Cites Work

• Unnamed Item
• On decomposing polygons into uniformly monotone parts
• Minimum convex partition of a polygon with holes by cuts in given directions
• Connecting the Maximum Number of Nodes in the Grid to the Boundary with Nonintersecting Line Segments
• Maximal Flow Through a Network
• Decomposing a Polygon into Simpler Components
• Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs