Javascript must be enabled to use this form.

UTDallas Research Explorer
 View Profile
    Faculty Profile — Is this you? Login to edit.Last Modified Time: 11:12:20 AM Thu, 26 Aug 2010 

This site is going away soon - please visit the new URL for this page.

You will be automatically redirected in 10 seconds.

Image of  Ovidiu  Daescu
 Contact InformationHelpHelp  
Ovidiu Daescu
Professor-Computer Science, Director of Undergraduate Education-Computer Science, Professor-Computer Science
Office MailstopMail Box: EC31, Room No.: ECS4224 
Email Address    Primary Phone Number 972-883-4196    URL Faculty Homepage    Media Contact
Administrative Assistant:  Help  
Weekly, Julie Ann
 Professional Preparation
 Ph.D.Computer Science and EngineeringUniversity of Notre Dame2000
 M.S.Computer Science and EngineeringUniversity of Notre Dame1997
 Engineer DiplomaComputer Science and AutomationTechnical Military Academy (Burhest, Romania)1991
Collapse Section Expand Section Research and Expertise
Research Interests:
  • Computational Geometrys
  • Algorithms and Optimization
  • Bio-Medical Computing
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.
Collapse Section Expand Section Publications
 2 3 4 Next>> 14>>  
  YearPublication  Type
Wenqi Ju, Chenglin Fan, Jun Luo, Binhai Zhu, Ovidiu Daescu: On some geometric problems of color-spanning sets. J. Comb. Optim. 26(2): 266-283 (2013)
Wenqi Ju, Jun Luo, Binhai Zhu, Ovidiu Daescu: Largest area convex hull of imprecise data based on axis-aligned squares. J. Comb. Optim. 26(4): 832-859 (2013)
Peer reviewed
David Allen, Ovidiu Daescu: Radiation therapy simulation and optimization using kinetic polygon modeling. IRI 2013: 239-246
Conference paper
David Allen, Ovidiu Daescu: A comprehensive system for locating medical services. PETRA 2013: 31
Conference paper
Weili Wu, Ovidiu Daescu: Preface. Theor. Comput. Sci. 447: 1 (2012)
Collapse Section Expand Section Presentations and Projects
  1  2 
Start DateEnd DatePresentation/Project
12/2003 12/2003 Polygonal chain approximation with applications
Department of Computer Science, University of North Texas
11/2007 11/2007 Towards An Optimal Algorithm For Recognizing Laman Graphs
Workshop on Algorithms, Combinatorics and Geometry
09/1999 09/1999 Efficient algorithms for approximating polygonal paths
Seminar in Applied Mathematics, Center for Applied Mathematics, University of Notre Dame
06/2006 06/2006 Optimal Path Problems with Medical Applications
Neuroengineering Now, University of Texas at Dallas
04/2006 04/2006 Optimization problems in weighted regions
Department of Computer Science, Southern Methodist University
Collapse Section Expand Section Appointments
DurationRankDepartment / SchoolCollege / OfficeUniversity / Company
09/2006-PresentAssociate ProfessorDepartment of Computer Science University of Texas at Dallas
09/2000-08/2006Assistant ProfessorDepartment of Computer Science University of Texas at Dallas
08/1995-05/2000Teaching / Research AssistantDepartment of Computer Science University of Notre Dame
08/1991-07/1992Programming Analyst Computing CenterTechnical Military Academy, Bucharest, Romania
07/1992-06/1995LecturerDepartment of Computer Science and automation Technical Military Academy, Bucharest, Romania
05/2000-07/2000Postdoctorial Research AssociateDepartment of Computer Science University of Notre Dame
09/15/2006-08/31/2010Weighted Region Problems: Theory and AlgorithmsNSF$249,996Current
08/15/2004-07/31/2006Outlier Identification and Handling in Computational Geometry ProblemsNSF$99,972Previous
08/15/2001-02/28/2006Resources for Research in Scalable Parallel Computing and Networking SimulationNSF$63,330Previous
01/01/2002-12/31/2002Algorithms for Computing Optimal Weighted Links and TrajectoriesClark Foundation Research Initiation Grants Program (through UTD)$14,000Previous
       Teaching HelpHelp  
 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

Please verify the information in this request and mention any changes or suggestions in the comments section. Email notifications and confirmations regarding this will be sent to you at fromEmail and the profile owner. If you would like to receive it at a different email address, please change the email address listed on your profile.
© 2018-2019 The University of Texas at Dallas About Explorer | Accessibility | Contact Explorer Team