This paper presents a fast and reliable method to trim non-solution regions in an interval ray tracing process. The “trimming algorithm” uses interval analysis to perform rejection tests in a set of pixels simultaneously, instead of individual pixels at each time. With this approach, the presented algorithm runs faster than the traditional interval ray tracing algorithm. Also, an interval algorithm to remove aliasing in the rendering of implicit surfaces is introduced. This algorithm obtains better visualizations than the traditional point sampling. This algorithm can render thin features that would be impossible to obtain with point sampling algorithms.