Author:
Schuierer Sven,Wood Derick
Publisher
Springer Science and Business Media LLC
Reference14 articles.
1. A. Aggarwal.The Art Gallery Theorem: Its Variations, Applications, and Algorithmic Aspects. PhD thesis, The Johns Hopkins University, Baltimore, Maryland, 1984.
2. T.Asano and G.Toussaint. Computing the geodesic center of a simple polygon. In D. S.Johnson, editor,Discrete Algorithms and Complexity, Perspectives in Computing, pages 65?74. Academic Press, 1987.
3. P.Belleville. Computing two-covers of simple polygons. Master's thesis, McGill University, 1991.
4. M. Breen. Clear visibility and the dimension of kernels of starshaped sets.Proc. Amer. Math. Soc. 85 (1982), 414?418.
5. I. Bjorling-Sachs andD. Souvaine. An efficient algorithm for guard placement in polygons with holes.Discrete Comput. Geom. 13 (1995), 77?110.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Starshaped sets;Aequationes mathematicae;2020-05-20