Algorithm for assembling quadrilateral mesh in FEM

Click For Summary

Discussion Overview

The discussion revolves around the challenge of assembling a quadrilateral mesh in finite element methods (FEM) using only the coordinates of the four vertices of each element. The focus is on computational geometry rather than established mesh generation techniques like Delaunay triangulation or advancing front methods.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested

Main Points Raised

  • One participant describes their current method of assembling mesh elements by moving a point through the domain and comparing its coordinates with the vertices of quadrilaterals, but notes this method is limited to rectangular elements.
  • Another participant seeks clarification on the initial approach, questioning whether the goal is to determine element membership for a point or to generate a mesh automatically.
  • A participant outlines their automatic quadrilateral mesh generation process, which involves drawing a polygonal shape and filling the domain with rectangles, followed by assigning global numbers to vertices based on local numbering.
  • One participant expresses skepticism about the feasibility of automatic assembly using only nodal coordinate data, suggesting that it may only be possible for simple geometries like rectangles and emphasizing the role of automatic mesh generators in defining boundaries and generating internal coordinates.
  • Another participant claims to have successfully assembled meshes for arbitrary shapes, challenging the previous skepticism.
  • A later post shifts the focus to finding neighboring elements using only nodal coordinate data, indicating a desire to explore connectivity in the mesh without additional information.

Areas of Agreement / Disagreement

There is no consensus on the feasibility of automatically assembling a quadrilateral mesh using only vertex coordinates. Participants express differing views on the limitations and possibilities of such an approach, with some asserting it is not feasible for complex shapes while others claim success with arbitrary shapes.

Contextual Notes

Participants highlight the complexity of the problem, noting that the assembly process may depend on the geometry of the region and the need for well-defined element arrangements. There are also mentions of related challenges in computational geometry, such as node numbering and surface representation from 3-D coordinates.

mdn
Messages
49
Reaction score
0
Hi all,
I have co-ordinates of 4 vertices of quadrilateral for every element in mesh. I assembled such elements by moving single, separate point in whole domain and compared it's coordinate with all vertices of quadrilateral.
Above technique work properly, but it required rectangle element with fixed width and height for all elements.
my question is, what is best algorithm to assemble quadrilateral mesh with only information of 4 vertices of each elements in mesh?
please note that this question is not based on Delaunay triangulation or any other advancing front method (this technique gives all information while making meshes), rather to consider computational geometry.
thanks in advance.
 
Engineering news on Phys.org
Your question is open to different interpretations.

What does "I assembled such elements by moving single, separate point in whole domain and compared it's coordinate with all vertices of quadrilateral" mean? Are you trying to determine to which elements or elements a particular point belongs?

Are you asking about automatic mesh generation?
 
Dear steamking,
thanks for replay, i will explain the stuff in detail.
*************Geometry to Mesh*************
my approach of generating automatic quadrilateral mesh is as follows...
1. draw any polygonal shape using mouse (convex, concave no restriction)
2. fill whole domain by rectangle (it is object in java, it will take track of its own vertices while moving in domain)
3. now in this stage, i had to do assembling means ... give global number to each vertices of element..find which node shares how many element for local global numbering.
in this technique i have used two dimensional array of coordinate to search every vertices of element and then given global number to each vertices. now next you know what is assembling...
I have used above technique for rectangle element and found no problem.

now question is, i know 4 vertices of rectangle of each element, can i assemble (off course automatic) elements, with only information of coordinates of vertices?
 
I think you want to know if it is possible for the elements of your mesh to be assembled automatically using just the nodal coordinate data.

I think the answer to this question is 'No' except for the simplest region geometries, like the rectangular region mentioned in the OP.

I believe what automatic mesh generators do is allow the user to describe the overall boundary to be analyzed, and then by means of triangulation or other procedures, generate internal nodal coordinates and elements without the user having to do this drudge work himself. Of course, there should be checks to ensure that the elements generated are well-behaved and that a sufficient number of elements is generated to provide an accurate solution.

It is problem of computational geometry, which is why I believe research is continuing.

A related problem is, once the elements and nodes have been generated, finding the arrangement of node numbering which minimizes the bandwidth of the corresponding stiffness matrix, in order to speed solution calculation.

A similar situation occurs when using lasers or other devices to measure objects in 3-D. The measuring device essentially produces a number of 3-D coordinates, but this information must be organized in some fashion in order to describe the surface of the object mathematically. A related field is how you would be able to engineer some sort of 'robot vision', which would allow a machine to 'see' objects and navigate around them without intervention by a human operator.
 
but i did that for arbitrary shape also!
 
let's forget about above stuff, i will ask question in different way
how to find neighbour of one with other element ? i have only information of nodal coordinate data of all elements and nothing else.
 

Similar threads

  • · Replies 17 ·
Replies
17
Views
7K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 9 ·
Replies
9
Views
4K
  • · Replies 4 ·
Replies
4
Views
13K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 9 ·
Replies
9
Views
5K
  • · Replies 23 ·
Replies
23
Views
37K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 13 ·
Replies
13
Views
4K
  • · Replies 19 ·
Replies
19
Views
10K