[MOAB-dev] r5832 - MOAB/trunk/examples

[iulian at mcs.anl.gov]

Author: iulian
Date: 2012-10-24 20:25:53 -0500 (Wed, 24 Oct 2012)
New Revision: 5832

Removed:
   MOAB/trunk/examples/IntxMeshes.cpp
   MOAB/trunk/examples/m1.vtk
   MOAB/trunk/examples/m2.vtk
Modified:
   MOAB/trunk/examples/Makefile.am
Log:
remove the example with triangle intersections, it is now part of mbcslam


Deleted: MOAB/trunk/examples/IntxMeshes.cpp
===================================================================
--- MOAB/trunk/examples/IntxMeshes.cpp	2012-10-25 01:23:40 UTC (rev 5831)
+++ MOAB/trunk/examples/IntxMeshes.cpp	2012-10-25 01:25:53 UTC (rev 5832)
@@ -1,889 +0,0 @@
-/*
- * IntersectMesh_test.cpp
- *
- *  This test is for intersection of 2d meshes, on top of each other, for
- *   a domain decomposition algorithm; it leverages the method from ProjectShell algorithm.
- *
- *  inputs are 2 meshes, vtk format, output will be another mesh, m3, with the common part
- *    intersected
- *
- *  Created on: Aug 19, 2010
- *      Author: iulian
- */
-
-#include <iostream>
-#include <time.h>
-#include <stdlib.h>
-#include <stdio.h>
-#include <string.h>
-#include "moab/Core.hpp"
-#include "moab/Interface.hpp"
-#include "moab/Range.hpp"
-
-using namespace std;
-using namespace moab;
-
-#define STRINGIFY_(X) #X
-#define STRINGIFY(X) STRINGIFY_(X)
-
-#include <queue>
-//#include <map>
-#include <vector>
-#include <iostream>
-#include <fstream>
-#include <math.h>
-
-// we should really work only with triangles in their sets;
-// can we get adjacencies limited to a set?
-// how do we check if a triangle is really part of a set?
-EntityHandle mbs1;// set 1, blue triangles
-EntityHandle mbs2;
-EntityHandle outSet;
-Interface * mb;// global
-
-Tag BlueFlagTag; // to mark blue triangles already considered
-
-Tag RedFlagTag; // to mark blue triangles already considered