CGAL users discussion list

[José <>]

Hi, 

I have just started to use CGAL for mesh generation in my Computational
Fluid Dynamics (CFD) case. I need to generate a triangular mesh for a depth
integrated equation, so the size of the triangles depends on the local
depth. To solve this problem I generate a initial mesh
(Constrained_Delaunay_triangulation_2) using big triangles and I include all
the vertex of the triangulation into a list of points. Then I check the size
of each triangle and when the size is bigger than required, I include the
centroid of the triangle to the list and generate a new triangulation using
the points in the list. I continue this iterative process until the sizes of
all triangles fit the requirement. Can anyone suggest a better method to do
so? 

Once the mesh is generated I have to write into a file the nodes and faces
of the triangulation which I have already solved. I have to write also the
segments of the triangles that are at the boundaries. The case I'm working
on is quite easy (rectangular domain) and I have solved it using the
line_walk method applied to the 4 lines defining my domain. I am afraid that
this won't work with a more complicate domain... :) Does anyone knows a more
general method? 

Thanks a lot!!! 

José.

-- 
View this message in context: 
http://n4.nabble.com/2D-Mesh-generation-and-triangles-at-boundaries-tp961174p961174.html
Sent from the cgal-discuss mailing list archive at Nabble.com.