maincog3dtest.html

Delaunay三角形的网格剖分程序

<TITLE>COG 2.1: Intersection with 3D box</TITLE>

<H1>Intersection with another cube</H1>

 <P>In this variant, instead of the <A HREF="maincogtest.html">cube
[-1,1]<SUP>3</SUP> </A>, the intersection of the
 <A HREF="cogtest.html">test cogeometry</A> with the cube [0,1]<SUP>3</SUP>
is computed.

<H1>Another example of a 3D box</H1>

 <P>This variant of the 3D box has boundaries [0,1] instead of
 the default box with <A HREF="maincogtest.html">boundaries [-1,1]</A>.

<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(0.0,1.0, 0.0,1.0, 0.0,1.0);
  gen-&gt;refinementGlobal(0.4,0.4,0.4);

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