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

Publications

Yam Ki Cheung, Ovidiu Daescu: Frchet Distance Problems in Weighted Regions. CoRR abs/1004.4901 (2010) 2010 - Publication
Ovidiu Daescu, Wenqi Ju, Jun Luo: NP-Completeness of Spreading Colored Points. COCOA (1) 2010: 41-50 2010 - Publication
Robert Finis Anderson, J. Steven Kirtzic, Ovidiu Daescu: Applying Parallel Design Techniques to Template Matching with GPUs. VECPAR 2010: 456-468 2010 - Publication
Yam Ki Cheung, Ovidiu Daescu: Approximate Point-to-Face Shortest Paths in R^3. CoRR abs/1004.1588 (2010) 2010 - Publication
Visiting a Sequence of Points with a Bevel-Tip Needle, S. Bitner, Y.K. Cheung, A.F. Cook, O. Daescu and C. Wenk, 9th Latin American Symposium on Theoretical Informatics, pp. 492-502. 2010 - Publication
Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu: Guarding a Terrain by Two Watchtowers. Algorithmica 58(2): 352-390 (2010) 2010 - Publication
Polygonal chain simplification for flight simulation systems, O. Daescu and A. Kurdia, Spring Simulation Multiconference. 2009 - Publication
Towards an optimal algorithm for recognizing Laman graphs, O. Daescu and A. Kurdia, Journal of Graph Algorithms and Applications, Vol. 13, No. 2, pp. 219-232. 2009 - Publication
Farthest segments and extremal triangles spanned by points in R3, S. Bitner and O. Daescu, Information Processing Letters, Vol. 109, No. 20, pp. 1167-1171. 2009 - Publication
Parallel Optimal Weighted Links,O. Daescu, Y.K. Cheung and J.D. Palmer, Transactions on Computational Science, Vol. 3, pp. 66-81. 2009 - Publication

Appointments

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]
Lecturer
Technical Military Academy, Bucharest, Romania [1992–1995]
Programming Analyst
Technical Military Academy, Bucharest, Romania [1991–1992]
Computing Center

Projects

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
  • Member ACM, ACM SIGACT, IEEE-CS.
  • 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.

Funding

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]