Camera-Mars and Paul

We,(Paul and Mars) came up with a sort of solution to the camera problem. Our solution works with shapes that do not have walls. Here is an example of a walled shape;

What we found was that there was two distinct sub groups of shapes; Concave and Convex;

What we realized was that all convex shapes need only to have one camera, while the concave ones split into two categories; regular and irregular concave polygons. Regular Concave Polygons, or RCPs are concave polygons that from any point, and it does not need to be every point, in fact it can be one single point, a line can be drawn from that point to any point on the perimeter of the shape. The reverse is the definition for a ICP, or Irregular Concave Polygon. An example of a Irregular Concave Polygon is; ^^^^^^^^

 We classified some versions of RCPs also, because there are many models and shapes that work;

1. A rectangular figure with protrusions from the center; 

2. A figure with that has slanting walls with slopes less or equal to that of the point to the point on the end of that slope. You know what; since you guys don't understand what I just said, here is a picture;The green represents the area that the maroon or red dot can't see, while  the covered orange dot, its beneath the arrows starting points, represent the camera that can see everything, as demonstrated by the pink arrows.

That about covers it, and if you want more, go read some geometry paper on the blog about cameras.