There is no common algorithm that computes Boolean operators such as intersection, difference, union of two polyhedra. In this paper, we propose an algorithm to compute them in the same way. As the algorithm is based on the Boolean operations of two convex sets, polyhedra need to be represented as cell-complexes. The algorithm has two phases. First, it computes the vertices of cell complex to be generated. Then it constructs faces hierarchically to obtain topological information of the cell complex.