maincogpolartest.html

来自「Delaunay三角形的网格剖分程序」· HTML 代码 · 共 30 行

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

<H1>Intersection with a disc</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 disc (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 base = new <A HREF="cogenoctree.html">CogenOctree</A>();
  base-&gt;setBorder(0.0,1.0, -wzPi,wzPi);
  base-&gt;refinementGlobal(0.1,0.3);
  wz2dmap polar = new wz2Dpolar();
  cogenChart gen = new CogenChart(base-&gt;generator(),polar);
  wzgrid grid = (*gen)(geom);
  grid->write("test.sg");
}
</PRE>