Automatic Mesh Partitioning

1993 ◽  
pp. 57-84 ◽  
Author(s):  
Gary L. Miller ◽  
Shang-Hua Teng ◽  
William Thurston ◽  
Stephen A. Vavasis
Keyword(s):  
Mesh Partitioning ◽  
Automatic Mesh

Automatic mesh update with the solid-extension mesh moving technique

2004 ◽  
Vol 193 (21-22) ◽  
pp. 2019-2032 ◽  
Author(s):  
Keith Stein ◽  
Tayfun E. Tezduyar ◽  
Richard Benney
Keyword(s):  
Automatic Mesh ◽  
Mesh Update

scholarly journals Motorcycle Graphs: Canonical Quad Mesh Partitioning

2008 ◽  
Vol 27 (5) ◽  
pp. 1477-1486 ◽  
Author(s):  
David Eppstein ◽  
Michael T. Goodrich ◽  
Ethan Kim ◽  
Rasmus Tamstorf
Keyword(s):  
Mesh Partitioning

A Constrained Optimization Approach to Finite Element Mesh Smoothing

1991 ◽  
Author(s):  
V. N. Parthasarathy ◽  
Srinivas Kodiyalam
Keyword(s):  
Finite Element ◽  
Constrained Optimization ◽  
Finite Element Mesh ◽  
Optimization Approach ◽  
Element Mesh ◽  
Initial Mesh ◽  
Nodal Coordinates ◽  
Automatic Mesh ◽  
Mesh Generators

Abstract The quality of a finite element solution has been shown to be affected by the quality of the underlying mesh. A poor mesh may lead to unstable and lor inaccurate finite element approximations. Mesh quality is often characterized by the “smoothness” or “shape” of the elements (triangles in 2-D or tetrahedra in 3-D). Most automatic mesh generators produce an initial mesh where the aspect ratio of the elements are unacceptably high. In this paper, a new approach to produce acceptable quality meshes from an initial mesh is presented. Given an initial mesh (nodal coordinates and element connectivity), a “smooth” final mesh is obtained by solving a constrained optimization problem. The variables for the iterative optimization procedure are the nodal coordinates (excluding, the boundary nodes) of the finite element mesh, and appropriate bounds are imposed on these to prevent an unacceptable finite element mesh. Examples are given of the application of the above method for 2/3-D triangular meshes generated using a QUADTREE | OCTREE automatic mesh generators. Results indicate that the new method not only yields better quality elements when compared with the traditional Laplacian smoothing, but also guarantees a valid mesh unlike the Laplacian method.

scholarly journals A Mesh Partitioning Using Adaptive Vertex Clustering

2009 ◽  
Vol 15 (3) ◽  
pp. 19-26
Author(s):  
김대영 ◽  
Haeyoung Lee ◽  
김종원
Keyword(s):  
Mesh Partitioning ◽  
Vertex Clustering
Sign in / Sign up

Export Citation Format

Share Document