about.html

有限元学习研究用源代码(老外的),供科研人员参考

<TITLE>COG 2.0</TITLE>

<H1>About COG 2.0</H1>

 <P><B>COG</B> is a grid generation package for 2D an 3D Delaunay grid
generation. It is based on a new concept for geometry description
named <A HREF="cogeometry.html">cogeometry</A>.

 <P>An essential part of COG, which includes all possibilities for
geometry description, 2D and 3D grid generation with local,
anisotropical refinement, is
 <A HREF="public.html">public domain</A>.

 <P>The grid generation starts with a regular coarse grid, refines
this grid with an octree algorithm, and detects the geometry
automatically via the computation of intersections of grid lines and
faces with the boundaries of the geometry description.  For the
resulting point set, the Delaunay algorithm is used to compute the
resulting grid.

 <P>The full version allows to modify the octree algorithm using
curvilinear coordinates, and allows to combine different "local
charts" into a global Delaunay grid.  That means, it allows to create
grids like in the right part of the following picture:

 <P><IMG SRC="uniontest.gif">

 <P>while the public domain variant creates a grid like in the left
part of the picture.  The advantage of the full version grid is that
it allows much higher refinement in the "necessary" direction with the
same or even a much smaller number of grid points.  The related point
economy is much higher in 3D:

 <P><IMG SRC="oiltest.gif">