Vertex-transformation streams

被引:10
作者
Kim, Youngmin [1 ]
Lee, Chang Ha [1 ]
Varshney, Amitabh [1 ]
机构
[1] Univ Maryland, Dept Comp Sci, College Pk, MD 20742 USA
基金
美国国家科学基金会;
关键词
stream programming; arithmetic intensity; geometry instancing; transformation encoding; streaming algorithms;
D O I
10.1016/j.gmod.2006.03.005
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Recent trends in parallel computer architecture strongly suggest the need to improve the arithmetic intensity (the compute to bandwidth ratio) for greater performance in time-critical applications, such as interactive 3D graphics. At the same time, advances in stream programming abstraction for graphics processors (GPUs) have enabled us to use parallel algorithm design methods for GPU programming. Inspired by these developments, this paper explores the interactions between multiple data streams to improve arithmetic intensity and address the input geometry bandwidth bottleneck for interactive 3D graphics applications. We introduce the idea of creating vertex and transformation streams that represent large point datasets via their interaction. We discuss how to factor such point datasets into a set of source vertices and transformation streams by identifying the most common translations amongst vertices. We accomplish this by identifying peaks in the cross-power spectrum of the dataset in the Fourier domain. We validate our approach by integrating it with a view-dependent point rendering system and show significant improvements in input geometry bandwidth requirements as well as rendering frame rates. (C) 2006 Elsevier Inc. All rights reserved.
引用
收藏
页码:371 / 383
页数:13
相关论文
共 37 条
[1]   Point set surfaces [J].
Alexa, M ;
Behr, J ;
Cohen-Or, D ;
Fleishman, S ;
Levin, D ;
Silva, CT .
VISUALIZATION 2001, PROCEEDINGS, 2001, :21-28
[2]  
[Anonymous], 2003, SUPERCOMPUTING SC
[3]  
[Anonymous], 1997, COMPUTER ARCHITECTUR
[4]   G protein-coupled receptor desensitization as a measure of signaling: Modeling of arrestin recruitment to activated CCK-B receptors [J].
Barak, LS ;
Oakley, RH ;
Shetzlinef, MA .
ASSAY AND DRUG DEVELOPMENT TECHNOLOGIES, 2003, 1 (03) :409-424
[5]   High-quality point-based rendering on modern GPUs [J].
Botsch, M ;
Kobbelt, L .
11TH PACIFIC CONFERENCE ON COMPUTER GRAPHICS AND APPLICATIONS, PROCEEDINGS, 2003, :335-343
[6]  
BOTSCH M, 2002, P 13 EUR WORKSH REND, P53
[7]   Brook for GPUs: Stream computing on graphics hardware [J].
Buck, I ;
Foley, T ;
Horn, D ;
Sugerman, J ;
Fatahalian, K ;
Houston, M ;
Hanrahan, P .
ACM TRANSACTIONS ON GRAPHICS, 2004, 23 (03) :777-786
[8]   A survey of visibility for walkthrough applications [J].
Cohen-Or, D ;
Chrysanthou, YL ;
Silva, CT ;
Durand, F .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2003, 9 (03) :412-431
[9]  
Cormen T. H., 1996, Introduction to Algorithms, V3rd
[10]   Sequential point trees [J].
Dachsbacher, C ;
Vogelgsang, C ;
Stamminger, M .
ACM TRANSACTIONS ON GRAPHICS, 2003, 22 (03) :657-662