Speaker: Nguyen Thi Le
Time: 14h00, Tuesday, June 30, 2020
Abstract: We present the problem of finding shortest path on polyhedral surfaces under convex distance functions such that critical refractions between any geodesic and any surface edge can be avoided, which is proposed by Cheng and Jin "Shortest paths on polyhedral surfaces and terrains" in Proceedings of the forty-sixth annual ACM symposium on Theory of computing (pp. 373-382).
Online via google meet:
https://meet.google.com/fgc-ahcu-sio
Dial-in: (US) +1 631-616-9366 PIN: 660 496 817# | 
