about.html

Delaunay三角形的网格剖分程序

<TITLE>COG 2.1</TITLE>

<H1>COG 2.1</H1>

 <P><B>COG</B> is a grid generation package for 2D an 3D grid
generation.  An essential part is
 <A HREF="public.html">public domain</A>.
 It's aim is to create Delaunay grids with few nodes for complex
geometries.

 <P>It is based on a new concept for geometry description named
 <A HREF="cogeometry.html">cogeometry</A>. This concept makes
the implementation of complex geometries easy.

 <P>To minimize the number of points especially in 3D requires not
only local refinement, but also anisotropic refinements.  The
 <A HREF="quality.html">grid quality criterion</A> which is considered
to be important is the Delaunay criterion.

 <UL>
 <LI> <A HREF="install.html">Installation</A>
 <LI> <A HREF="tutorial.html">Tutorial</A>
 <LI> <A HREF="links.html">Misc</A>
 </UL>


<H2>Examples</H2>

 <P>An example of a 3D grid shows some possibilities of COG: the
possibility to describe geometries with very small details with an
appropriate very accurate grid which becomes coarse in the less
interesting domains:

 <P><A HREF="mainoiltest.html"><IMG SRC="oiltest.gif"></A>

 <P>The following geometry was created using a pixmap with different
colors for different domains:

 <P><A HREF="mainpixmaptest.html"><IMG SRC="pixmaptest.gif"></A>

<H2>Pricing</H2>

 <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 <A HREF="pricing.html">full version</A> includes new features
for local anisotropical refinement, like in the right part of the
following picture (the left part shows the similar public domain
grid):

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