Skip to content

Latest commit

 

History

History
50 lines (36 loc) · 3.62 KB

README.md

File metadata and controls

50 lines (36 loc) · 3.62 KB

2D Visibility Optimization

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: Art Galler Problem Demo Screenshot

Project Presentations

Demos

Inspiration & Resources

These sites helped us gain a lot of inspiration and information:

References

Team