Often times while doing a security analysis of a physical area, I am interested in the efficient placement of assets to monitor and secure an area. In mathematics the placement of security resources within an area is often modeled as a geometric area coverage problem. We can restate our problem as "What is the minimum number of resources required to cover the inside of a given polygon". Today I will discuss a software for analyzing and planning physical security layouts based off of the insights revealed by studying this problem.
