1) An NxM image is scanned for 3D object content. If a new object begins(assume boxes on a table) we have can have 3 axis x,y.z we draw bound boxes xy and yz line intersect and increment the y value to find the parallel intersect(bottom of the box). At the beginning we draw also xz line intersect and z is incremented(depth). So the candidate image is rectangular prism boxed(3 dimensional). a) Write the algorithm b) What is the complexity assume we have B objects in the picture. Can we make this faster or lower complexity. How? Er ff 1) An NxM image is scanned for 3D object content. If a new object begins(assume boxes on a table) we have can have 3 axis x,y.z we draw bound boxes xy and yz line intersect and increment the y value to find the parallel intersect(bottom of the box). At the beginning we draw also xz line intersect and z is incremented(depth). So the candidate image is rectangular prism boxed(3 dimensional). a) Write the algorithm b) What is the complexity assume we have B objects in the picture. Can we make this faster or lower complexity. How? Er ff