Abstract
This work discusses a ternary 4-point approximation subdivision technique with two properties, namely, convexity and monotonicity preservation. The fundamental contribution of this research article is to extract the conditions that assure the suggested subdivision scheme’s convexity and monotonicity. The methodology for extracting these conditions is explained in two theorems. These theorems prove that if the initial data is strictly convex and monotone and the derived conditions are satisfied, then the limiting curve generated by the proposed subdivision scheme will also be convex and monotone. To show the graphical simulations of results, 2D graphs are plotted. Curvature plots are also drawn to fully comprehend the derived conditions. The entire discourse is backed up by convincing examples.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
