This is an area of discrete geometry / computational geometry that I would like to learn more about! No better way than to start working on an interesting problem!
Do you mean the problem to allocate a least set of cameras to have the largest coverage of an art gallery? If so, it is very interesting, and has practical applications in geography for spatial planning and decision making. I had some related works:
Jiang B. and Liu X. (2010), Automatic generation of the axial lines of urban environments to capture what we perceive, International Journal of Geographical Information Science, 24(4), 545–558.
Jiang B. and Liu X. (2009), AxialGen: a research prototype for automatically generating the axial map, CUPUM’09, Hong Kong, Preprint, arxiv.org/abs/0902.0465.
Hi Bin,
Yes, It is exactly this type of problem (or variation of) that I am interested in working on! This large class of problems include the guarding of art galleries (vertex guards, galleries with holes, orthogonal galleries, etc), fortress problems (ie. guarding the exterior), prison yard problems (ie. guarding the interior and exterior), and illumination problems.
In particular, I'm more interested in the discrete geometry aspects as opposed to the algorithmic/computational aspects (although there are both in these types of problems).
All the best,
Richard M. Low
- Badges
- Science topic
- Similar topics
- Psychology
- Mental Processes
- Learning