 This is achieved by sorting the starts (lower bound) and ends (upper bound) of the bounding volume of each solid along a number of arbitrary axes.As the solids move, their starts and ends may overlap.When the bounding volumes of two solids overlap in all axes they are flagged to be tested by more precise and time-consuming algorithms.