Natural neighbor coordinates [20] are optimum weighted-average measures for an irregular arrangement of nodes in R. [26] used the notion of Bézier simplices in natural neighbor coordinates Φ to propose a C interpolant. The C interpolant has quadratic precision in Ω ⊂ R, and reduces to a cubic polynomial between adjacent nodes on the boundary ∂Ω. We present the C formulation and propose a comput...

The problem of computing Craig Interpolants for propositional (SAT) formulas has recently received a lot of interest, mainly for its applications in formal verification. However, propositional logic is often not expressive enough for representing many interesting verification problems, which can be more naturally addressed in the framework of Satisfiability Modulo Theories, SMT. Although some w...

In this paper we employed rational Ball interpolant for the reconstruction of different images. The unknown parameters involved are optimized with the help of genetic algorithm. The error tables of three chosen images are displayed.

Algorithms are presented for computing a quadratic spline interpolant with variable knots which preserves the monotonicity and convexity of the data. It is also shown that such a spline may not exist for fixed knots.

An algorithm for the local interpolation of a mesh of cubic curves with 3-and 4-sided facets by a piecewise cubic C ~ surface is stated and illustrated by an implementation. Precise necessary and sufficient conditions for oriented tangent-plane continuity between adjacent patches are derived, and the explicit constructions are characterized by the degree of the three scalar weight functions tha...

Quasi-interpolation is a well-known technique to construct accurate approximants to a given set of data or a given function by means of a local approach. A quasi-interpolant is usually obtained as a linear combination of a given system of blending functions that form a convex partition of unity and possess a small local support. These properties ensure both numerical stability and local control...

This work proposes a simple and fast approach for re-meshing the surfaces of smooth-featured geometries prior to CFD analysis. The aim is to improve mesh quality and thus the convergence and accuracy of the CFD analysis. The method is based on constructing an interpolant based on the geometry shape and then mapping a regular rectangular grid to the shape of the original geometry using that inte...

We consider the construction of a polyhedral Delaunay partition as limit sequence power diagrams (radical partitions). The dual Voronoi diagram is obtained weighted partitions. problem reduced to two convex polyhedra, inscribed and superscribed around circular paraboloid, pairs general polyhedra. primal polyhedra should converge polyhedron converges polyhedron. are interested in case when verti...