Visualizing large molecular data requires efficient means of rendering millions of data
elements that combine glyphs, geometry and volumetric techniques. The geometric and …

Stream compaction, also known as stream filtering or selection, produces a smaller output
array which contains the indices of the only wanted elements from the input array for further …

Stream compaction, the parallel removal of selected items from a list, is a fundamental
building block in parallel algorithms. It is extensively used, both in computer graphics, for …

Interactive isosurface visualisation has been made possible by mapping algorithms to GPU
architectures. However, current state‐of‐the‐art isosurfacing algorithms usually consume …

In this paper we propose a novel and efficient rasterization‐based approach for direct
rendering of isosurfaces. Our method exploits the capabilities of task and mesh shader …

Interpreters are well researched in the field of compiler construction and program
generation. They are typically used to realize program execution of different programming …

Stream compaction, also known as stream filtering or selection, produces a smaller output
array which contains the indices of the only selected elements from the input array for further …

Many highly parallel algorithms usually generate large volumes of data containing both valid
and invalid elements, and high‐performance solutions to the stream compaction problem …

Stream compaction, frequently found in a large variety of applications, serves as a general
primitive that reduces an input stream to a subset containing only the wanted elements so …

Asymmetric data patterns and workloads pose a challenge to massively parallel algorithm
design, in particular for modern wide-SIMD architectures exhibiting several levels of …