Mueller-Roemer, Johannes SebastianAltenhofen, ChristianStork, AndréBærentzen, Jakob Andreas and Hildebrandt, Klaus2017-07-022017-07-0220171467-8659https://doi.org/10.1111/cgf.13245https://diglib.eg.org:443/handle/10.1111/cgf13245In this paper, we present a novel volumetric mesh representation suited for parallel computing on modern GPU architectures. The data structure is based on a compact, ternary sparse matrix storage of boundary operators. Boundary operators correspond to the first-order top-down relations of k-faces to their (k-1)-face facets. The compact, ternary matrix storage format is based on compressed sparse row matrices with signed indices and allows for efficient parallel computation of indirect and bottomup relations. This representation is then used in the implementation of several parallel volumetric mesh algorithms including Laplacian smoothing and volumetric Catmull-Clark subdivision. We compare these algorithms with their counterparts based on OpenVolumeMesh and achieve speedups from 3x to 531x, for sufficiently large meshes, while reducing memory consumption by up to 36%.D.1.3 [Programming Techniques]Concurrent ProgrammingParallel ProgrammingI.3.5 [Computer Graphics]Computational Geometry and Object ModelingCurvesurfacesolidand object representations10.1111/cgf.13245059-069