A GPU‐Adapted Structure for Unstructured Grids

A key advantage of working with structured grids (e.g., images) is the ability to directly tap into the powerful machinery of linear algebra. This is not much so for unstructured grids where intermediate bookkeeping data structures stand in the way. On modern high performance computing hardware, the...

Full description

Saved in:

Bibliographic Details
Published in:	Computer graphics forum Vol. 36; no. 2; pp. 495 - 507
Main Authors:	Zayer, Rhaleb, Steinberger, Markus, Seidel, Hans‐Peter
Format:	Journal Article
Language:	English
Published:	Oxford Blackwell Publishing Ltd 01.05.2017
Subjects:	Categories and Subject Descriptors (according to ACM CCS) Computer graphics Computer memory Computer peripherals Data structures Finite element method G.1.0 [Mathematics of Computing]: General—Parallel algorithms G.1.3 [Mathematics of Computing]: Numerical Linear Algebra — Sparse, structured, and very large systems Graphics processing units Hardware I.3.1 [Computer Graphics]: Hardware Architecture—Graphics processors I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling—Geometric algorithms, languages, and systems I.3.6 [Computer Graphics]: Methodology and Techniques — Graphics data structures and data types Linear algebra Machinery and equipment Mathematical analysis Matrix algebra Matrix methods Matrix representation Multiplication Sparsity Structured grids (mathematics) Unstructured grids (mathematics) Vector processing (computers)
ISSN:	0167-7055, 1467-8659
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!