Yang, XinLiu, QiYin, BaocaiZhang, QiangZhou, DongshengWei, XiaopengMatthias Zwicker and Pedro Sander2017-06-192017-06-192017978-3-03868-045-11727-3463http://dx.doi.org/10.2312/sre.20171200https://diglib.eg.org:443/handle/10.2312/sre20171200We present a k-d tree construction algorithm designed to accelerate rendering of scenes with motion blur, in application scenarios where a k-d tree is either required or desired. Our associated data structure focuses on capturing incoherent motion within the nodes of a k-d tree and improves both data structure quality and efficiency over previous methods. At build-time stage, we tracks primitives with motion that is significantly distinct from other primitives within the node, guarantee valid node references and the correctness of the data structure via primitive duplication heuristic and propagation rules. Our experiments with this hierarchy show artifact-free motion-blur rendering using a k-d tree, and demonstrate improvements against a traditional BVH with interpolation and a MSBVH structure designed to handle moving primitives, particularly in render time.I.3.6 [Computer Graphics]Methodology and TechniquesGraphics data structures and data typesI.3.7 [Computer Graphics]Three Dimensional Graphics and RealismRaytracing10.2312/sre.20171200113-119