ISBN:  Unavailable

Category: Unavailable

Page count: 28

The task of 3-D data acquisition is divided into two subproblems: to see what is illuminated and to properly direct the illuminating plane to illuminate the entire scene. The first kind of occlusions are easily detected and can be used in designing an efficient algorithm. We develop a strategy to determine the sequence of different views using the information in a narrow zone around the occluded regions. Occluded regions are approximated by polygons. Based on the height information of the border of the occluded regions and geometry of the edges of the polygonal approximation, the next views in the same scanning plane are determined. From the acquired information in the first scanning plane the directions of the next scanning planes are computed."