A Novel Numerical Method for Computing Subdivision Depth of Quaternary Schemes

In this paper, an advanced computational technique has been presented to compute the error bounds and subdivision depth of quaternary subdivision schemes. First, the estimation is computed of the error bound between quaternary subdivision limit curves/surfaces and their polygons after kth-level subdivision by using l0 order of convolution. Secondly, by using the error bounds, the subdivision depth of the quaternary schemes has been computed. Moreover, this technique needs fewer iterations (subdivision depth) to get the optimal error bounds of quaternary subdivision schemes as compared to the existing techniques.

A Computational Method for Subdivision Depth of Ternary Schemes

Subdivision schemes are extensively used in scientific and practical applications to produce continuous shapes in an iterative way. This paper introduces a framework to compute subdivision depths of ternary schemes. We first use subdivision algorithm in terms of convolution to compute the error bounds between two successive polygons produced by refinement procedure of subdivision schemes. Then, a formula for computing bound between the polygon at k-th stage and the limiting polygon is derived. After that, we predict numerically the number of subdivision steps (depths) required for smooth limiting shape based on the demand of user specified error (distance) tolerance. In addition, extensive numerical experiments were carried out to check the numerical outcomes of this new framework. The proposed methods are more efficient than the method proposed by Song et al.

A Novel Numerical Algorithm to Estimate the Subdivision Depth of Binary Subdivision Schemes

Subdivision schemes are extensively used in scientific and practical applications to produce continuous geometrical shapes in an iterative manner. We construct a numerical algorithm to estimate subdivision depth between the limit curves/surfaces and their control polygons after k-fold subdivisions. In this paper, the proposed numerical algorithm for subdivision depths of binary subdivision curves and surfaces are obtained after some modification of the results given by Mustafa et al in 2006. This algorithm is very useful for implementation of the parametrization.

Subdivision Depth Computation for Tensor Productn-Ary Volumetric Models

We offer computational formula of subdivision depth for tensor productn-ary (n⩾2) volumetric models based on error bound evaluation technique. This formula provides and error control tool in subdivision schemes over regular hexahedron lattice in higher-dimensional spaces. Moreover, the error bounds of Mustafa et al. (2006) are special cases of our bounds.