Talk:Visibility graph

From Wikipedia, the free encyclopedia

Okay, I've learnt how to mark this as a stub now, and found out what a "peacock phrase" is and removed it.

On the space syntax link -- declaration of interest -- I have an interest in applications of graph theory to architecture and urban planning. If anyone feels it is wrong to mention it, please discuss it here.

Anyway -- things to do here:

Possibily separate out the art gallery problems into their own page (you'll note for now that I have simply linked it to here)

On the problems: cover both the number of guards and the guard placement problem. Fill in solutions to with and without holes. Mention that placement is NP-hard, and that there is only a lower bound on the number of guards for arbitrary polygon with holes. If anyone wants to take this on, please do.

--stochata 20:13, 30 Jan 2005 (UTC)

I definitely agree that the Art Gallery Problem(s) are important enough to warrant their own article. I will do this if nobody else gets around to it first. --Jamie King 12:12, 26 May 2006 (UTC)

I've created a separate article for the art gallery problem. I've also removed the paragraph about the art gallery problem because that paragraph wasn't really related to visibility graphs. The relationship between the art gallery problem and visibility graphs could be mentioned if someone feels like it. I did mention it briefly in the art gallery problem article. --Jamie King 20:04, 30 May 2006 (UTC)

[edit] Museum guard problem

Why does museum guard problem redirect here? Should there be a mention here? // Brick Thrower 11:55, 4 September 2006 (UTC)

Changed the museum guard problem to redirect to the art gallery problem. --Jamie King 15:42, 18 September 2006 (UTC)