Scanning paths in 2-dimensional space with polygonal obstacles

Speaker
Reuven Cohen - Math, BIU
Date
13/11/2011 - 10:30Add to Calendar 2011-11-13 10:30:00 2011-11-13 10:30:00 Scanning paths in 2-dimensional space with polygonal obstacles A scanning path is a path having a direct line of sight (not intersecting any obstacle) to any point in free space. I will present the problem of the optimal scanning path as the shortest of all scanning paths. I will discuss possible methods of approximating the optimal scanning path. (Joint work With Slavic Shamshanov) אוניברסיטת בר-אילן - Department of Mathematics mathoffice@math.biu.ac.il Asia/Jerusalem public
Abstract

A scanning path is a path having a direct line of sight (not
intersecting any obstacle) to any point in free space. I will present
the problem of the optimal scanning path as the shortest of all
scanning paths. I will discuss possible methods of approximating the
optimal scanning path. (Joint work With Slavic Shamshanov)

Last Updated Date : 06/02/2012