In this paper we study an algorithm for approximating fixed points using simplicial subdivisions of the simplex. Furthermore, it is compared with algorithms of primitive sets.