Name
Abstract | ||
|---|---|---|
In this paper, we present an almost linear time algorithm for the problem of splitting an intensity map of radiation (represented as an integer matrix) into multiple subfields (submatrices), subject to a given maximum allowable subfield width, to minimize the total delivery error caused by the splitting. This problem arises in intensity-modulated radiation therapy (IMRT) for cancer treatments. This is the first field splitting result on minimizing the total delivery error of the splitting. Our solution models the problem as a shortest path problem on a directed layered graph, which satisfies the staircase Monge property. Consequently, the resulting algorithm runs in almost linear time and generates an optimal quality field splitting. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-73545-8_4 | COCOON |
Keywords | Field | DocType |
field splitting result,linear time algorithm,intensity-modulated radiation therapy,shortest path problem,optimal quality field splitting,cancer treatment,total delivery error,resulting algorithm,linear time,new field splitting algorithm,integer matrix,satisfiability | Discrete mathematics,Graph,Combinatorics,Shortest path problem,Algorithm,Directed acyclic graph,Time complexity,Integer matrix,Radiation,Intensity-modulated radiation therapy,Block matrix,Mathematics | Conference |
Volume | ISSN | ISBN |
4598 | 0302-9743 | 3-540-73544-5 |
Citations | PageRank | References |
4 | 0.49 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Danny Z. Chen | 1 | 94 | 10.26 |
| Mark A. Healy | 2 | 12 | 1.78 |
| Chao Wang | 3 | 404 | 27.12 |
| Xiaodong Wu | 4 | 859 | 77.06 |