English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The <inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula>-ary subdivision scheme has traditionally been designed to generate smooth curve and surface from control polygon. In this paper, we propose a new subdivision depth computation technique for <inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula>-ary subdivision scheme. The existing techniques do not ensure the computation of subdivision depth unless some strong condition is assumed on the mask of the scheme. But our technique relaxes the effect of strong condition assumed on the mask of the scheme by increasing the number of convolution steps. Consequently, a more precise subdivision depth technique for a given error tolerance is presented in this paper.

A New Computational Approach to Estimate the Subdivision Depth of n-Ary Subdivision Scheme