Is there any one made a surveillance camera system?

Are you refering to the computational geometry problem of minimum number of cameras required to cover total internal area of a set of connected nonregular polygons?

If so...

A set (S) of points is said to guard a series of polygons if, for every point (p) in the polygons, there is some range (q) in S such that the line segment between p and q does not leave any of the polygons.

For this, first draw plan of room(s), and count number of planes (Pv) and vertices (Vn)

Then calculate the minimum number of camera (N) where...

S is complete and p > q and , and , Vn is subsectioned by Pv as a function of S.

In other words, place cameras on vertices where AT LEAST three rooms are visible, the one you are in, plus cross exits and entrances to other rooms.

Then, should S still be incomplete, add another camera where S can be completed in each room and ANOTHER room can be seen.



The plan should be drawn with triangular vectors to show completness of S.

(BTW , for the mathematicians out there, this is an NP Complete solution.)

There would be no need to phase, as all cameras can have the feed saved.


Hope this helps