In this work, a complete work flow from pore-scale imaging to absolute permeability determination is described and discussed. Two specific points are tackled, concerning (1) the mesh refinement for a fixed image resolution and (2) the impact of the determination method used. A key point for this kind of approach is to work on enough large samples to check the representativity of the obtained ev...

We introduce a new algorithm to convert triangular meshes of polygonal regions, with or without holes, into strictly convex quadrilateral meshes of small bounded size. Our algorithm includes all vertices of the triangular mesh in the quadrilateral mesh, but may add extra vertices (called Steiner points). We show that if the input triangular mesh has t triangles, our algorithm produces a mesh wi...

In this paper, a moving mesh technique and a non-standard finite difference method are combined, and a moving mesh non-standard finite difference (MMNSFD) method is developed to solve an initial boundary value problem involving a quartic nonlinearity that arises in heat transfer with thermal radiation. In this method, the moving spatial grid is obtained by a simple geometric adaptive algorithm ...

Recently, mesh surfaces have become the focus of considerable interest due to its simplicity for data exchange and geometric computation. However, for mesh surface machining, there are few tool path planning strategies but iso-planar method. In this article, a contour-parallel tool path method is presented for machining complicated mesh surfaces with holes or islands by introducing a so-called ...

In Section 3.1 of [1] a methodology is presented to compute the salient points of a 3D mesh based on the computation of its protrusion function, see Equation (1) in [1]. Explicitly each point υ of the Mesh is examined as a potential salient point. Specifically a geodesic neighborhood is constructed for each point of the mesh and it is considered as a salient point if it is the local maximum of ...

Reprojection of texture issued from cameras on a mesh estimated from multi-view reconstruction is often the last stage of the pipeline, used for rendering, visualization, or simulation of new views. Errors or imprecisions in the recovered 3D geometry are particularly noticeable at this stage. Nevertheless, it is sometimes desirable to get a visually correct rendering in spite of the inaccuracy ...

This paper deals with the problems of scene illumination estimation and shape recovery from an image sequence of a smooth textureless object. A novel method that exploits the surface points estimated from the silhouettes for recovering the scene illumination is introduced. Those surface points are acquired by a dual space approach and filtered according to their rank errors. Selected surface po...

Skeleton of 3D mesh is a fundamental shape feature, and is useful for shape description and other many applications in 3D Digital Geometry Processing. This paper presents a novel skeleton extraction algorithm based on feature point and core extraction by the Multidimensional scaling (MDS) transformation. The algorithm first straights the folded prominent branch up, as well as the prominent shap...

Some collocation schemes used to solve mth order ordinary differential equations are known to display superconvergence at the mesh points. Here we show that some such schemes have additional superconvergence points for the approximate solution and all of its derivatives. Using such points, we argue that a mesh selection scheme introduced by Dodson can be expected to perform well under general c...