By Topic

GPU Supported Patch-Based Tessellation for Dual Subdivision

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fengtao Fan ; Dept. of Comput. Sci., Univ. of Kentucky, Lexington, KY, USA ; Fuhua Cheng

A novel patch-based tessellation method for a dual subdivision scheme, the Doo-Sabin subdivision, is presented. Patch-based refinement for face-split subdivision schemes such as Catmull-Clark subdivision or Loop subdivision has been widely studied. But there is no patch-based tessellation algorithm for dual subdivision scheme yet. The method presented in this paper is the first attempt to fill up that gap. The new method uses an 1D array to hold vertices; it creates a patch corresponding to a vertex in the original mesh and does not have any numerical roundoff gaps on patch boundaries. These characteristics are different from those of patch-based refinements for face-split subdivision schemes. Experimental results show that our algorithm achieves real time tessellation performance for moderate meshes.

Published in:

Computer Graphics, Imaging and Visualization, 2009. CGIV '09. Sixth International Conference on

Date of Conference:

11-14 Aug. 2009