As pointed out by A. Aggarwal the lower bound proof for convex hull problem of Steele and Yao is only positive when the points are not necessarily in general position. It is nuclear whether their proof can be modified to handle the case where there is no any restriction on the solution set of the problem. In the fixed-order algebraic-descision -tree model this paper solves the problem completely.