Ovidiu Daescu

Univ. of Notre Dame, Dept. of Computer Science & Engineering
http://www.cse.nd.edu/~odaescu/
odaescu@bach.helios.nd.edu

Author, editor, or reviewer of:

• Efficiently approximating polygonal paths in three and higher dimensions
• Finding an optimal path without growing the tree
• Maintaining visibility of a polygon with a moving point of view
• Optimizing the sum of linear fractional functions and applications