| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 441109 | Computer Aided Geometric Design | 2016 | 5 Pages |
Abstract
We propose to implement the m-ary 2N-point Dubuc–Deslauriers subdivision scheme (DDSS) using a series of repeated local operations, which are based on a recursive formula between the newly inserted points of m-ary 2N-point DDSS and those of m -ary (2N−2)(2N−2)-point and m -ary (2N−4)(2N−4)-point DDSSs. Numerical analysis reveals the robustness of our method.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Graphics and Computer-Aided Design
Authors
Chongyang Deng, Yajuan Li, Huixia Xu,