Abstract: Multi-hit ray traversal is a class of ray traversal algorithms that finds one or more, and possibly all, primitives intersected by a ray ordered by point of intersection. Multi- hit traversal generalizes traditional first-hit ray traversal and is useful in computer graphics and physics-based simulation. We introduce an efficient algorithm for ordered multi-hit ray traversal, investigate its performance in a GPU ray tracer, and demonstrate two problems easily solved with our algorithm.