Category:Art gallery problem

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search
English: The art gallery problem or museum problem is a well-studied visibility problem in computational geometry. It originates from a real-world problem of guarding an art gallery with the minimum number of guards which together can observe the whole gallery. In the computational geometry version of the problem the layout of the art gallery is represented by a simple polygon and each guard is represented by a point in the polygon. A set of points is said to guard a polygon if, for every point in the polygon, there is some such that the line segment between and does not leave the polygon.

<nowiki>Problema de la galería de arte; problème de la galerie d'art; Problema del guarda del museu; Problem der Museumswächter; problema da galeria de arte; نگارخانه هنری; 美术馆问题; Проблем уметничке галерије; Problema galeriei de artă; 美術館問題; בעיית הגלריה לאמנות; kunstgalerijprobleem; 美術館問題; Теорема галереї мистецтв; képtárprobléma; Taidemuseo-ongelma; art gallery problem; 美術館問題; 美术馆问题; Задача о картинной галерее; mathematical problem; این مساله را در زمره مسائل هندسه محاسباتی قرار دارد; задача в вычислительной геометрии; Problema de la galeria de arte; Satz von Chvátal; Problema do museu; művészeti galéria probléma; בעיית גלריית האומנות; museumprobleem</nowiki>
art gallery problem 
mathematical problem
Upload media
Instance of
Authority file
Edit infobox data on Wikidata


This category has only the following subcategory.

Media in category "Art gallery problem"

The following 39 files are in this category, out of 39 total.