5392
Jens Kruger, Jens Schneider, Rudiger Westermann
In this paper we present a compression scheme for large point scans including per-point normals. For the encoding of such scans we introduce a particular type of closest sphere packing grids, the hexagonal close packing (HCP). HCP grids provide a structure for an optimal packing of 3D space, and for a given sampling error they […]
View View   Download Download (PDF)   
Steven P. Callahan, Joao L. D. Comba, Peter Shirley, Claudio T. Silva
We describe a new dynamic level-of-detail (LOD) technique that allows real-time rendering of large tetrahedral meshes. Unlike approaches that require hierarchies of tetrahedra, our approach uses a subset of the faces that compose the mesh. No connectivity is used for these faces so our technique eliminates the need for topological information and hierarchical data structures. […]
View View   Download Download (PDF)   
Minho Kim, Jorg Peters
In “A realtime GPU subdivision kernel” (SIGGRAPH 2005), Shiue et al. showed that, in principle, all major features of subdivision algorithms can be realized in the framework of highly parallel stream processing. Shiue et al. tested the approach by implementing Catmull-Clark subdivision, with semi-smooth creases and global boundaries, in programmable graphics hardware, at near realtime […]
View View   Download Download (PDF)   
Minglun Gong, Yee-Hong H. Yang
A novel algorithm is presented in this paper for estimating reliable stereo matches in real time. Based on the dynamic programming-based technique we previously proposed, the new algorithm can generate semi-dense disparity maps using as few as two dynamic programming passes. The iterative best path tracing process used in traditional dynamic programming is replaced by […]
View View   Download Download (PDF)   
Takashi Machida, Naokazu Yokoya, Haruo Takemura
This paper investigates the problem of object surface reflectance modeling, which is sometimes referred to as inverse reflectometry, for photorealistic rendering and effective multimedia applications. A number of methods have been developed for estimating object surface reflectance properties in order to render real objects under arbitrary illumination conditions. However, it is still difficult to densely […]
View View   Download Download (PDF)   
Tim Foley, Jeremy Sugerman
Modern graphics hardware architectures excel at compute-intensive tasks such as ray-triangle intersection, making them attractive target platforms for raytracing. To date, most GPU-based raytracers have relied upon uniform grid acceleration structures. In contrast, the kd-tree has gained widespread use in CPU-based raytracers and is regarded as the best general-purpose acceleration structure. We demonstrate two kd-tree […]
View View   Download Download (PDF)   
J. Kruger, P. Kipfer, P. Konclratieva, R. Westermann
We present a particle system for interactive visualization of steady 3D flow fields on uniform grids. For the amount of particles we target, particle integration needs to be accelerated and the transfer of these sets for rendering must be avoided. To fulfill these requirements, we exploit features of recent graphics accelerators to advect particles in […]
View View   Download Download (PDF)   
Daniel R. Horn, Mike Houston, Pat Hanrahan
The proliferation of biological sequence data has motivated the need for an extremely fast probabilistic sequence search. One method for performing this search involves evaluating the Viterbi probability of a hidden Markov model (HMM) of a desired sequence family for each sequence in a protein database. However, one of the difficulties with current implementations is […]
View View   Download Download (PDF)   

* * *

* * *

Follow us on Twitter

HGPU group

1748 peoples are following HGPU @twitter

Like us on Facebook

HGPU group

371 people like HGPU on Facebook

HGPU group © 2010-2016 hgpu.org

All rights belong to the respective authors

Contact us: