On the Camera Placement Problem

We introduce a new probing problem: what is the minimum number of cameras at fixed positions necessary and sufficient to reconstruct any strictly convex polygon contained in a disk of radius 1 if cameras only see the silhouette of the polygon? The optimal number only depends on the largest angle α of the polygon. If no two camera tangents overlap, 3π π−α cameras are necessary and sufficient. Otherwise, approximately 4π π−α cameras are sufficient. Reconstruction only takes time linear in the number of cameras. We also give results for the 3D case.

• Type: Conference
• Year: 2009
• Where: ISAAC
• Authors: Rudolf Fleischer, Yihui Wang
• Keywords: Algorithms, Cameras, Convex Polygon, ISAAC 2009, π−α Cameras