BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Anisotropic Path Problems
DTSTART:20140617T140000
DTSTAMP:20260407T163441Z
UID:30bb4df799ddad0998e5ca983a40fc02a50354be9d91342483159e6d
CATEGORIES:Conferences - Seminars
DESCRIPTION:Siu-Wing CHENG\, The Hong Kong University of Science and Techn
 ology\, Hong Kong\nFinding shortest paths is a classical geometric optimiz
 ation problem\, but relatively less is known about cost models that depend
  on the travel direction than the standard Euclidean case or the isotropic
  weighted region case.  But there are daily examples in which travel dire
 ction does matter.  For example\, the strength and direction of wind\, cu
 rrent\, or other force field may need to be considered.  When planning a 
 roadway or hiking on a terrain\, it may be impossible to ascend or descend
  along slopes that are too steep\, and the cost of a subpath may depend on
  the its slope.  In this talk\, we discuss some of the algorithmic result
 s that we obtained in recent years\, including approximation algorithms fo
 r the anisotropic path problems in the plane\, on a terrain\, and on polyh
 edral surfaces.  In particular\, our results allow us to find an approxim
 ate shortest path on a terrain with gradient constraints and under cost fu
 nctions that are linear combinations of path length and total ascent.  Th
 is talk represents joint work with several collaborators\, including Jiong
 xin Jin\, Hyeon-Suk Na\, Antoine Vigneron\, and Yajun Wang.
LOCATION:BC 420 https://plan.epfl.ch/?room==BC%20420
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR