Rohan Mehalwal

Rohan Mehalwal

Auto-generated profile, based on publicly available information

Rohan Mehalwal

Advanced Micro Devices, Inc

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 August 2024 in Proceedings of the ACM on Computer Graphics and Interactive Techniques
Verified
Journal Article
Open access
CBCarsten Benthin
Carsten Benthin
DMDaniel Meister
Daniel Meister
JBJoshua Barczak
Joshua Barczak
RMRohan Mehalwal
Rohan Mehalwal
JTJohn Tsakok
John Tsakok
AKAndrew Kensler
Andrew Kensler
We propose a novel GPU-oriented approach for constructing binary bounding volume hierarchies (BVHs) based on the parallel locally-ordered clustering (PLOC/PLOC++) algorithm. Compared to competing high-performance GPU BVH build algorithms (PLOC++ or ATRBVH), our method provides similar BVH quality in just a single kernel launch while achieving 1.1-3.6× lower construction times for the entire BVH build and 1.6-13× lower for just the binary BVH construction phase. Additionally, we propose an efficient algorithm to convert a binary BVH to an n-wide BVH with just a single kernel launch. Besides being extremely efficient, our proposed algorithms are simple to implement, allowing easy integration into existing frameworks.

19 September 2025 in Computer Graphics Forum
Verified
Journal Article
Closed access
MKMichael A. Kern
Michael A. Kern
AGAlain Galvan
Alain Galvan
DODavid R. Oldcorn
David R. Oldcorn
DSDaniel Skinner
Daniel Skinner
RMRohan Mehalwal
Rohan Mehalwal
MCMatthäus G. Chajdas
Matthäus G. Chajdas

28 June 2025 in arXiv
Verified
Preprint
Open access
PDF file
MKMichael A. Kern
Michael A. Kern
AGAlain Galvan
Alain Galvan
DODavid Oldcorn
David Oldcorn
DSDaniel Skinner
Daniel Skinner
RMRohan Mehalwal
Rohan Mehalwal
MCMatthäus G. Chajdas
Matthäus G. Chajdas
Oriented bounding box (OBB) bounding volume hierarchies offer a more precise fit than axis-aligned bounding box hierarchies in scenarios with thin elongated and arbitrarily rotated geometry, enhancing intersection test performance in ray tracing. However, determining optimally oriented bounding boxes can be computationally expensive and have high memory requirements. Recent research has shown that pre-built hierarchies can be efficiently converted to OBB hierarchies on the GPU in a bottom-up pass, yielding significant ray tracing traversal improvements. In this paper, we introduce a novel OBB construction technique where all internal node children share a consistent OBB transform, chosen from a fixed set of discrete quantized rotations. This allows for efficient encoding and reduces the computational complexity of OBB transformations. We further extend our approach to hierarchies with multiple children per node by leveraging Discrete Orientation Polytopes (k-DOPs), demonstrating improvements in traversal performance while limiting the build time impact for real-time applications. Our method is applied as a post-processing step, integrating seamlessly into existing hierarchy construction pipelines. Despite a 12.6% increase in build time, our experimental results demonstrate an average improvement of 18.5% in primary, 32.4% in secondary rays, and maximum gain of 65% in ray intersection performance, highlighting its potential for advancing real-time applications.