Transfinite mean value interpolation has recently emerged as a simple and robust way to interpolate a function f defined on the boundary of a planar domain. In this paper we study basic properties of the interpolant, including sufficient conditions on the boundary of the domain to guarantee interpolation when f is continuous. Then, by deriving the normal derivative of the interpolant and of a m...

Bézier surfaces are an important design tool in Computer Aided Design. They are parameterized surfaces where the parameterization can be represented as a homogeneous polynomial in barycentric coordinates. Usually, Wachspress coordinates are used to obtain tensor product Bézier surfaces over rectangular domains. Recently, Floater introduced mean value coordinates as an alternative to Wachspress ...

Geometry editing operations commonly use mesh encodings which capture the shape properties of the models. Given modified positions for a set of anchor vertices, the encoding is used to compute the positions for the rest of the mesh vertices, preserving the model shape as much as possible. In this paper, we introduce a new shape preserving and rotation invariant mesh encoding. We use this encodi...

Mean value analysis is an elegant tool for determining mean performance measures in queueing models. We use the technique to analyze the M/G/1 retrial queue with exponential retrial times. We also show how the relations can be adapted to obtain mean performance measures in more advanced M/G/1-type retrial queues.

In this paper a class of closed queueing network is modelled in the Markovian process algebra PEPA and solved using the classical Mean Value Analysis (MVA). This approach is attractive as it negates the need to derive the entire state space, and so certain metrics from large models can be obtained with little computational effort. The approach is illustrated with two numerical examples. About t...

The mean value analysis algorithm is used to model a database application that runs over a grid of computers. A bound on the maximum throughput is modeled by assuming a uniform distribution of requests across the grid. Then, a non-uniform distribution of requests was modeled. Also, the number of clients was varied. Then, the model was modified to reflect a proposed change in the application. Fi...

An approximation of mean value analysis is presented for queueing networks containing multiple server stations. The approximation is based on the estimation of the conditional marginal probabilities used by the mean residence time formula in mean value analysis. A comparison against classical mean value analysis allows us to determine the accuracy of our algorithm. In all investigated network m...