As toroid (polyhedral torus) could not be convex, it is questionable if it is possible to 3-triangulate them (i.e. divide into tetrahedra with the original vertices). Here, we will discuss some examples of toroids to show that for each vertex number $n\geq7$, there exists a toroid for which triangulation is possible. Also we will study the necessary number of tetrahedra for the minimal triangulation.