Premium
Fast Parallel Construction of Smooth Surfaces from Meshes with Tri/Quad/Pent Facets
Author(s) -
Myles A.,
Ni T.,
Peters J.
Publication year - 2008
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.2008.01276.x
Subject(s) - shader , polygon mesh , rendering (computer graphics) , computer science , computer graphics (images) , vertex (graph theory) , quadrilateral , tensor product , real time rendering , combinatorics , geometry , mathematics , theoretical computer science , finite element method , physics , pure mathematics , graph , thermodynamics
Polyhedral meshes consisting of triangles, quads, and pentagons and polar configurations cover all major sampling and modeling scenarios. We give an algorithm for efficient local, parallel conversion of such meshes to an everywhere smooth surface consisting of low‐degree polynomial pieces. Quadrilateral facets with 4‐valent vertices are ‘regular’ and are mapped to bi‐cubic patches so that adjacent bi‐cubics join C 2 as for cubic tensor‐product splines. The algorithm can be implemented in the vertex and geometry shaders of the GPU pipeline and does not use the fragment shader. Its implementation in DirectX 10 achieves conversion plus rendering at 659 frames per second with 42.5 million triangles per second on input of a model of 1300 facets of which 60% are not regular.