The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

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

På svenska

Author

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.

Publishing year

2013

Language

English

Pages

843-851

Publication/Series

Computer Journal

Volume

56

Issue

7

Document type

Journal article

Publisher

Oxford University Press

Topic

  • Computer Science

Keywords

  • adaptive tessellation
  • displacement mapping
  • non-recursive strategy
  • strips of vertices

Status

Published

ISBN/ISSN/Other

  • ISSN: 1460-2067