שלחו לחבר

Scanning paths in 2-dimensional space with polygonal obstacles

Speaker
Reuven Cohen - Math, BIU
Date
13/11/2011 - 10:30
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)

תאריך עדכון אחרון : 06/02/2012