BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/497
DTSTAMP:20230914T125926Z
SUMMARY:Algorithms for computing diffuse reflection paths in polygons
DESCRIPTION:Speaker: Pritam Bhattacharya\n\nAbstract: \nLet s be a point so
urce of light inside an n-sided polygon P. A polygonal path from s to some
point t inside P is called a diffuse reflection path if the turning point
s of the path lie on edges of P. A diffuse reflection path is said to be o
ptimal if it has the minimum number of reflections on the path. In this ta
lk\, I will present three different algorithms for this problem which prod
uce suboptimal paths\, but provide some performance guarantees.\n\nFor con
structing such a path\, the first algorithm uses a greedy method\, the sec
ond algorithm uses a transformation of a minimum link path\, and the third
algorithm uses the edge-edge visibility graph of P. The first two algorit
hms work only for polygons without holes\, and they run in O( n + k log n
) time\, where k denotes the number of reflections in the constructed path
. The third algorithm works for polygons with or without holes\, and it ru
ns in O(n^2) time. Moreover\, the number of reflections in the path produc
ed by this third algorithm is guaranteed to be at most thrice that of an o
ptimal diffuse reflection path.\n\n\nREFERENCE:\nSubir Kumar Ghosh\, Parth
a P. Goswami\, Anil Maheshwari\, Subhas C. Nandy\, Sudebkumar Prasant Pal\
, Swami Sarvattomananda: Algorithms for computing diffuse reflection paths
in polygons. The Visual Computer 28(12): 1229-1237 (2012)\n\n\n\n \n
URL:https://www.tcs.tifr.res.in/web/events/497
DTSTART;TZID=Asia/Kolkata:20140606T143000
DTEND;TZID=Asia/Kolkata:20140606T160000
LOCATION:D-405 (D-Block Seminar Room)
END:VEVENT
END:VCALENDAR