Aim is to maximize the amount of area visibile to a source given it's initial position and the details of oter objects present.
We have also pondered over the famous Art Gallery Problem: Finding the minimum numbers of lights required to light up an art gallery (simple polygon)
The code for Art Galler Problem has been written in python, with visualizations using pygame. All the source is present in art_gallery folder.
To run the code on a specific polygon, details about polygon's vertices are to be listed in a file with x and co-ordinates of each vertex in a new line, and the vertices in counter clockwise order, see example polygons (/art_gallery/polygons) for reference, after that just run $ python main.py polygons/room from the art_gallery folder.
This was done as a course project for the course CS 357 - Optimization Algorithms & Techniques under Dr. Kapil Ahuja
Here is a demo screenshot for the Art Gallery Problem:
These sites helped us gain a lot of inspiration and information:
- http://www.redblobgames.com/articles/visibility/
- http://ncase.me/sight-and-light/
- Also reveal.js was very helpful for the presentation
- pygame, for Art Gallery Problem Visualization
- http://www.math.iit.edu/~kaul/talks/LongArtGalleryTalk.pdf
- http://www.tcs.tifr.res.in/~ghosh/lec-psgtech-sept11.pdf
- http://www.cimec.org.ar/twiki/pub/Cimec/GeometriaComputacional/DeBerg_-Computational_Geometry-_Algorithms_and_Applications_2e.pdf
- en.wikipedia.org/wiki/Art_gallery_problem
- http://www.cse.iitd.ernet.in/~ssen/geomschool/nandy/Art-gallery-approximation.pdf
- http://www.wseas.us/e-library/transactions/information/2008/28-593.pdf
- http://oa.upm.es/4599/1/INVE_MEM_2008_61596.pdf
- http://cs.smith.edu/~orourke/Papers/GenRandPoly.pdf
- http://scholarly-journals.com/sjmcs/archive/2013/June/pdf/Nami%20and%20Mohades.pdf
- http://www.optimization-online.org/DB_FILE/2013/11/4106.pdf
- Krishna Chaitanya / chaitan94
- Surya Teja / surya5
- Rajkumar Paseddula / rkpaseddula