Category:Art gallery problem
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.
mathematical problem  | |||
| Upload media | |||
 Wikipedia | |||
| Instance of | mathematical problem | ||
|---|---|---|---|
| |||
 | |||
Subcategories
This category has only the following subcategory.
Media in category "Art gallery problem"
The following 27 files are in this category, out of 27 total.
Argawall.svg 750 × 750; 3 KB
Art gallery problem.svg 800 × 800; 15 KB
Art-gallery-12.svg 1,052 × 744; 4 KB
Art-gallery-51.svg 1,052 × 744; 3 KB
Art-gallery-52.svg 1,052 × 744; 3 KB
Art-gallery-53.svg 1,052 × 744; 3 KB
Art-gallery-54.svg 1,052 × 744; 3 KB
Art-gallery-60.svg 1,052 × 744; 3 KB
Art-gallery-61.svg 1,052 × 744; 3 KB
Art-gallery-90.svg 1,052 × 744; 3 KB
Art-gallery-counterexample.svg 744 × 700; 3 KB
Concave polygon vertex classification.svg 948 × 731; 5 KB
Dhm1.svg 500 × 535; 9 KB
Dhmline.svg 500 × 535; 9 KB
Dhmraw.svg 500 × 535; 4 KB
Diagonalenwächter sternförmig.svg 1,500 × 750; 5 KB
Festung-freie-wächter.svg 750 × 750; 7 KB
Hole1.svg 1,052 × 744; 5 KB
Hole2.svg 1,052 × 744; 4 KB
Hole3.svg 744 × 1,052; 3 KB
Kamm.svg 1,052 × 744; 3 KB
Konvexe ecken.svg 500 × 500; 5 KB
N sternförmig.svg 1,500 × 750; 4 KB
Quad1.svg 1,000 × 750; 4 KB
Quad2.svg 750 × 750; 7 KB
R sternförmig.svg 1,500 × 750; 5 KB
Sternförmig kantenwächter.svg 1,500 × 1,500; 4 KB
