In three dimensions, we may have a solid object that is partitioned into tetrahedra in two different ways. The ideas of this paper can be extended into finding the volumes of the all the non-empty intersections of any two tetrahedra[ ]. This could be useful in processing geological databases. Implementing this 3-D algorithm should be feasible, although harder than doing two dimensional case.