The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
Byn Choi, Rakesh Komuravelli, Victor Lu, Hyojin Su...
In this poster, we present how our previously published method of computing continuous 2D scatterplots can be performed with hardware acceleration on a GPU. By doing this, we expl...
It has become increasingly difficult to drive a modern highperformance graphics accelerator at full speed with a serial immediate-mode graphics interface. To resolve this problem,...