Education
- Ph.D. Doctorate in Computer Science and Engineering, University of Notre Dame (Notre Dame, IN)
- M.S. Master of Science in Computer Science and Engineering, University of Notre Dame (Notre Dame, IN)
- Engineer Diploma in Computer Science and Automation, Technical Military Academy (Bucharest, Romania)
Interests
- Computational Geometry
- Algorithms and Optimization
- Bio-Medical Computing
Research
Laboratory of Algorithm Engineering and Development (LAED)IWISC-18-talk
Image stitching talk
WRP paper
IAC Presentation Fall'15
Red Blue Separation paper and Presentation
Bichromatic Separating Rectangles - FWCG'16 Presentation
GBMC project
Publications (most of them)
Research Support
Teaching and Advising
Courses and studentsStudent projects
- Assisted Visualization System (AVS) implemented by Qu (Jasper) Zhonghua for his Master Thesis (Summer 2009)
- Applet for finding the smallest circle enclosing all red points and as few blue points as possible, written by Sairam Behera (Summer 2010)
- 1-link shortest paths in weighted regions, narrated by James D. Palmer
- k-link shortest paths in weighted regions, narrated by James D. Palmer
- Fartest point from line talk
- CeMeas: a free java library and application for computing centrality measures, written by Anastasia Kurdia (Spring 2008)
- Applet for finding the farthest line segment defined by n points from a given query point, written by Scott Owen for his undergraduate honor thesis (Spring 2006)
- An application of segment trees, written by Mihai Cotet for his undergraduate honor thesis (Fall 2007)
- PhD Colloquium, Spring 2012