A two dimensional robot in the plane is represented by an anticlockwise sequence of its boundary points, say n such points - two successive boundary points are connected by a stright-line segment. We want to determine if this robot can walk through a channel of width W.
Starting from the design of an algorithm write a program for the above problem. You are allowed to rotate as well as translate the robot. Finally the program should specify a way of accomplishing the task or declare that it is not possible. You are not allowed to use trigonometric functions in the program.