Book chapter
Solving Circular Integral Block Decomposition in Polynomial Time
Algorithms and Computation, pp.342-351
Lecture Notes in Computer Science, Springer Berlin Heidelberg
2012
DOI: 10.1007/978-3-642-35261-4_37
Abstract
The circular integral block decomposition (CIBD) problem seeks an optimal set of circular blocks that stack up to approximate a given reference integral function defined on a circular interval. This problem models the radiation dose delivery in Dynamic Rotating-Shield Brachytherapy (D-RSBT). The challenge lies in the circularity of the problem domain and the maximum length constraint of the circular blocks. We give an efficient polynomial time algorithm for solving the CIBD problem. The key idea is based on several new observations, enabling us to formulate the CIBD problem as the convex cost integer dual network flow. Implementation results show that our CIBD algorithm runs fast and produces promising D-RSBT treatment plans.
Details
- Title: Subtitle
- Solving Circular Integral Block Decomposition in Polynomial Time
- Creators
- Yunlong Liu - University of IowaXiaodong Wu - University of Iowa
- Resource Type
- Book chapter
- Publication Details
- Algorithms and Computation, pp.342-351
- Publisher
- Springer Berlin Heidelberg; Berlin, Heidelberg
- Series
- Lecture Notes in Computer Science
- DOI
- 10.1007/978-3-642-35261-4_37
- eISSN
- 1611-3349
- ISSN
- 0302-9743
- Language
- English
- Date published
- 2012
- Academic Unit
- The Iowa Institute for Biomedical Imaging; Electrical and Computer Engineering; Radiation Oncology
- Record Identifier
- 9984197181702771
Metrics
3 Record Views