Evaluation of per-pixel linked lists for distributed rendering and comparative analysis

Rendering scenes with overlapping transparent faces is challenging for several reasons, including sorting geometry, managing multiple per-pixel fragments, and compositing. These questions have been solved for local rendering previously, for example by order-independent transparency approaches like Depth Peeling or A-buffer implementations. We discuss order-independent transparency algorithms in context of distributed rendering for large data sets or simulations which by design split the work load among a number of computation nodes. Furthermore, we evaluate a per-pixel linked list approach for distributed mesh rendering and multi-variant analysis of molecule data sets.

[1]  T. N. Bhat,et al.  The Protein Data Bank , 2000, Nucleic Acids Res..

[2]  Cass W. Everitt,et al.  Interactive Order-Independent Transparency , 2001 .

[3]  Thomas Ertl,et al.  Hardware-Accelerated Glyphs for Mono- and Dipoles in Molecular Dynamics Visualization , 2005, EuroVis.

[4]  Tom Duff,et al.  Compositing digital images , 1984, SIGGRAPH.

[5]  James F. Blinn,et al.  A Generalization of Algebraic Surface Drawing , 1982, TOGS.

[6]  Loren C. Carpenter,et al.  The A -buffer, an antialiased hidden surface method , 1984, SIGGRAPH.

[7]  Aaron E. Lefohn,et al.  Adaptive transparency , 2011, HPG '11.

[8]  Min Chen,et al.  Visual Supercomputing: Technologies, Applications and Challenges , 2005, Comput. Graph. Forum.

[9]  Louis Bavoil,et al.  Order Independent Transparency with Dual Depth Peeling , 2008 .

[10]  Ali Meligy,et al.  Parallel and Distributed Visualization: The State of the Art , 2008, 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation.

[11]  Martin Burtscher,et al.  Floating-point data compression at 75 Gb/s on a GPU , 2011, GPGPU-4.

[12]  Louis Bavoil,et al.  Constant-Memory Order-Independent Transparency , 2011 .

[13]  M. Carter.  Computer graphics: Principles and practice , 1997 .

[14]  Fang Liu,et al.  Efficient depth peeling via bucket sort , 2009, High Performance Graphics.

[15]  J. Richardson,et al.  The anatomy and taxonomy of protein structure. , 1981, Advances in protein chemistry.

[16]  Hans-Peter Seidel,et al.  MPI Informatics building model as data for your research , 2009 .

[17]  João Luiz Dihl Comba,et al.  A survey of raster-based transparency techniques , 2011, Comput. Graph..

[18]  Aaron E. Lefohn,et al.  Multi-fragment effects on the GPU using the k-buffer , 2007, SI3D.

[19]  Ioannis Fudos,et al.  Z-fighting aware depth peeling , 2011, SIGGRAPH '11.

[20]  F M Richards,et al.  Areas, volumes, packing and protein structure. , 1977, Annual review of biophysics and bioengineering.

[21]  Justin Hensley,et al.  Real‐Time Concurrent Linked List Construction on the GPU , 2010, Comput. Graph. Forum.

[22]  Herbert Edelsbrunner,et al.  Deformable Smooth Surface Design , 1999, Discret. Comput. Geom..

[23]  Maxim Makhinya.  Performance challenges in distributed rendering systems , 2012 .

[24]  Markus Gross,et al.  Point-Based Graphics , 2007 .

[25]  Renato Pajarola,et al.  Equalizer: A Scalable Parallel Rendering Framework , 2008, IEEE Transactions on Visualization and Computer Graphics.

[26]  Ken Brodlie,et al.  Distributed and Collaborative Visualization , 2004, Comput. Graph. Forum.

[27]  Craig M. Wittenbrink.  R-buffer: a pointerless A-buffer hardware architecture , 2001, HWWS '01.

[28]  Geoff Leach,et al.  Efficient layered fragment buffer techniques , 2012 .

[29]  Philipp Slusallek,et al.  DRONE: A Flexible Framework for Distributed Rendering and Display , 2009, ISVC.