Author:
Bjorling-Sachs I.,Souvaine D. L.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference9 articles.
1. D. Avis and G. T. Toussaint, An efficient algorithm for decomposing a polygon into star-shaped pieces,Pattern Recognition 13 (1981), 395–398.
2. I. Bjorling-Sachs and D. Souvaine, A Tight Bound for Guarding Polygons with Holes, Rutgers University Technical Report LCSR-TR-165, May 1991. Abstract appears inFinal Report of MSI Stony Brook Workshop on Computational Geometry, Stony Brook, Oct. 1991, p. 17.
3. V. Chvátal, A combinatorial theorem in plane geometry,Journal of Combinatorial Theory, Series B 18 (1975), 39–41.
4. S. Fisk, A short proof of Chvátal's watchman theorem,Journal of Combinatorial Theory, Series B 24 (1978), 374.
5. F. Hoffmann, Colloquium, Department of Computer Science, Rutgers University, 24. Oct. 1991.
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献