Position:	Ovidiu Daescu  Associate Professor   Department of Computer Science   University of Texas at Dallas
Education:	University of Notre Dame  (Notre Dame, IN) Ph.D.   Doctorate in Computer Science and Engineering M.S.   Master of Science in Computer Science and Engineering  Technical Military Academy  (Bucharest, Romania) Engineer Diploma in Computer Science and Automation
Research  Interests:	Computational Geometry Algorithms and Optimization Bio-Medical Computing
Additional information:	Teaching and Advising Publications Research Support 1-link shortest paths in weighted regions, narated by James Palmer k-link shortest paths in weighted regions, narated by James Palmer 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. Other Links Contact Information

Last Modified: 04/07/2006