Reference8 articles.
1. Visibility of disjoint polygons;Asano;Algorithmica,1986
2. Optimal point location in a monotone subdivision;Edelsbrunner;SIAM J. Comput.,1986
3. L. Guibas, J. Hershberger, D. Leven, M. Sharir and R.E. Tarjan, Linear time algorithms for visibility and shortest path problems inside simple polygons, Proc. 2nd ACM Symp. Computational Geometry, Yorktown Heights, New York, 1986, pp.1–13.
4. Computing Dirichlet tessellation in the plane;Green;The Computer Journal,1978
5. Optimal search in planar subdivisions;Kirkpatrick;SIAM J. Comput.,1983
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献