Minimum-Link Path in 2D

Given a polygonal domain in the plane with total complexity $n$ and two points $s$ and $t$ in the domain, find an $s$--$t$ polygonal path contained in the domain with the minimum number of links. Determine whether this can be done in $o(n^2)$ worst-case time.