Efficient Adaptive and Dynamic Mesh Refinement Based on a Non-recursive Strategy

Summary, in English

In this paper, we present a meshing scheme for the implementation of an adaptive tessellation of triangular meshes on the graphics processing unit (GPU). Tessellation is performed according to a local test to generate primitives dynamically. The refinement procedure does not require the pre-computation of any refinement pattern. The resulting adaptive procedure is efficient and simple, and generates the tessellation pattern of each triangle dynamically. The non-recursive strategy simplifies mesh reconstruction, avoids irregular memory access patterns and uses a simple control flow to make it a good candidate to guide the evolution of tessellation algorithms on future graphics cards. To test our proposal, we have used the geometry shader of current GPUs to generate primitives dynamically.

• Författare: M. Boo; M. Amor; R. Concheiro; Michael Doggett
• Avdelning/ar: Institutionen för datavetenskap; ELLIIT: the Linköping-Lund initiative on IT and mobile communication; Parallella System
• Publiceringsår: 2013
• Språk: Engelska
• Sidor: 843-851
• Publikation/Tidskrift/Serie: Computer Journal
• Volym: 56
• Issue: 7
• Länkar: http://dx.doi.org/10.1093/comjnl/bxs046
• Dokumenttyp: Artikel i tidskrift
• Förlag: Oxford University Press
• Ämne: Computer Science
• Nyckelord: adaptive tessellation; displacement mapping; non-recursive strategy; strips of vertices
• Status: Published
• ISBN/ISSN/Övrigt: ISSN: 1460-2067