the rational cubic function with three parameters has been extended to rational bi-cubic function to visualize the shape of regular convex surface data. the rational bi-cubic function involves six parameters in each rectangular patch. data dependent constraints are derived on four of these parameters to visualize the shape of convex surface data while other two are free to refine the shape of s...

The rational cubic function with three parameters has been extended to rational bi-cubic function to visualize the shape of regular convex surface data. The rational bi-cubic function involves six parameters in each rectangular patch. Data dependent constraints are derived on four of these parameters to visualize the shape of convex surface data while other two are free to refine the shape of s...

A smooth surface interpolation scheme for positive and convex data has been developed. This scheme has been extended from the rational quadratic spline function of Sarfraz [11] to a rational bi-quadratic spline function. Simple data dependent constraints are derived on the free parameters in the description of rational bi-quadratic spline function to preserve the shape of 3D positive and convex...

The bi-Hamiltonian structure of certain multi-component integrable systems, generalizations of the dispersionless Toda hierarchy, is studied for systems derived from a rational Lax function. One consequence of having a rational rather than a polynomial Lax functions is that the corresponding bi-Hamiltonian structures are degenerate, i.e. the metric which defines the Hamiltonian structure has va...

In this paper, we present the LMI conditions to characterize the strictly bounded realness of the state-space realization of the solution to the bi-tangential rational interpolation problem, i.e., they give the solution to the bitangential Nevanlinna-Pick interpolation problem [13], [3]. The bi-tangential Nevanlinna-Pick interpolation problem is the generalization of the classical interpolation...

The unit sphere, centered at the origin in R, has a dense set of points with rational coordinates. We give an elementary proof of this fact that includes explicit bounds on the complexity of the coordinates: for every point v on the unit sphere in R, and every > 0, there is a point r = (r1, r2, . . . , rn) such that: • ||r− v||∞ < . • r is also a point on the unit sphere; P r i = 1. • r has rat...

Let A∗ be a free monoid generated by a set A and let X ⊆ A∗ be a code with property P. The embedding of X into a complete code Y ⊆ A∗ with the same property P is called the completion of X . The method of completion of rational bi!x codes and codes with !nite decoding delays have been investigated by a number of authors. In this paper, we provide a general method of construction for completing ...