An application developed in C++, used for partitioning a concave polygon into multiple convex pieces for efficient use of various Geometric algorithms. It is based on the Monotone Partitioning algorithm..
This project provides an interactive visualization of the methodology to optimally solve the Art Gallery/Street Light Placement problem on a simple polygon.
Add a description, image, and links to the monotone-partitioning topic page so that developers can more easily learn about it.
To associate your repository with the monotone-partitioning topic, visit your repo's landing page and select "manage topics."