Abstract
Let s be a point in a polygonal domain P of h - 1 holes and n vertices. We consider a quickest visibility query problem. Given a query point q in P, t......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
