Problem der Museumswächter (German Wikipedia)

Analysis of information sources in references of the Wikipedia article "Problem der Museumswächter" in German language version.

refsWebsite

Global rank German rank

2^nd place

3^rd place

1,185^th place

2,009^th place

207^th place

961^st place

acm.org

Jörg-Rüdiger Wolfgang Sack: Rectilinear computational geometry. ACM, 1984, abgerufen am 11. März 2010. und J. R. Sack, G. Toussaint: A linear-time algorithm for decomposing rectilinear star-shaped polygons into convex quadrilaterals. In: Proceedings 19th Conference on Communications, Control, and Computing. 1981, S. 21–30.
Anna Lubiw: Decomposing polygonal regions into convex quadrilaterals. In: Proceedings of the first annual symposium on Computational geometry. ACM, Baltimore, Maryland, United States 1985, ISBN 0-89791-163-6, S. 97–106, doi:10.1145/323233.323247 (online [abgerufen am 13. März 2010]).

J. Kahn, M. Klawe, D. Kleitman: Traditional galleries require fewer watchmen. In: SIAM Journal on Algebraic and Discrete Methods. Band 4, 1983, S. 194, doi:10.1137/0604020.
Anna Lubiw: Decomposing polygonal regions into convex quadrilaterals. In: Proceedings of the first annual symposium on Computational geometry. ACM, Baltimore, Maryland, United States 1985, ISBN 0-89791-163-6, S. 97–106, doi:10.1145/323233.323247 (online [abgerufen am 13. März 2010]).

D. Avis, G. T. Toussaint: An efficient algorithm for decomposing a polygon into star-shaped polygons. In: Pattern Recognition. Band 13, Nr. 6, 1981, S. 395–398 (Online [PDF]).