Generic Mesh Refinement On GPU - Archive ouverte HAL Access content directly
Conference Papers Year : 2005

Generic Mesh Refinement On GPU

(1, 2) , (1, 2)
1
2

Abstract

Many recent publications have shown that a large variety of computation involved in computer graphics can be moved from the CPU to the GPU, by a clever use of vertex or fragment shaders. Nonetheless there is still one kind of algorithms that is hard to translate from CPU to GPU: mesh refinement techniques. The main reason for this, is that vertex shaders available on current graphics hardware do not allow the generation of additional vertices on a mesh stored in graphics hardware. In this paper, we propose a general solution to generate mesh refinement on GPU. The main idea is to define a generic refinement pattern that will be used to virtually create additional inner vertices for a given polygon. These vertices are then translated according to some procedural displacement map defining the underlying geometry (similarly, the normal vectors may be transformed according to some procedural normal map). For illustration purpose, we use a tesselated triangular pattern, but many other refinement patterns may be employed. To show its flexibility, the technique has been applied on a large variety of refinement techniques: procedural displacement mapping, as well as more complex techniques such as curved PN-triangles or ST-meshes.
Fichier principal
Vignette du fichier
GenericMeshRefinementOnGPU.pdf (1.97 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00260838 , version 1 (05-03-2008)

Identifiers

  • HAL Id : inria-00260838 , version 1

Cite

Tamy Boubekeur, Christophe Schlick. Generic Mesh Refinement On GPU. ACM SIGGRAPH/Eurographics Symposium on Graphics Hardware, Jul 2005, Los Angeles, United States. ⟨inria-00260838⟩
214 View
783 Download

Share

Gmail Facebook Twitter LinkedIn More