1. In a computing environment, a method comprising, building a kd-tree via graphics hardware-based parallel processing, including building nodes of the kd-tree in breadth-first search order, and differentiating between large nodes and small nodes while building the kd-tree.