- Implicit Surface Octrees For Ray Tracing Point Models, Sriram Kashyap, Rhushabh Goradia, Sharat Chandran, Parag Chaudhuri. In the Proceedings of ICVGIP 2010, Seventh Indian Conference on Computer Vision, Graphics and Image Processing.
- GPU-Based Ray Tracing of Splats, Rhushabh Goradia, Prekshu Ajmera, Sharat Chandran. In the Proceedings of Pacific Graphics 2010, 18th Pacific Conference on Computer Graphics and Applications, as a poster with $8$ page paper.
- Real Time Ray Tracing of Point-based Models, Sriram Kashyap, Rhushabh Goradia, Sharat Chandran, Parag Chaudhuri. In the Proceedings of I3D 2010, ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games.
- GPU-based hierarchical Computations for View-Independent Visibility, Rhushabh Goradia, Prekshu Ajmera, Sharat Chandran. In the Proceedings of ICVGIP 2008, Sixth Indian Conference on Computer Vision, Graphics and Image Processing.
Abstract:With rapid improvements in the performance and programmability,
Graphics Processing Units (GPUs) have fostered considerable interest
in substantially reducing the running time of compute intensive
problems. The solution to the view-independent mutual point-pair
visibility problem (required for inter-reflections in global
illumination) can, it would seem, require the capabilities of the
In this paper, various ways of parallelizing the construction of
the Visibility Map (V-map, a description of mutual visibility) are
presented to lead the way for an implementation that achieves a
speedup of 11 or more. We evaluate our scheme qualitatively
and quantitatively, and conclude that parallelizing the V-map
construction algorithm is eminently useful.
- Fast, Parallel, GPU-based Construction of Space Filling Curves and Octrees, Rhushabh Goradia, Prekshu Ajmera, Sharat Chandran, Srinivas Aluru. In the Proceedings of ACM SIGGRAPH i3D 2008, Symposium on Interactive 3D Graphics and Games.
Abstract: Space Filling Curves (SFC) are particularly useful in linearization of data living in two and three dimensional spaces and have been used in a number of applications in scientific computing, and visualization. Interestingly, octrees, another versatile data structure in computer graphics, can be viewed as multiple SFCs at varying resolutions, albeit with parent-child relationship. In this paper we provide a parallel implementation of SFCs and octrees on GPUs that rely on algorithms designed to minimize or eliminate communications.
- Visibility Map for Global Iluumination in Point Clouds, Rhushabh Goradia, Anilkumar Kanakanti, Sharat Chandran, Amitava Datta. In the Proceedings of ACM SIGGRAPH GRAPHITE 2007, 5th International Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia.
Abstract: Point-sampled geometry has gained significant interest due to their simplicity. The lack of connectivity touted as a plus, however, creates difficulties in many operations like generating global illumination effects. This becomes especially true when we have a complex scene consisting of several models. The data is often hard to segment as individual models and hence not suitable for surface reconstruction.
Inter-reflections in such complex scenes requires knowledge of visibility between point pairs. Computing visibility for point models is all the more difficult (than for polygonal models), since we do not have any surface or object information. We present in this paper a novel, hierarchical, fast and memory efficient algorithm to compute a description of mutual visibility in the form of a visibility map. Ray shooting and visibility queries can be answered in sub-linear time using this data structure. We evaluate our scheme analytically, qualitatively, and quantitatively and conclude that these maps are desirable.
Back to top
Last update: Mar, 2008