Award Abstract # 1217906
AF: Small: Applied and Theoretical Algorithm Problems in Computational Geometry

NSF Org: CCF
Division of Computing and Communication Foundations
Recipient: UNIVERSITY OF NOTRE DAME DU LAC
Initial Amendment Date: August 18, 2012
Latest Amendment Date: August 5, 2015
Award Number: 1217906
Award Instrument: Standard Grant
Program Manager: Jack S. Snoeyink
CCF
 Division of Computing and Communication Foundations
CSE
 Directorate for Computer and Information Science and Engineering
Start Date: September 1, 2012
End Date: February 28, 2018 (Estimated)
Total Intended Award Amount: $400,000.00
Total Awarded Amount to Date: $460,000.00
Funds Obligated to Date: FY 2012 = $400,000.00
FY 2015 = $60,000.00
History of Investigator:
  • Danny Chen (Principal Investigator)
    dchen@nd.edu
Recipient Sponsored Research Office: University of Notre Dame
940 GRACE HALL
NOTRE DAME
IN  US  46556-5708
(574)631-7432
Sponsor Congressional District: 02
Primary Place of Performance: University of Notre Dame
Dept. of Comput. Sci. and Engin.
Notre Dame
IN  US  46556-5612
Primary Place of Performance
Congressional District:
02
Unique Entity Identifier (UEI): FPU6XGFXMBE9
Parent UEI: FPU6XGFXMBE9
NSF Program(s): Algorithmic Foundations
Primary Program Source: 01001213DB NSF RESEARCH & RELATED ACTIVIT
01001516DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 7923, 7929
Program Element Code(s): 779600
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.070

ABSTRACT

This project aims to study an array of important computational geometry problems in several applied areas such as medicine, biology, biomedical imaging, and data mining, and to develop new algorithmic solutions for these problems in biomedical applications. In addition, the project also seeks to investigate a set of fundamental theoretical geometric problems and to forge new geometric computing techniques.

Emerging biomedical imaging technologies and modalities have been revolutionizing the field of disease diagnosis and prognosis, pushing a paradigm shift in diagnosis and prognosis study and practice from qualitative to quantitative and from tissue/structure level to molecular/cellular level. Molecular/cellular imaging holds the promise of transforming modern diagnosis and prognosis, and offers numerous advantages over the traditional practice. This project will apply geometric computing techniques and data mining methods to develop new algorithms for vital cell identification and analysis problems in microscopy images, such as computing and analyzing the architectural structures of dendritic cells and other types of cells in multi-spectral microscopy images of tumor-draining lymph nodes for prognosis of breast cancer, and detecting and classifying cells in histology images of joint tissue for diagnosis of rheumatoid arthritis and other autoimmune diseases. Radiation therapy/surgery is a major modality for modern cancer treatment. This project will design new algorithms for an intriguing type of geometric motion planning problems that seek a set of paths to cover target tumor regions under special constraints and criteria. These problems arise in dynamic Gamma Knife radiosurgery and are at the core of a novel radiosurgery approach for breast cancer treatment. Besides, the project will develop new algorithmic techniques for solving a number of theoretical problems that are among the most fundamental tasks in computational geometry, such as computing optimal paths, visibility, Voronoi diagrams, geodesic diameters and centers, geometric clustering, and shape approximation. The research plan of the project includes a crucial component of algorithm implementation, experimentation, evaluation, software development, and practical applications. This research will integrate and enhance the power of computer algorithms and modern biomedicine to solve critical applied and theoretical problems in computational geometry and biomedical applications, and help improve the quality of life in today's society.

PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH

Note:  When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

(Showing: 1 - 10 of 44)
A.Y. Chang, N. Bhattacharya, J. Mu, F. Setiadi, G. Lee, D. Simons, S. Yadegarynia, K. Hemati, A. Kapelner, V. Carcamo-Cavazos, Z. Ming, D.N. Krag, E.J. Schwartz,D Z Chen, and P.P. Lee "Spatial Organization of Dendritic Cells within Tumor Draining Lymph Nodes Impacts Clinical Outcome in Breast Cancer Patients" Journal of Translational Medicine , v.11 , 2013 doi:10.1186/1479-5876-11-242
B. Zhou, K. Xiao, D.Z. Chen, and X.S. Hu "GPU-optimized Volume Ray Tracing for Massive Numbers of Rays in Radiotherapy" ACM Transactions on Embedded Computing Systems , v.13 , 2013 , p.Article 4
B. Zhou, X.S. Hu, D.Z. Chen, and C.X. Yu "Accelerating Radiation Dose Calculation: A Multi-FPGA Solution" ACM Transactions on Embedded Computing Systems , v.13 , 2013 , p.Article 3
C. Li, X. Li, H. Cao, H. Jiang, X. Deng, D.Z. Chen, L. Yang, and Z. Shao "A Fast Background Removal Method For 3D Multi-Channel Deep Tissue Fluorescence Imaging" The 20th International Conference on Medical Image Computing and Computer Assisted Intervention (MICCAI) , 2017 , p.92-99
D. Mehta, J. Chen, D.Z. Chen, H. Kusumaatmaja, and D.J. Wales "Kinetic Transition Networks for the Thomson Problem and Smale's Seventh Problem" Physical Review Letters , v.117 , 2016 , p.Article n doi: 10.1103/PhysRevLett.117.028301
D.Z. Chen and E. Misiolek "Algorithms for Interval Structures with Applications" Theoretical Computer Science , v.508 , 2013 , p.41
D.Z. Chen and H. Wang "Visibility and Ray Shooting Queries in Polygonal Domains" Computational Geometry: Theory and Applications , v.48 , 2015 , p.31
D.Z. Chen and H. Wang "A New Algorithm for Computing Visibility Graphs of Polygonal Obstacles in the Plane" Journal of Computational Geometry , v.6 , 2015 , p.316 http://jocg.org/index.php/jocg/issue/view/9
D.Z. Chen and H. Wang "A Note on Searching Line Arrangements and Applications" Information Processing Letters , v.113 , 2013 , p.518
D.Z. Chen and H. Wang "Approximating Points by a Piecewise Linear Function" Algorithmica , v.66 , 2013 , p.682
D.Z. Chen and H. Wang "Computing Shortest Paths among Curved Obstacles in the Plane" ACM Transactions on Algorithms (TALG) , v.11 , 2015 , p.Article N
(Showing: 1 - 10 of 44)

Please report errors in award information by writing to: awardsearch@nsf.gov.

Print this page

Back to Top of page