Abstract
Abstract We present a highly parallel, linearly scalable technique of kd‐tree construction for ray tracing of dynamic geometry. We use conventional kd‐tree compatible with the high performing algorithms such as MLRTA or frustum tracing. Proposed technique offers exceptional construction speed maintaining reasonable kd‐tree quality for rendering stage. The algorithm builds a kd‐tree from scratch each frame, thus prior knowledge of motion /deformation or motion constraints are not required. We achieve nearly real‐time performance of 7‐12 FPS for models with 200K of dynamic triangles at 1024x1024 resolution with shadows and textures.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
