we develope a numerical method based on b-spline collocation method to solve linear klein-gordon equation. the proposed scheme is unconditionally stable. the results of numerical experiments have been compared with the exact solution to show the efficiency of the method computationally. easy and economical implementation is the strength of this approach.

This paper presents a Web based system for capturing outlines of 2D shapes using Matlab Web Server. From a simple user interface in HTML, any Web user can upload his data and view the results. Cubi c Bezier curve design is used to capture the outlines. In that, outline is divided into curve segments at corner points and curve approximation of each segment is performed by estimation of Bezier co...

ACKNOWLEDGEMENTS In the name of Allah, Most Gracious, Most Merciful All praise and glory to Almighty Allah (Subhanahu Wa Taalaa) who gave me courage and patience to carry out this work. Peace and blessing of Allah be upon last Prophet Muhammad (Peace Be Upon Him). Acknowledgment is due to King Fahd University of Petroleum & Minerals for supporting this research. My unrestrained appreciation goe...

This paper proposed an efficient, intelligent and less complex method of face recognition. A hybrid approach of face recognition is proposed here using the neural networks and Bezier curves. Detection of structural facial features such as eyes, eyebrows, nose, lips and mouth boundaries is an essential process for various image processing task such as face recognition. In this paper we introduce...

A new algorithm for Computer Aided Geometric Design of least squares (LS) splines with variable knots, named GeDS, is presented. It is based on interpreting functional spline regression as a parametric B-spline curve, and on using the shape preserving property of its control polygon. The GeDS algorithm includes two major stages. For the first stage, an automatic adaptive, knot location algorith...

Both the four-point and the uniform cubic B-spline refinement (i.e. subdivision) schemes double the number of vertices of a closed-loop polygonal curve P and respectively produce sequences of vertices fk and bk. The Js refinement proposed here produces vertices vk=(1–s)fk+sbk. Iterative applications of Js yield a family of curves parameterized by s. It includes the four-point curve (J0), the un...

In this piece of work, using three spatial grid points, we discuss a new two-level implicit cubic spline method of O(k + kh + h) for the solution of quasi-linear parabolic equation   , , , , xx x t u f x t u u u  , 0< x <1, t > 0 subject to appropriate initial and Dirichlet boundary conditions, where h > 0, k > 0 are grid sizes in space and time-directions, respectively. The cubic spline app...

Quadratic Bézier curves are important geometric entities in many applications. However, it was often ignored by the literature the fact that a single segment of a quadratic Bézier curve may fail to fit arbitrary endpoint unit tangent vectors. The purpose of this paper is to provide a solution to this problem, i.e., constructing G quadratic Bézier curves satisfying given endpoint (positions and ...