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

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 Novel Numerical Method for Computing Subdivision Depth of Quaternary Schemes