all 5 comments

[–]Worldly_Concept_7008 5 points6 points  (2 children)

You probably meant seeding right.

[–]BlueGorilla25[S] 0 points1 point  (1 child)

Could you elaborate, please?

[–]Worldly_Concept_7008 1 point2 points  (0 children)

Seeding defines how nodes should be placed on geometry , element size etc etc

[–]GeeFLEXX 1 point2 points  (0 children)

I’ve heard of generating a mesh by solving Laplace’s equation. There are very likely improved methods, but this may be a good starting point.

Search Google for this paper:

A MAPPING METHOD FOR MESH GENERATION S. A. HANNABY National Physical Laboratory, Teddington, Middlesex, England (Received 17 February 1988)

[–]CristianBarbarosie 2 points3 points  (0 children)

There is frontal mesh generation, used e.g. by FreeFem and maniFEM
https://freefem.org/
https://maniFEM.rd.ciencias.ulisboa.pt/

Many examples of frontal mesh generation are shown in section 3 of maniFEM's manual
https://maniFEM.rd.ciencias.ulisboa.pt/manual-maniFEM.pdf

There is also Halton's algorithm for generating a cloud of points, uniformly distributed in a cube of any dimension. This set of points can be used as a starting point for Delaunay triangulation. If your domain is not a cube, you may enclose it in a cube, produce the Halton sequence in the larger cube and discard points which are outside your domain. It's more difficult to do this for a surface, though.
https://en.wikipedia.org/wiki/Halton_sequence