Ovidiu Daescu

Professor - Computer Science
Director of Undergraduate Education - Computer Science, Professor - Computer Science
Tags: Computer Science Electrical Engineering Computer Engineering

Professional Preparation

Ph.D. - Computer Science and Engineering
University of Notre Dame - 2000
M.S. - Computer Science and Engineering
University of Notre Dame - 1997
Engineer Diploma - Computer Science and Automation
Technical Military Academy (Burhest, Romania) - 1991

Research Areas

Statement of Research:
My main research interests are in the areas of geometric computing, bio-medical computing, parallel (multicore, GPU) computing, and intelligent transportation systems. I am particularly interested in developing computationally efficient algorithms for optimization problems. Some of the emerging computational fields, such as computational medicine and intelligent transportation are dealing with problems that can make use of geometric and graph optimization techniques. My research aims to bring computational geometry and geometric optimization methods to the forefront of other computational fields.
Research Interests:
  • Computational Geometrys
  • Algorithms and Optimization
  • Bio-Medical Computing


Load Balancing for Reliable Multicast,     C. Gong, O. Daescu, R. Joti, B. Raghavachari and K. Sarac, Proceedings of the 3rd IASTED International Conference on Communications, Internet and Information Technology (CIIT), pp. 86-91, November 2004. 2004 - Publication
Space-efficient algorithms for approximating polygonal curves in two dimensional space,    D.Z. Chen and O. Daescu,   International Journal of Computational Geometry & Applications, Vol 13, No. 2, pp. 95-111, 2003. 2003 - Publication
Finding an optimal path without growing the tree, D.Z. Chen, O. Daescu, X. Hu and J. Xu, Journal of Algorithms, Vol. 49, No. 1, pp. 13-41, 2003. 2003 - Publication
Efficient parallel algorithms for planar st-graphs, M.J. Atallah, D.Z. Chen and O.Daescu, Algorithmica, Vol. 35, No. 3, pp. 194-215, 2003. 2003 - Publication
Task planning with transportation constraints: approximation bounds, implementations and experiments, O. Daescu, D. Soeder and R.N. Uma, Proceedings of the IEEE International Conference on Robotics and Automation, Vol.3, pp. 3542-3547, September 2003. 2003 - Publication
New results on path approximation,     O. Daescu,      Algorithmica, Special Issue on Shape Algorithmics, Vol. 38, No. 2, pp. 131-143, 2003. 2003 - Publication
Polygonal path approximation: a query based approach,     O. Daescu and N. Mi, In Lecture Notes in Computer Science, Vol. 2906, Springer Verlag , Proceedings of the 14th Annual International Symposium on Algorithms and Computation, pp. 36-46, December 2003. 2003 - Publication
Efficiently approximating polygonal paths in three and higher dimensions, G. Barequet, D.Z. Chen, O. Daescu, M.T. Goodrich and J. Snoeyink, Algorithmica, Vol. 33, No. 2, pp. 150-167, 2002. 2002 - Publication
Determining an optimal penetration among weighted regions in two and three dimensions, D.Z. Chen, O. Daescu, X. Hu, X. Wu and J. Xu, Journal of Combinatorial Optimization, Special Issue on Optimization Problems in Medical Applications, Vol. 5, No. 1, pp. 59-79, 2001. 2001 - Publication
On geometric path query problems,   D.Z. Chen, O.Daescu and K.S. Klenk, International Journal of Computational Geometry & Applications, Vol. 11, No.6, pp. 617-645, 2001.  2001 - Publication


Associate Professor
University of Texas at Dallas [2006–Present]
Postdoctorial Research Associate
University of Notre Dame [2000–2000]
Assistant Professor
University of Texas at Dallas [2000–2006]
Teaching / Research Assistant
University of Notre Dame [1995–2000]
Technical Military Academy, Bucharest, Romania [1992–1995]
Programming Analyst
Technical Military Academy, Bucharest, Romania [1991–1992]
Computing Center


Efficient algorithms for approximating polygonal paths
1999–1999 Seminar in Applied Mathematics, Center for Applied Mathematics, University of Notre Dame
Towards An Optimal Algorithm For Recognizing Laman Graphs
2007–2007 Workshop on Algorithms, Combinatorics and Geometry
Polygonal chain approximation with applications
2003–2003 Department of Computer Science, University of North Texas
Optimal weighted links and applications
2001–2001 Computer Science Colloquium, Department of Computer Science, University of Texas at Dallas
Optimization problems in weighted regions
2006–2006 Department of Computer Science, Southern Methodist University

Additional Information

Professional Memberships, Awards, and Honors
  • Graduate Student Fellow of the Center for Applied Mathematics, University of Notre Dame, 08/1998-05/1999
  • Fellowship from the Center for Applied Mathematics, University of Notre Dame, 08/1998-05/1999

News Articles

NSF Brings Together Computer Scientists, Industry for New Tech Hub
Computer scientists at UT Dallas hope that funding awarded by the National Science Foundation to create an Industry/University Cooperative Research Center will help the Dallas area become a research hub for technology that enhances human abilities.

Like all I/UCRCs, the iPerform Center for Assistive Technologies to Enhance Human Performancesupports research that interests university and industry members. The center originated with two sites, one at UT Dallas and the other at the University of Texas at Arlington. The NSF awarded UT Dallas $325,000 for five years to create iPerform, with the expectation that researchers involved would attract industry partners that pay a fee to fund precompetitive research and have access to other research at the center. Researchers at UT Arlington have received separate funding to participate in iPerform and also are attracting partners.


Weighted Region Problems: Theory and Algorithms
$249,996 - NSF [2006–2010]
Outlier Identification and Handling in Computational Geometry Problems
$99,972 - NSF [2004–2006]
Algorithms for Computing Optimal Weighted Links and Trajectories
$14,000 - Clark Foundation Research Initiation Grants Program (through UTD) [2002–2002]
Resources for Research in Scalable Parallel Computing and Networking Simulation
$63,330 - NSF [2001–2006]