In this paper, we study two basic problems about planar computational geometry with bracket method. One is how to judge whether a point is inside a given convex polygon, the other is how to compute the convex hull of planar points. The key idea of our criteria is to use the bracket, which is made up of the homogeneous coordinates for points, to carry out the judgment and computation. Experiments show that the proposed method is significantly efficientand robust.