Title: Dynamic Mesh Refinement on GPU using Geometry Shaders
Authors: Lorenz, Haik
Döllner, Jürgen
Citation: WSCG '2008: Full Papers: The 16-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision in co-operation with EUROGRAPHICS, University of West Bohemia Plzen, Czech Republic, February 4 - 7, 2008, p. 97-104.
Issue Date: 2008
Publisher: Václav Skala - UNION Agency
Document type: konferenční příspěvek
conferenceObject
URI: http://wscg.zcu.cz/wscg2008/Papers_2008/full/!_WSCG2008_Full_final.zip
http://hdl.handle.net/11025/10924
ISBN: 978-80-86943-15-2
Keywords: geometrická stínidla;grafické procesory;real-time vykreslování;barycentrické souřadnice
Keywords in different language: geometry shaders;graphic processing units;real-time rendering;barycentric coordinates
Abstract: This paper presents a real-time rendering technique for dynamic, incremental 3D mesh refinement. The technique can be applied to any triangulated 3D mesh with arbitrary topology and connectivity. The functionality relies on geometry shaders that are used to amplify or remove geometry based on precalculated refinement patterns. For each triangle, the instantiated refinement pattern is selected dynamically. Due to limitations of current hardware, on-the-fly pattern instantiation cannot be implemented on the GPU. Instead, the complete refined mesh must be generated through pattern copying. We propose an incremental approach where the refined mesh is generated by using the previous refined mesh as primitive source. This algorithm runs exclusively on the GPU and requires no continuous data exchange between CPU and GPU. Due to the necessary mesh generation, the approach is particularly suitable for applications with small refinement levels. It complements traditional pattern-based refinement approaches that deliver high throughput for large refinement levels, but incur a substantial CPU-GPU communication overhead otherwise. Interesting applications include view-dependent mesh smoothing and interactive non-planar projections. In these areas, our algorithm enables efficient vertex-based implementations due to adaptive refinement.
Rights: © Václav Skala - UNION Agency
Appears in Collections:WSCG '2008: Full Papers

Files in This Item:
File Description SizeFormat 
Lorenz.pdfPlný text1,77 MBAdobe PDFView/Open
C97-1.aviVideo14,56 MBAVIView/Open
C97-2.pdfPrezentace965,32 kBAdobe PDFView/Open


Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/10924

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.