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. © Springer-Verlag 2012.
Cite
CITATION STYLE
Liu, Y., & Wu, X. (2012). Solving circular integral block decomposition in polynomial time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7676 LNCS, pp. 342–351). Springer Verlag. https://doi.org/10.1007/978-3-642-35261-4_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
