Vinkler, MarekBittner, JiříHavran, VlastimilVlastimil Havran and Karthik Vaiyanathan2017-12-062017-12-062017978-1-4503-5101-02079-8679https://doi.org/10.1145/3105762.3105782https://diglib.eg.org:443/handle/10.1145/3105762-3105782We propose an extension to the Morton codes used for spatial sorting of scene primitives. e extended Morton codes increase the coherency of the clusters resulting from the object sorting and work be er for non-uniform distribution of scene primitives. In particular, our codes are enhanced by encoding the size of the objects, applying adaptive ordering of the code bits, and using variable bit counts for di erent dimensions. We use these codes for constructing Bounding Volume Hierarchies (BVH) and show that the extended Morton code leads to higher quality BVH, particularly for the fastest available BVH build algorithms that heavily rely on spatial coherence of Morton code sorting. In turn, our method allows to achieve up to 54% improvement in the BVH quality especially for scenes with a non-uniform spatial extent and varying object sizes. Our method is easy to implement into any Morton code based build algorithm as it involves only a modi cation of the Morton code computation step.Information systems Multidimensional range searcheory of computation Sorting and searchingComputing methodologies Ray tracingray tracingbounding volume hierarchyMorton codes10.1145/3105762.3105782