Approximate Shortest Path Queries on Weighted Polyhedral Surfaces ⋆ (2009)
Lyudmil Aleks, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-rüdiger Sack
Abstract. We consider the classical geometric problem of determining shortest paths between pairs of points lying on a weighted polyhedral surface P consisting of n triangular faces. We present query...
• Medical Imaging and Image Processing (2008)
Doron Nussbaum, Instructor Doron Nussbaum
Course Objectives: • To introduce students to medical research as it relates to computer science • To expose students (e.g., computer science) to a cross disciplinary research that requires...
Current & Future Issues of High-End Computing, (2008)
D. Nussbaum, H. Ye, G. R. Joubert, W. E. Nagel, F. J. Peters, ...
Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and...
Approximate shortest path queries on weighted polyhedral surfaces (2006)
Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-rüdiger Sack
We consider the classical geometric problem of determining shortest paths between pairs of points lying on a weighted polyhedral surface P consisting of n triangular faces. We present query...
Calculating the Meeting Point of Scattered Robots on Weighted Terrain Surfaces (2004)
Mark A. Lanthier, Doron Nussbaum, Tsuo-jung Wang
In this paper we discuss the problem of determining a meeting point of a set of scattered robots R = {r 1 , r 2 , . . . , r s } in a weighted terrain P which has n > s triangular faces. Our...
Parallel Implementation of Geometric Shortest Path Algorithms (2003)
Mark Lanthier, Doron Nussbaum, Jörg-Rüdiger Sack
In application areas such as GIS, the Euclidean metric is often less meaningfully applied to determine a shortest path than metrics which capture, through weights, the varying nature of the terrain...