BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/101
DTSTAMP:20230914T125910Z
SUMMARY:A Near Optimal Algorithm for Finding Euclidean Shortest Path in  Po
 lygonal Domain
DESCRIPTION:Speaker: R. Inkulu\nIndian Institute of Technology\nDepartment 
 of Computer Science\nand Engineering \nGuwahati\nhttp://\n\nAbstract: \nTh
 e Euclidean shortest path problem in a polygonal region is one of the olde
 st and best-known in Computational Geometry due to its various application
 s.  Given a polygon with holes $P$ and two points $s$ and $t$ interior to 
 it\, our algorithm finds an Euclidean  shortest path from $s$ to $t$ in $O
 (n+m(\\\\lg{m})(\\\\lg{n}))$ time using $O(n)$ space.  Here\, $n$ is the n
 umber of vertices in the given polygonal domain\, and $m$ is the number of
  holes. This problem is listed as part of The Open Problems Project\, whic
 h intends for a solutions with $O(n+m(\\\\lg{m}))$ time using $O(n)$ space
 .  After identifying hourglasses in $P$\, the regions of interest in $P$ a
 re traversed with the shortest path wavefront.\n
URL:https://www.tcs.tifr.res.in/web/events/101
DTSTART;VALUE=DATE:20100713
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR