An angle-based approach to two-dimensional mesh smoothing
Kenji Shimada2000, Proceedings of the 9th International Meshing …
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
We present an effective and easy-to-implement angle-based smoothing scheme for triangular, quadrilateral and tri-quad mixed meshes. For each mesh node our algorithm compares all the pairs of adjacent angles incident to the node and adjusts these angles so that they become equal in the case of a triangular mesh and a quadrilateral mesh, or they form the ideal ratio in the case of a tri-quad mixed mesh. The size and shape quality of the mesh after this smoothing algorithm is much better than that after Laplacian smoothing. The proposed method is superior to Laplacian smoothing by reducing the risk of generating inverted elements and increasing the uniformity of element sizes. The computational cost of our smoothing method is yet much lower than optimization-based smoothing. To prove the effectiveness of this algorithm, we compared errors in approximating a given analytical surface by a set of bi-linear patches corresponding to a mesh with Laplacian smoothing and a mesh with the proposed smoothing method. The experiments show that a mesh smoothed with our method has roughly 20% less approximation error.
Related papers
An Approach to Combined Laplacian and Optimization-Based Smoothing for Triangular, Quadrilateral, and Quad-Dominant Meshes
. Automatic finite element mesh generation techniques have become commonly used tools for the analysis of complex, real-world models. All of these methods can, however, create distorted and even unusable elements. Fortunately, several techniques exist which can take an existing mesh and improve its quality. Smoothing (also referred to as mesh relaxation) is one such method, which repositions nodal locations, so as to minimize element distortion. In this paper, an overall mesh smoothing scheme is presented for meshes consisting of triangular, quadrilateral, or mixed triangular and quadrilateral elements. This paper describes an efficient and robust combination of constrained Laplacian smoothing together with an optimization-based smoothing algorithm. The smoothing algorithms have been implemented in ANSYS and performance times are presented along with several example models. Keywords. Smoothing, Laplacian smoothing, optimization-based smoothing, triangular, quadrilateral, quaddominan...
Parallel Feature-Preserving Mesh Smoothing
Lecture Notes in Computer Science, 2005
We present a parallel approach for optimizing surface meshes by redistributing vertices on a feature-aware higher-order reconstruction of a triangulated surface. Our method is based on a novel extension of the fundamental quadric, called the medial quadric. This quadric helps solve some basic geometric problems, including detection of ridges and corners, computation of one-sided normals along ridges, and construction of higher-order approximations of triangulated surfaces. Our new techniques are easy to parallelize and hence are particularly beneficial for large-scale applications.
An Approach to Improving Triangular Surface Mesh
JSME International Journal Series C, 2005
Our method is based on an implementation of quasi-statistical modeling for improving meshes by producing mesh elements with modeled values of different mesh quality parameters. In this paper we implement this approach to triangular surface mesh. Considering the initial distribution of the mesh quality parameter values, we assume that after improvement the distribution of elements of the mesh varies from a rather random distribution to a smoother one, such as a normal distribution. The preliminary choice of the desirable distribution affects the new parameter values modeled by the formula presented here. Uncertainty of the smoothed vertex positions of the mesh element affords to use a statistical approach in sense of random variable modeling to connect quasi-statistical modeling and mesh improvement techniques. The so-called "kernel" method allows creating different applicable to a mesh processing algorithms, which can be interpreted as a kind of smoothing technique to determine vertex direction movement with the distribution control of the shape of mesh elements. An aspect ratio is mainly used in present research as a mesh quality parameter. The geometry of the initial mesh surface is preserved by local mesh improving such that the new positions of the interior nodes of the mesh remain on the original discrete surface. Our method can be interpreted as a kind of smoothing technique with using the distribution control of the mesh quality parameter values. This method is comparable with optimization-based approach for avoiding the invalid elements of the mesh by producing a mesh with a rather homogeneous distribution of the mesh elements. Experimental results are included to demonstrate the functionality of our method. This method can be used at a pre-process stage for subsequent studies (finite element analysis, computer graphics, etc.) by providing the better-input parameters for these processes.
Comparison of Two Mesh Smoothing Techniques for Unstructured Grids
2014
In this paper two mesh smoothing techniques are applied to unstructured grids. These are based on the solution of elliptic equations, Laplace and Winslow. In the first case, the equations are solved by a barycentric averaging procedure, and a finite volume scheme is used for the second operator. The comparison of these two techniques are based on two quality measures, shape factor and minimum angle which both are local criteria. Also, a global quality smoothness criterion is introduced and used to assess global smoothing characteristics of these methods. Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.
A Novel Volume Constrained Smoothing Method for Meshes
Graphical Models, 2002
In general, mesh smoothing is performed by minimizing the discrete energy function for the surface. One of the major problems in mesh smoothing is to prevent the mesh from shrinking. In this paper, we propose a novel volume constraint to address the shrinking problem in mesh smoothing. Our key observation is that the mesh can be efficiently smoothed patch by patch in a signal processing manner, and then a local volume preserving constraint can be easily imposed to the energy minimization problem associated with the small patch, called the smoothing stencil, so as to effectively avoid the mesh shrinkage. In our implementation, the smoothing stencil is the 1-ring neighboring region of an edge or a triangle. And the constrained minimization problem is solved by a 2-step approximation method for efficiency. A series of examples demonstrate that the proposed smoothing method can be applied to remove noise from a mesh or remove rough detail from an original mesh to generate a smooth model in object reconstruction and geometry modeling. c 2002 Elsevier Science (USA)
Improvement of Triangular and Quadrilateral Surface Meshes 1
In this paper, we present a new technique called Trapezium Drawing to improve surface mesh quality while maintaining the essential surface characteristics. In contrast to previous methods we do not tend to preserve new mesh vertices on the original discrete surface. Instead our approach allows keeping new mesh close to the surface approximated by the initial mesh. All operations are performed directly on the surface. As a result our technique is robust and runs at interactive speeds. It can be applied to triangular and quadrilateral meshes iteratively. Various quantitative measures are presented to demonstrate the effectiveness of proposed technique.
Surface smoothing and quality improvement of quadrilateral/hexahedral meshes with geometric flow
Communications in Numerical Methods in Engineering, 2009
This paper describes an approach to smooth the surface and improve the quality of quadrilateral/hexahedral meshes with feature preserved using geometric flow. For quadrilateral surface meshes, the surface diffusion flow is selected to remove noise by relocating vertices in the normal direction, and the aspect ratio is improved with feature preserved by adjusting vertex positions in the tangent direction. For hexahedral meshes, besides the surface vertex movement in the normal and tangent directions, interior vertices are relocated to improve the aspect ratio. Our method has the properties of noise removal, feature preservation and quality improvement of quadrilateral/hexahedral meshes, and it is especially suitable for biomolecular meshes because the surface diffusion flow preserves sphere accurately if the initial surface is close to a sphere. Several demonstration examples are provided from a wide variety of application domains. Some extracted meshes have been extensively used in finite element simulations.
State of the art in quad meshing
Triangle meshes have been nearly ubiquitous in computer graphics, and a large body of data structures and geometry processing algorithms based on them has been developed in the literature. At the same time, quadrilateral meshes, especially semi-regular ones, have advantages for many applications, and significant progress was made in quadrilateral mesh generation and processing during the last several years. In this State of the Art Report, we discuss the advantages and problems of techniques operating on quadrilateral meshes, including surface analysis and mesh quality, simplification, adaptive refinement, alignment with features, parametrization, and remeshing.
Modeling of quality parameter values for improving meshes
Japan Journal of Industrial and Applied Mathematics, 2007
A novel quasi-statistical approach to improve the quality of triangular meshes is presented. The present method is based on modeling of an event of the mesh improvement. This event is modeled via modeling of a discrete random variable. The random variable is modeled in a tangent plane of each local domain of the mesh. One domain collects several elements with a common point. Values of random variable are calculated by modeling formula according to the initial sampling data of the projected elements with respect to all neighbors of the domain. Geometrical equivalent called potential form is constructed for each element of the domain with a mesh quality parameter value equal to the modeled numerical value. Such potential forms create potential centers of the domain. Averaging the coordinates of potential centers of the domain gives a new central point position. After geometrical realization over the entire mesh, the shapes of triangular elements are changed according to the normal distribution. It is shown experimentally that the mean of the final mesh is better than the initial one in most cases, so the event of the mesh improvement is likely occurred. Moreover, projection onto a local tangent plane included in the algorithm allows preservation of the model volume enclosed by the surface mesh. The implementation results are presented to demonstrate the functionality of the method. Our approach can provide a flexible tool for the development of mesh improvement algorithms, creating better-input parameters for the triangular meshes and other kinds of meshes intended to be applied in finite element analysis or computer graphics.
Improvement of triangular and quadrilateral surface meshes
2004
In this paper, we present a new technique called Trapezium Drawing to improve surface mesh quality while maintaining the essential surface characteristics. In contrast to previous methods we do not tend to preserve new mesh vertices on the original discrete surface. Instead our approach allows keeping new mesh close to the surface approximated by the initial mesh. All operations are performed directly on the surface. As a result our technique is robust and runs at interactive speeds. It can be applied to triangular and quadrilateral meshes iteratively. Various quantitative measures are presented to demonstrate the effectiveness of proposed technique.
Related papers
Fast smoothing of mixed volume meshes based on the effective geometric element transformation method
Computer Methods in Applied Mechanics and Engineering, 2012
The geometric element transformation method (GETMe) is an efficient geometry driven approach to mesh smoothing. It is based on regularizing element transformations which, if applied iteratively to a single element, improve its regularity and with this its quality. The smoothing method has already successfully been applied in the case of mixed surface meshes as well as all-tetrahedral and all-hexahedral meshes. In this paper, a GETMe-based approach for smoothing mixed volume meshes is presented. For this purpose, dual element-based regularizing transformations for tetrahedral, hexahedral, pyramidal, and prismatic elements are introduced and analyzed. Furthermore, it is shown that the general concept of GETMe smoothing also applies to mixed volume meshes requiring only minor modifications. Numerical results demonstrate that high quality meshes comparable to those obtained by a state of the art global optimization-based approach can be achieved within significantly shorter runtimes.
The SPHERIGON: a simple polygon patch for smoothing quickly your polygonal meshes
Proceedings Computer Animation '98 (Cat. No.98EX169), 1998
Smoothing techniques are essential in providing high quality renderings out of polygonal objects that are described with a minimal amount of geometrical information. In order to remove the "polygonal" aspect of rough polygonal meshes, several techniques are available, such as shading or interpolation techniques.
Mesh Smoothing with Global Optimization under Constraints
Strojniški vestnik – Journal of Mechanical Engineering, 2011
Mesh (pre) processing remains an important issue for obtaining useful meshes used in mechanical engineering, especially for finite element calculations. An efficient and robust combination of constrained mesh smoothing together with global optimization based algorithm is presented. In contrast to other "popular" mesh smoothing algorithms that use only local diffusion approaches to smoothing we propose Lagrange-Newton Sequential Quadratic Optimization (LNO) with constraints that can satisfy local and global cost functions, respecting posed constraints. Local cost function is modeled with local average edge length while global cost function includes barycenter and global average edge length.
An algebraic method for smoothing surface triangulations on a local parametric space
International Journal for Numerical Methods in Engineering, 2006
This paper presents a new procedure to improve the quality of triangular meshes defined on surfaces. The improvement is obtained by an iterative process in which each node of the mesh is moved to a new position that minimizes a certain objective function. This objective function is derived from algebraic quality measures of the local mesh (the set of triangles connected to the adjustable or free node). If we allow the free node to move on the surface without imposing any restriction, only guided by the improvement of the quality, the optimization procedure can construct a high-quality local mesh, but with this node in an unacceptable position. To avoid this problem the optimization is done in the parametric mesh, where the presence of barriers in the objective function maintains the free node inside the feasible region. In this way, the original problem on the surface is transformed into a two-dimensional one on the parametric space. In our case, the parametric space is a plane, chosen in terms of the local mesh, in such a way that this mesh can be optimally projected performing a valid mesh, that is, without inverted elements. Several examples and applications presented in this work show how this technique is capable of improving the quality of triangular surface meshes. Copyright © 2005 John Wiley & Sons, Ltd.
All-hexahedral mesh smoothing with a node-based measure of quality
International Journal for Numerical Methods in Engineering, 2001
This research work deals with the analysis and test of a normalized-Jacobian metric used as a measure of the quality of all-hexahedral meshes. Instead of element qualities, a measure of node quality was chosen. The chosen metric is a bound for deviation from orthogonality of faces and dihedral angles. We outline the main steps and algorithms of a program that is successful in improving the quality of initially invalid meshes to acceptable levels. For node movements, the program relies on a combination of gradient-driven and simulated annealing techniques. Some examples of the results and speed are also shown.
Mesh simplification with smooth surface reconstruction
Computer-aided Design, 1998
In this work, a new method for mesh simpli cation and surface reconstruction speci cally designed for the needs of CAD/CAM engineering design and analysis is introduced. The method simpli es the original free-form face model by rst constructing restricted curvature deviation regions, generating a boundary conforming nite element quadrilateral mesh of the regions, and then tting a smooth surface over the quadrilateral mesh using the plate energy method. It is more general in scope than existing methods because it handles models with free-form faces and non-manifold geometry, not just triangular or polygonal faces. It produces a high-quality quadrilateral mesh which is suited for both Finite Element Analysis and CAD/CAM. The smooth surface obtained by energy functional stabilization over limited curvature regions preserves the number of quadrilateral elements, and is best suited for surface modeling.
Curvature Based Mesh Improvement
It is very important to improve the quality of surface meshes for numerical simulations, solid mesh generation, and computer graphics applications. Optimizing the form of the mesh elements it is necessary to preserve new nodes of the mesh as close as possible to a surface approximated by the initial mesh. This paper proposes a novel technique in which both of the requirements to mesh improvement are implemented. In the method presented here the new location of each node is found using values of principal curvatures in this node. Such procedure allows preserving new mesh very close to the initial surface while improving element quality. The method has been successfully tested on triangular meshes both for analytical surfaces (sphere, ellipsoid, paraboloid) and for arbitrary surfaces with great number of points. Comparison of the deviation of the mesh optimized by our method and by Laplacian smoothing from the original analytical surfaces shows advantage of the proposed method.
DARSS: a hybrid mesh smoother for all hexahedral meshes
Engineering with Computers, 2011
A method for smoothing hexahedral meshes has been developed. The method consists of two phases. In the first phase, the nodes are moved based on an explicit formulation. A constraint has also been implemented to prevent the deterioration of elements associated with the node being moved. The second phase of the method is optismoothing based on the Nelder-Mead simplex method. The summation of the Jacobian of all the elements sharing a node has been taken as the function to be maximized. The method has been tested on meshes up to 18,305 hexahedral elements and was found to be stable and improved the mesh in about 112.6 s on an Intel Centrino Ò 1.6 GHz, 1 GB RAM machine. The method thus has the advantage of being effective as well as being computationally efficient.
Quad-Mesh Generation and Processing: A Survey
Computer Graphics Forum, 2013
Triangle meshes have been nearly ubiquitous in computer graphics, and a large body of data structures and geometry processing algorithms based on them has been developed in the literature. At the same time, quadrilateral meshes, especially semiregular ones, have advantages for many applications, and significant progress was made in quadrilateral mesh generation and processing during the last several years. In this survey we discuss the advantages and problems of techniques operating on quadrilateral meshes, including surface analysis and mesh quality, simplification, adaptive refinement, alignment with features, parametrisation and remeshing.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.