3 citations · 3 across the 1 of their papers we have counts for
1 paper · 1 filter
Yam Ki Cheung, Ovidiu Daescu
We address the point-to-face approximate shortest path problem in R: Given a set of polyhedral obstacles with a total of n vertices, a source point s, an obstacle face f, and a rea…