Changeset 1db34af

Timestamp:

Nov 28, 2009, 3:48:41 PM (16 years ago)

Author:

Frederik Heber <heber@…>

Children:

f4df97

Parents:

2dff2d (diff), ea3627 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.

Message:

Merge branch 'FixDegeneratedTesselation' into CorrectDegeneratedPolygons

Conflicts:

molecuilder/src/tesselation.cpp

merge only necessary due to stupid git commit --amend

Signed-off-by: Frederik Heber <heber@…>

File:

• molecuilder/src/tesselation.cpp (modified) (3 diffs)

molecuilder/src/tesselation.cpp

@@ -4132 +4132 @@
   /// 2. Go through all lines not contained in degenerated triangles.
   UniquePolygonSet ListofFours;
+  UniquePolygonSet TestedPolygons;
   for (LineMap::const_iterator LineRunner = LinesOnBoundary.begin(); LineRunner != LinesOnBoundary.end(); LineRunner++) {
     Log() << Verbose(1) << "Current Line is: " << *(LineRunner->second) << endl;
@@ -4148 +4149 @@
     TriangleSet *T = Four->GetAllContainedTrianglesFromEndpoints();
 
-    /// 2c. check whether triangles are not already simply degenerated.
+    /// 2c1. Check whether all triangles have (besides sign) same normal vector)
+    TriangleSet::const_iterator Runner = T->begin();
+    Vector NormalVector;
+    NormalVector.CopyVector(&(*Runner)->NormalVector);
+    Runner++;
+    bool IsPlanar = true;
+    for (; Runner != T->end(); Runner++) {
+      if (fabs(fabs(NormalVector.ScalarProduct(&(*Runner)->NormalVector)) - 1.) > MYEPSILON)  // check whether all NormalVectors are parallel
+        IsPlanar = false;
+    }
+
+    /// 2c2. check whether triangles are not already simply degenerated.
     size_t DegeneratedCount = 0;
     for (TriangleSet::const_iterator Runner = T->begin(); Runner != T->end(); Runner++) {
@@ -4155 +4167 @@
     }
     Log() << Verbose(1) << "Found " << DegeneratedCount << " degenerated triangles." << endl;
-    if (DegeneratedCount == 0) {
-      /// 2c. Find all pairs of those triangles that contain the four endpoints
-      const int counter = CountTrianglePairContainingPolygon(Four, T);
-      Log() << Verbose(1) << "There are " << counter << " pairs for this polygon of four." << endl;
-      if (counter %3 == 0) {
-        /// 2d. Check the number of pairs, if greater 1, we have a degenerated polygon (mark down for later use)
-        pair < UniquePolygonSet::iterator, bool > Tester = ListofFours.insert(Four);
-        if (Tester.second) {
-          Log() << Verbose(0) << "ACCEPT: We have a degenerated polygon." << *Four << endl;
+
+    if (IsPlanar) {
+      if(DegeneratedCount == 0) {
+        /// 2c. Find all pairs of those triangles that contain the four endpoints
+        const int counter = CountTrianglePairContainingPolygon(Four, T);
+        Log() << Verbose(1) << "There are " << counter << " pairs for this polygon of four." << endl;
+        if (counter %3 == 0) {
+          /// 2d. Check the number of pairs, if greater 1, we have a degenerated polygon (mark down for later use)
+          pair < UniquePolygonSet::iterator, bool > Tester = ListofFours.insert(Four);
+          if (Tester.second) {
+            Log() << Verbose(0) << "ACCEPT: We have a degenerated polygon." << *Four << endl;
+          } else {
+            Log() << Verbose(0) << "REJECT: Degenerated polygon already present." << *Four << endl;
+            delete(Four);
+          }
         } else {
-          Log() << Verbose(0) << "REJECT: Degenerated polygon already present." << *Four << endl;
+          Log() << Verbose(0) << "REJECT: Seems to be the edge line of a degenerated polygon only." << *Four << endl;
           delete(Four);
         }
       } else {
-        Log() << Verbose(0) << "REJECT: Seems to be the edge line of a degenerated polygon only." << *Four << endl;
+        Log() << Verbose(0) << "REJECT: This polygon contains some simply degenerated triangles." << endl;
         delete(Four);
       }
     } else {
-      Log() << Verbose(0) << "REJECT: This polygon contains some simply degenerated triangles." << endl;
+      Log() << Verbose(0) << "REJECT: This polygon does not lay on a plane." << endl;
       delete(Four);
     }