Mueller-Roemer, J. S. ; Altenhofen, C. ; Stork, A. (2017)
Ternary Sparse Matrix Representation for Volumetric Mesh Subdivision and Processing on GPUs.
In: Computer Graphics Forum, 36 (5)
doi: 10.1111/cgf.13245
Artikel, Bibliographie
Kurzbeschreibung (Abstract)
In 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 3× to 531×, for sufficiently large meshes, while reducing memory consumption by up to 36%.
| Typ des Eintrags: | Artikel |
|---|---|
| Erschienen: | 2017 |
| Autor(en): | Mueller-Roemer, J. S. ; Altenhofen, C. ; Stork, A. |
| Art des Eintrags: | Bibliographie |
| Titel: | Ternary Sparse Matrix Representation for Volumetric Mesh Subdivision and Processing on GPUs |
| Sprache: | Englisch |
| Publikationsjahr: | August 2017 |
| Titel der Zeitschrift, Zeitung oder Schriftenreihe: | Computer Graphics Forum |
| Jahrgang/Volume einer Zeitschrift: | 36 |
| (Heft-)Nummer: | 5 |
| DOI: | 10.1111/cgf.13245 |
| URL / URN: | https://onlinelibrary.wiley.com/doi/full/10.1111/cgf.13245 |
| Kurzbeschreibung (Abstract): | In 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 3× to 531×, for sufficiently large meshes, while reducing memory consumption by up to 36%. |
| Freie Schlagworte: | Concurrent programming, Parallel programming, Computational geometry, Object modeling, Object representation |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Graphisch-Interaktive Systeme |
| Hinterlegungsdatum: | 04 Mai 2020 12:56 |
| Letzte Änderung: | 04 Mai 2020 12:56 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum