| Literature DB >> 2380078 |
S M Morrill1, I I Rosen, R G Lane, J A Belli.
Abstract
To efficiently use linear and quadratic programming for treatment planning optimization on a routine basis, automated methods are needed for placing dose constraint points. We have investigated, for linear programming optimization, the minimum number of constraint points needed to achieve an acceptable approximation to the desired (ideal) solution. Seven different constraint point placement algorithms were evaluated for a given objective function. One of these algorithms was chosen for routine clinical use at our institution. This algorithm places constraint points on the perimeter of the target volume and on the perimeter and in the interior of each normal structure. Additional points are placed on the perimeter of a constant thickness buffer region surrounding the target volume. Excellent optimization results are obtained with 40-70 constraint points per treatment planning slice.Mesh:
Year: 1990 PMID: 2380078 DOI: 10.1016/0360-3016(90)90145-a
Source DB: PubMed Journal: Int J Radiat Oncol Biol Phys ISSN: 0360-3016 Impact factor: 7.038