Parallel smoothing of quad meshes
| Autor: | Jörg Peters, Vineet Goel, Young In Yeo, Tianyun Ni, Ashish Myles |
|---|---|
| Rok vydání: | 2009 |
| Předmět: |
Computer science
Graphics processing unit Computer Graphics and Computer-Aided Design Vertex (geometry) Computational science Computer Science::Graphics Computer graphics (images) Piecewise Bicubic interpolation Polygon mesh Subdivision surface Computer Vision and Pattern Recognition Shader Software Smoothing |
| Zdroj: | The Visual Computer. 25:757-769 |
| ISSN: | 1432-2315 0178-2789 |
| DOI: | 10.1007/s00371-009-0365-x |
| Popis: | For use in real-time applications, we present a fast algorithm for converting a quad mesh to a smooth, piecewise polynomial surface on the Graphics Processing Unit (GPU). The surface has well-defined normals everywhere and closely mimics the shape of Catmull–Clark subdivision surfaces. It consists of bicubic splines wherever possible, and a new class of patches—c-patches—where a vertex has a valence different from 4. The algorithm fits well into parallel streams so that meshes with 12,000 input quads, of which 60% have one or more non-4-valent vertices, are converted, evaluated and rendered with 9×9 resolution per quad at 50 frames per second. The GPU computations are ordered so that evaluation avoids pixel dropout. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink