General Subdivision Inferred from Catmull-Clark Subdivision Algorithm

Abstract:

Article Preview

Subdivision algorithms have emerged recently as a powerful and useful technique in modeling free-form surfaces. Subdivision algorithms exited at present however, being their disadvantages, can’t meet the demand of wide application in modeling surfaces and don’t still belong to a general theory. In this paper, a general subdivision algorithm is presented which is a general conclusion inferred from classical Catmull-Clark subdivision algorithm and can produce existing subdivision algorithm by selecting reasonable vertical weights and horizontal weights. The subdivision algorithm is an ideal resolution for keeping shape feature such as crease, corner and dart contrast to all existing subdivision algorithms, it also have the advantage of flexible weights selection, easily control of shape and high compute speed. Therefore, the algorithms are extensively applicable for shape modeling in computer aided geometric design, industrial prototype design and reverse engineering.

Info:

Periodical:

Materials Science Forum (Volumes 532-533)

Edited by:

Chengyu Jiang, Geng Liu, Dinghua Zhang and Xipeng Xu

Pages:

789-792

DOI:

10.4028/www.scientific.net/MSF.532-533.789

Citation:

Y. Wang et al., "General Subdivision Inferred from Catmull-Clark Subdivision Algorithm", Materials Science Forum, Vols. 532-533, pp. 789-792, 2006

Online since:

December 2006

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.