Mesh Generation for Finite Element Analysis of Electric Machines

This paper describes two modified methods for triangular and quadrilateral meshing for finite element analysis of 2D electric machines. One is coupling the classic Delaunay method and advancing front method to generate optimal triangulation; the other is coupling the classic paving and Delaunay triangulation for optimal quadrilateral meshing. Various electric machine models are meshed successfully to demonstrate the robustness and effectiveness of the methods.

Edge span of L(d,1)-labeling on some graphs

Given a graph G and a positive integer d, an L( d, 1) -labeling of G is afunction / that assigns to each vertex of G a non-negative integer such that |f(u)-f (v) | >=d ifd_c(u, v) =1;|f(u)-f(v) | >=1 if d_c(u, v) =2. The L(d, 1)-labeling number of G, lambda_d(G) is theminimum range span of labels over all such labelings, which is motivated by the channel assignmentproblem. We consider the question of finding the minimum edge span beta_d( G) of this labeling.Several classes of graphs such as cycles, trees, complete k-partite graphs, chordal graphs includingtriangular lattice and square lattice which are important to a telecommunication problem arestudied, and exact values are given.

Curvatures estimation on triangular mesh

Curvatures are important geometric attributes of surfaces. There are many applications that require as a first step the accurate estimation of curvatures at arbitrary vertices on a triangulated surface. Chen and Schmitt (1992) and Taubin (1995) presented two simple methods to estimate principal curvatures. They used circular arcs to approximate the normal curvature. We find this may cause large error in some cases. In this paper, we describe a more accurate method to estimate the normal curvature, and present a novel algorithm to estimate principal curvatures by simplifying the Chen and Schmitt’s method. Some comparison results are also shown in this paper.

Three-Dimensional TIN Algorithm for Digital Terrain Modeling

The problem of taking an unorganized point cloud in 3D space and fitting a polyhedral surface to those points is both important and difficult. Aiming at increasing applications of full three dimensional digital terrain surface modeling, a new algorithm for the automatic generation of three dimensional triangulated irregular network from a point cloud is pro- posed. Based on the local topological consistency test, a combined algorithm of constrained 3D Delaunay triangulation and region-growing is extended to ensure topologically correct reconstruction. This paper also introduced an efficient neighbor- ing triangle location method by making full use of the surface normal information. Experimental results prove that this algo- rithm can efficiently obtain the most reasonable reconstructed mesh surface with arbitrary topology, wherein the automati- cally reconstructed surface has only small topological difference from the true surface. This algorithm has potential applica- tions to virtual environments, computer vision, and so on.

2D Centroidal Voronoi Tessellations with Constraints

We tackle the problem of constructing 2D centroidal Voronoi tessellations with constraints through an efficient and robust construction of bounded Voronoi diagrams, the pseudo-dual of the constrained Delaunay triangulation.We exploit the fact that the cells of the bounded Voronoi diagram can be obtained by clipping the ordinary ones against the constrained Delaunay edges.The clipping itself is efficiently computed by identifying for each constrained edge the(connected) set of triangles whose dual Voronoi vertices are hidden by the constraint.The resulting construction is amenable to Lloyd relaxation so as to obtain a centroidal tessellation with constraints.

Curvature detail representation of triangular surfaces

Curvature tells much about details of surfaces and is studied widely by researchers in the computer graphics com- munity. In this paper, we first explain the mean-curvature view of Dirichlet energy of triangular surfaces and introduce a curvature representation of details, and then present surfaces editing applications based on their curvature representation. We apply our method to surfaces with complex boundaries and rich details. Results show the validity and robustness of our method and dem- onstrate curvature map can be a helpful surfaces detail representation.

提高瑞得数字化图精度的方法

本文针对水电测绘工作，分析几种提高瑞得数字化图精度的方法.

Adaptive triangular mesh coarsening with centroidal Voronoi tessellations

We present a novel algorithm for adaptive triangular mesh coarsening. The algorithm has two stages. First, the input triangular mesh is refined by iteratively applying the adaptive subdivision operator that performs a so-called red-green split. Second, the refined mesh is simplified by a clustering algorithm based on centroidal Voronoi tessellations (CVTs). The accuracy and good quality of the output triangular mesh are achieved by combining adaptive subdivision and the CVTs technique. Test results showed the mesh coarsening scheme to be robust and effective. Examples are shown that validate the method.

Direct numerical simulation of turbulent flow over backward-facing at high Reynolds numbers

Direct numerical simulation(DNS) was performed for the first time to study the flow over a backward-facing step at a high Reynolds number on a coarse grid.The flow over backward-facing step is the typical turbulent flow controlled by large eddy,in which the effect of small eddy could be negligible as an approximation.The grid dimension could easily satisfy the resolution requirement to describe the characteristics of a large eddy flow.Therefore,direct numerical simulation of N-S equations to obtain the turbulent flow field on the coarse grid could be realized.Numerical simulation of a two-dimensional flow over a backward-facing step at a Reynolds number Re=44000 was conducted using Euler-Lagrange finite element scheme based on the efficient operator-splitting method(OSFEM).The flow field was descretized by triangle meshes with 16669 nodes.The overall computational time only took 150 min on a PC.Both the characteristics of time-averaged and instantaneous turbulent flow were simultaneously obtained.The analysis showed that the calculated results were in good agreement with the test data.Hence,the DNS approach could become the reality to solve the complex turbulent flow with high Reynolds numbers in practical engineering.

ARAP++:an extension of the local/global approach to mesh parameterization

Mesh parameterization is one of the fundamental operations in computer graphics(CG) and computeraided design(CAD). In this paper, we propose a novel local/global parameterization approach, ARAP++, for singleand multi-boundary triangular meshes. It is an extension of the as-rigid-as-possible(ARAP) approach, which stitches together 1-ring patches instead of individual triangles. To optimize the spring energy, we introduce a linear iterative scheme which employs convex combination weights and a fitting Jacobian matrix corresponding to a prescribed family of transformations. Our algorithm is simple, efficient, and robust. The geometric properties(angle and area)of the original model can also be preserved by appropriately prescribing the singular values of the fitting matrix. To reduce the area and stretch distortions for high-curvature models, a stretch operator is introduced. Numerical results demonstrate that ARAP++ outperforms several state-of-the-art methods in terms of controlling the distortions of angle, area, and stretch. Furthermore, it achieves a better visualization performance for several applications, such as texture mapping and surface remeshing.

A spherical parameterization approach based on symmetry analysis of triangular meshes

We present an efficient spherical parameterization approach aimed at simultaneously reducing area and angle dis-tortions. We generate the final spherical mapping by independently establishing two hemisphere parameterizations. The essence of the approach is to reduce spherical parameterization to a planar problem using symmetry analysis of 3D meshes. Experiments and comparisons were undertaken with various non-trivial 3D models, which revealed that our approach is efficient and robust. In particular, our method produces almost isometric parameterizations for the objects close to the sphere.

FINITE VOLUME ELEMENT METHOD WITH LAGRANGIAN CUBIC FUNCTIONS

This paper establishes a new finite volume element scheme for Poisson equation on trian- gular meshes. The trial function space is taken as Lagrangian cubic finite element space on triangular partition, and the test function space is defined as piecewise constant space on dual partition. Under some weak condition about the triangular meshes, the authors prove that the stiffness matrix is uni- formly positive definite and convergence rate to be O（h3） in Hi-norm. Some numerical experiments confirm the theoretical considerations.

A fast mapping method to evaluate immersed boundary hydrodynamic forces

Immersed boundary method is a crucial method to deal with particle suspension flow.Particle shapes involved in such flow are usually simple geometry,such as sphere and ellipsoid,which can be conveniently represented by the triangular surface grid.When the number of particles and resolution of the surface grid increase,calculating the hydrodynamic force on the particle surface through integration can be time-consuming.Hence,the present paper establishes a fast mapping method to evaluate immersed boundary hydrodynamic force.Firstly,the particle surface grid is generated by an initial triangular element grid.Subsequently,the initial surface grid is refined by bisection refinement to the desired resolution.The final step is to find the triangular element index on the particle triangular surface grid,which contains the projective point.Test cases show that the present mapping algorithm has good accuracy and efficiency for calculating hydrodynamic forces of particles.