In this paper, we propose a new scheme for sending three-dimensional (3-D) mesh models. In order to make a viewdependent representation of 3-D mesh models, we combine sequential and progressive mesh transmission techniques. After we partition a 3-D mesh model into a hierarchical tree, we determine the amount of information for each submesh. Then, we can send the 3-D model information by view-de...

Some boundary value problems yield anisotropic solutions, e.g. solutions with boundary layers. If such problems are to be solved with the nite element method (FEM), anisotropically reened meshes can be advantageous. In order to construct these meshes or to control the error one aims at reliable error estimators. For isotropic meshes many estimators are known, but they either fail when used on a...

We present a new monotone finite volume method for the advection–diffusion equation with a full anisotropic discontinuous diffusion tensor and a discontinuous advection field on 3D conformal polyhedral meshes. The proposed method is based on a nonlinear flux approximation both for diffusive and advective fluxes and guarantees solution non-negativity. The approximation of the diffusive flux uses...

Universal meshes have recently appeared in the literature as a computationally efficient and robust paradigm for the generation of conforming simplicial meshes for domains with evolving boundaries. The main idea behind a universal mesh is to immerse the moving boundary in a background mesh (the universal mesh), and to produce a mesh that conforms to the moving boundary at any given time by adju...

Abstract. This paper describes a quadrilateral mesh generation algorithm ideally suited for transition subdomain meshes in the context of any domain decomposition meshing strategy. The algorithm is based on an automatic hierarchical region decomposition in which, in the last level, it is possible to generate quadrilateral elements with a conventional mapping strategy. In two dimensions, a subdo...

This paper describes a quadrilateral mesh generation algorithm ideally suited for transition subdomain meshes in the context of any domain decomposition meshing strategy. The algorithm is based on an automatic hierarchical region decomposition in which, in the last level, it is possible to generate quadrilateral elements with a conventional mapping strategy. In two dimensions, a subdomain is us...

In this paper, we propose a method to compute, in parallel, the homology groups of closed meshes (i.e., orientable 2D manifolds without boundary) represented by combinatorial maps. Our experiments illustrate the interest of our approach which is really fast on big meshes and which obtains good speed-up when increasing the number of threads.

We consider the variational formulation of the electric field integral equation (EFIE) on bounded polyhedral open or closed surfaces. We employ a conforming Galerkin discretization based on divΓ-conforming Raviart-Thomas boundary elements (BEM) of locally variable polynomial degree on shape-regular surface meshes. We establish asymptotic quasi-optimality of Galerkin solutions on sufficiently fi...

We considered finite difference methods of higher order for semilinear singularly perturbed boundary value problems, consisted of constructing difference schemes on nonuniform meshes. Construction of schemes is presented and convergence uniform in perturbation parameter for one method is shown on Bakhvalov’s type of mesh. Numerical experiments demonstrated influence of different meshes on devel...

In this paper, we rewrite the Minimal-Connected-Component (MCC) model in 2-D meshes in a fully-distributed manner without using global information so that not only can the existence of a Manhattan-distance-path be ensured at the source, but also such a path can be formed by routing-decisions made at intermediate nodes along the path. We propose the MCC model in 3-D meshes, and extend the corres...