Sciweavers

1017 search results - page 45 / 204
» Radiosity on Graphics Hardware
Sort
View
MST
2011
231views Hardware» more  MST 2011»
12 years 11 months ago
On the Complexity of Matroid Isomorphism Problem
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
B. V. Raghavendra Rao, Jayalal M. N. Sarma
GRAPHICSINTERFACE
2001
13 years 10 months ago
Hardware Accelerated Displacement Mapping for Image Based Rendering
In this paper, we present a technique for rendering displacement mapped geometry using current graphics hardware. Our method renders a displacement by slicing through the enclosin...
Jan Kautz, Hans-Peter Seidel
CGF
2004
113views more  CGF 2004»
13 years 8 months ago
Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful
We present a simple but powerful algorithm for optimizing the usage of hardware occlusion queries in arbitrary complex scenes. Our method minimizes the number of issued queries an...
Jirí Bittner, Michael Wimmer, Harald Piring...
RT
2001
Springer
14 years 1 months ago
Hardware-Accelerated from-Region Visibility Using a Dual Ray Space
This paper describes a novel from-region visibility algorithm, the unique properties of which allow conducting remote walkthroughs in very large virtual environments, without prepr...
Vladlen Koltun, Yiorgos Chrysanthou, Daniel Cohen-...
BMCBI
2008
211views more  BMCBI 2008»
13 years 9 months ago
CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
Svetlin Manavski, Giorgio Valle