Abstract
We devise a data structure that can answer shortest path queries for two query points in a polygonal domain P on n vertices. For any ε>0, the space complexity of the data structure is O(n10+ε) and queries can be answered in O(logn) time. Alternatively, we can achieve a space complexity
... read more