In this paper the Quality of Service Issues in Wireless Mesh Networks has been described. Several access points may be put into wireless Ad Hoc networks for people connecting to WWW or other Internet services. This kind of wireless network is called wireless mesh networks (WMNs).. Quality of service is largely lacking. For improving the performance of QoS in face of unreliable wireless medium, ...

tion, which is often called a reaction–convection–diffusion equation, is representative of many problems which are It is well known that moving mesh and upwinding schemes are two kinds of techniques for tracking the shock or steep wave front solved by moving mesh methods in one dimension. in the solution of PDEs. It is expected that their combination should Much work has been devoted to the con...

This paper describes a sketch-based method for augmenting geometric meshes with variable-scale sharp features. Such mesh editing operations provide a powerful way to exploit artist’s natural sketching abilities for content creation using existing mesh libraries. We use adaptive subdivision to refine the mesh only in the region of the features and embed the augmentations into the input mesh, mai...

This study focuses on the summary data structure design and optimize the method of calculation of the mesh density and how to effectively deal with the problem of boundary points, combined with the sliding window mechanism and suggest improvements based on the mesh density of the data stream real-time clustering algorithm framework and the various parts of concrete realization of the algorithm.

Mesh-free approximation is used in numerical simulations of strain localization under large deformation. An explicit displacement based mesh-free formulation is used in both two-dimensional and three-dimensional computations. The spatial isotropy of mesh-free interpolant is demonstrated through the numerical example to show that mesh-free methods possess certain ``mesh objectivity'' that allevi...

In this paper we introduce an algorithm for computing the Voronoi Diagram using the L1 metric for n planar points on the reconfigurable mesh model of computation. The algorithm contains a new technique of embedding aplanar graph on the mesh using the reconfigurable nature of the architecture.

We present in this talk several applications of Information Theory to Computer Graphics, based on the use of the measures of entropy and mutual information, f-divergences and generalized entropies. Application areas presented are hierarchical radiosity, adaptive pixel supersampling, selection of best view-points, object and scene exploration, mesh saliency, mesh simplification and object recogn...

A flexible finite difference method is described that gives approximate solutions of linear elliptic partial differential equations, Lu = G, subject to general linear boundary conditions. The method gives high-order accuracy. The values of the unknown approximation function U are determined at mesh points by solving a system of finite difference equations L(h)U = I(h)G. L(h)U is a linear combin...

This thesis presents a vertex repositioning based boundary smoothing technique so that the finite element mesh, as refined, converges to the geometric shape of the domain. Adaptive mesh refinements based on a posteriori error estimates is already available within FEniCS, a free software for automated solution of differential equations. However, as the refinement process runs independently of th...

We present a simple method for meshing a 3D point cloud to a manifold genus-0 mesh. Our approach is based on recent methods for spherical embedding of planar graphs, where we use instead a k-nearest neighborhood graph of the point cloud. Our approach proceeds in two steps: We first embed the neighborhood graph on a sphere using an iterative procedure, minimizing the tangential Laplacian. Then w...