Marching tetrahedrons is an algorithm in the field of computer graphics to render implicit surfaces. It was developed to circumvent a patent on the marching cubes algorithm. It also clarifies a minor ambiguity problem of marching cubes with some cube configurations.