Abstract

In this paper, an algorithm is defined to construct 3n-point quaternary approximating subdivision schemes which are useful to design different geometric objects in the field of geometric modeling. We are going to establish a family of approximating schemes because approximating scheme provide maximum smoothness as compare to the interpolating schemes. It is to be observed that the proposed schemes satisfying the basic sum rules with bell-shaped mask go up to the convergent subdivision schemes which preserve monotonicity. We analyze the shape-preserving properties such that convexity and concavity of proposed schemes. We also show that quaternary schemes associated to the certain refinable functions with dilation 4 have higher order shape preserving properties. We also calculated the polynomial reproduction of proposed quaternary approximating subdivision schemes. The proposed schemes have tension parameter, so by choosing different values of the tension parameter we can get different limit curves of initial control polygon. We show in the table form that the proposed schemes are better than the existing schemes by comparing them on the behalf of their support and continuity. The visual quality of proposed schemes is demonstrated by different snapshots.

Highlights

  • In computer graphics, subdivision technique constitutes a large class of recursive schemes for computing curves

  • A lot of work has been done on binary subdivision schemes, but the research communities are taking interest to introduce higher arity schemes which give less computational cost and better result

  • A similar approach to the cubic spline interpolation is convexity-preserving approximation method which is presented by Han [11]

Read more

Summary

INTRODUCTION

Subdivision technique constitutes a large class of recursive schemes for computing curves. There are numerous examples of binary and ternary monotonicity and convexity preserving subdivision schemes [4,5,6,7,8,9,10]. A similar approach to the cubic spline interpolation is convexity-preserving approximation method which is presented by Han [11]. Mustafa and Khan [14] proposed a 4-point quaternary approximating subdivision scheme with one shape parameter and analyzed its properties. Quaternary approximating schemes have higher smoothness and smaller support, comparing to binary and ternary schemes.

PRELIMINARIES
HIGHER ORDER SHAPE PRESERVING SUBDIVISION SCHEMES
CONVEXITY PRESERVATION
Concavity Preservation
NUMERICAL EXAMPLES AND COMPARISON
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call