Title: Algorithms for external beam dose computation
Full Citation
Permanent Link: http://ufdc.ufl.edu/UF00100806/00001
 Material Information
Title: Algorithms for external beam dose computation
Physical Description: Book
Language: English
Creator: Jung, Haejae ( Dissertant )
Sahni, Sartaj K. ( Thesis advisor )
Ranka, Sanjay ( Reviewer )
Palta, Jatinder ( Reviewer )
Rajasekaran, Sanguthevar ( Reviewer )
Vemuri, Baba ( Reviewer )
Chun, Paul W. ( Reviewer )
Publisher: University of Florida
Place of Publication: Gainesville, Fla
Publication Date: 2000
Copyright Date: 2000
Subjects / Keywords: Data structures (Computer science)   ( lcsh )
Computational complexity   ( lcsh )
Computer and Information Science and Engineering thesis, Ph. D   ( lcsh )
Trees (Graph theory) -- Data processing   ( lcsh )
Dissertations, Academic -- Computer and Information Science and Engineering -- UF   ( lcsh )
Genre: bibliography   ( marcgt )
theses   ( marcgt )
government publication (state, provincial, terriorial, dependent)   ( marcgt )
non-fiction   ( marcgt )
Abstract: This dissertation presents novel dose computation algorithms based on the use of spatial data structures derived from octrees and quadtrees. This data structure makes approximate dose computation possible. Our methods approximate the scatter effect due to a cluster of proximate points which are far away from the point of interest. The scatter effect of the cluster is approximated by the scatter effect due to a single point at the center of this cluster. To compute dose contribution from one point to another point, ray tracing is performed to compute radiological distance between two points. We used a region growing scheme to reduce the number of regions: That decreases the number of intersection points. This region growing scheme using three dimensional real computed tomography (CT) data could eliminate about 80 percent of the regions produced by a regular region partitioning scheme, which is a variant of the octree based scheme. For region growing, an efficient binary search tree scheme with supernodes that have multiple elements has been developed. It is shown that this supernode scheme is better than binary search trees with single element nodes in terms of space efficiency and run time performance. Our experimental results of dose computation on homogeneous phantoms show that the resultant algorithm is two to three orders of magnitude faster than the collapsed cone algorithm while achieving similar levels of accuracy.
Subject: dose, binary tree, ray tracing
Thesis: Thesis (Ph. D.)--University of Florida, 2000.
Bibliography: Includes bibliographical references (p. 140-142).
General Note: Title from first page of PDF file.
General Note: Document formatted into pages; contains xii, 143 p.; also contains graphics.
General Note: Vita.
Statement of Responsibility: by Haejae Jung.
 Record Information
Bibliographic ID: UF00100806
Volume ID: VID00001
Source Institution: University of Florida
Holding Location: University of Florida
Rights Management: All rights reserved by the source institution and holding location.
Resource Identifier: oclc - 47680156
alephbibnum - 002678728
notis - ANE5955


This item has the following downloads:

PDF ( 13 MBs ) ( PDF )

University of Florida Home Page
© 2004 - 2010 University of Florida George A. Smathers Libraries.
All rights reserved.

Acceptable Use, Copyright, and Disclaimer Statement
Last updated October 10, 2010 - Version 2.9.9 - mvs