Matthew Eastman

Let *P* be a simple polygon with *n* vertices. We will show how to preprocess the polygon so that, given two query points *s* and *t*, and a convex polygon *Q* with *m* vertices, we can determine in *O(m log ^{3}n)* time whether there exists a path from