We study the p median problem which is one the classical problems in location theory For p and on a two dimensional mesh we give an O mn p time algorithm for solving the problem where assuming that m n m is the number of rows of the mesh containing demand points n the number of columns containing demand points and p the number of demand points

We study the p-median problem which is one the classical problems in location theory. For p = 2 and on a two-dimensional mesh, we give an O(mn 2 p)-time algorithm for solving the problem, where, assuming that m n, m is the number of rows of the mesh containing demand points, n the number of columns containing demand points, and p the number of demand points.

The Lagrange-mesh method is an approximate variational method taking the form of equations on a grid because of the use of a Gauss quadrature approximation. With a basis of Lagrange functions involving associated Laguerre polynomials related to the Gauss quadrature, the method is applied to the Dirac equation. The potential may possess a 1/r singularity. For hydrogenic atoms, numerically exact ...

This paper surveys Delaunay-based meshing techniques for curved objects, and their application in medical imaging and in computer vision to the extraction of geometric models from segmented images. We show that the so-called Delaunay refinement technique allows to mesh surfaces and volumes bounded by surfaces, with theoretical guarantees on the quality of the approximation, from a geometrical a...

We investigate different techniques for fitting Bézier curves to surfaces in context of high-order curvilinear mesh generation. Starting from distance-based least-squares fitting we develop an incremental algorithm, which incorporates approximations of stretch and bending energy. In the process, the algorithm reduces the energy weight in favor of accuracy, leading to an optimized set of samplin...

The lowest order Raviart-Thomas rectangular element is considered for solving the singular perturbation problem ?div(arp) + bp = f; where the diagonal tensor a = (" 2 ; 1) or a = (" 2 ; " 2): Global uniform convergence rates of O(N ?1) for both p and a 1=2 rp in the L 2-norm are obtained in both cases, where N is the number of intervals in both directions. The pointwise interior (away from the ...

In the present paper, the existence and uniqueness of deficient discrete cubic spline interpolant by matching the given function and first order difference at the intermediate points between successive mesh points for a uniform mesh has been discussed and also a error estimate concerning this deficient discrete cubic spline interpolant is obtained

A Digital Surface Model (DSM) generated by automatic stereo matching of convergent image networks includes a great number of 3D-points that come from diverse combinations of stereo-pairs. This points can have a very different accuracy and reliability, in addition to a great and nondesirable spatial redundancy. We analized different methods to generate several synthesis DSM whose points are the ...

Tour into the picture (TIP) proposed by Horry et al.13 is a method for generating a sequence of walk-through images from a single reference picture (or image). By navigating a 3D scene model constructed from the picture, TIP produces convincing 3D effects. Assuming that the picture has one vanishing point, they proposed the scene modeling scheme called spidery mesh. However, this scheme has to ...