We develop algorithms and data structures for the approximate Euclidean shortest path problem amid a set P of k convex obstacles in R and R, with a total of n faces. The running time of our algorithms is linear in n, and the size and query time of our data structure are independent of n. We follow a “core-set” based approach, i.e., we quickly compute a small sketch Q of P whose size is independ...