Multi-step subdivision algorithm for chaikin curves

Authors:
Ling Wu;Jun-Hai Yong;You-Wei Zhang;Li Zhang
Affiliations:
School of Software, Tsinghua University, Beijing, P. R. China;School of Software, Tsinghua University, Beijing, P. R. China;School of Software, Tsinghua University, Beijing, P. R. China;School of Software, Tsinghua University, Beijing, P. R. China
Venue:
CIS'04 Proceedings of the First international conference on Computational and Information Science
Year:
2004

Citing 4
Cited 0

Interactive multiresolution mesh editing

Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Exact evaluation of Catmull-Clark subdivision surfaces at arbitrary parameter values

Proceedings of the 25th annual conference on Computer graphics and interactive techniques
√3-subdivision

Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Trimming for subdivision surfaces

Computer Aided Geometric Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

A Chaikin curve is a subdivision curve. Subdivision begins from an initial control polygonal curve. For each subdivision step, all corners of the polygonal curve are cut off, and a new polygonal curve is thus produced as the input of the next subdivision step. In the limit of subdivision, a Chaikin curve is created. In this paper, a multi-step subdivision algorithm for generating Chaikin curves is proposed. For an arbitrary positive integer k, the algorithm builds the resultant polygonal curve of the kth subdivision step directly from the initial polygonal curve. Examples show that the new algorithm speeds up curve generation in several times.