maincog2dtest.html

Delaunay三角形的网格剖分程序

<TITLE>COG 2.1: Intersection with rectangle</TITLE>

<H1>Intersection with a rectangle</H1>

 <P>In this variant, instead of the <A HREF="maincogtest.html">3D
cube</A>, the intersection of the 
 <A HREF="cogtest.html">test cogeometry</A> with a 2D rectangle
(shifted in z-direction) is computed.

<PRE>
#include "<A HREF="coglib.hxx">cog/coglib.hxx</A>"

cogeometry test_cogeometry();

#include "<A HREF="cogtest.cxx">cogtest.cxx</A>"

int main()
{
  cogeometry geom = test_cogeometry();

  cogenOctree gen = new <A HREF="cogenoctree.html">CogenOctree</A>();
  gen-&gt;setBorder(-1.0,1.0, -1.0,1.0);
  gen-&gt;refinementGlobal(0.2,0.2);
  gen-&gt;faceRefinementGlobal(0.05,0.4);
</PRE>

 <P>The following line defines the position in z-direction of the box.
Varying this value we obtain different intersections of the full 3D
cogeometry.

<PRE>
  gen-&gt;addPlaneZ(0.4);

  wzgrid grid = (*gen)(geom);
  grid->write("test.sg");
}
</PRE>