Changeset 238 for trunk/VUT/GtpVisibilityPreprocessor/src/Polygon3.cpp

Timestamp:

08/15/05 20:50:00 (19 years ago)

Author:

mattausch

Message:

bsp viewcell stuff
fixed some bugs
left debug messages
added heuristics
added bsp options

File:

• trunk/VUT/GtpVisibilityPreprocessor/src/Polygon3.cpp (modified) (10 diffs)

trunk/VUT/GtpVisibilityPreprocessor/src/Polygon3.cpp

@@ -1 +1 @@
 #include "Polygon3.h"
 #include "Mesh.h"
+
+#define SIDE_TOLERANCE 0.002
 
 Polygon3::Polygon3()
@@ -21 +23 @@
 }
 
-Plane3 Polygon3::GetSupportingPlane()
+Plane3 Polygon3::GetSupportingPlane() const
 {
+        Debug << "creating plane using vertices: " << mVertices[0] << mVertices[1] << mVertices[2] << endl;
+        Vector3 v1 = mVertices[0] - mVertices[1];
+                Vector3 v2 = mVertices[2] - mVertices[1];
+        Debug << "plane has vectors " <<  v1 << v2  << endl;
         return Plane3(mVertices[0], mVertices[1], mVertices[2]);
 }
 
-void Polygon3::DeletePolygons(PolygonQueue *polys)
+void Polygon3::DeletePolygons(PolygonContainer *polys)
 {
-        // don't need to store polygon information = delete polygons
+        // don't need to store polygon information => delete polygons
         while(!polys->empty())
         {
-                Polygon3 *poly = polys->front();
-                polys->pop();
+                Polygon3 *poly = polys->back();
+                polys->pop_back();
                 DEL_PTR(poly);
         }
@@ -42 +48 @@
         Vector3 ptA = mVertices[mVertices.size() - 1];
         
-        int sideA = partition->Side(ptA);
+        int sideA = partition->Side(ptA, SIDE_TOLERANCE);
         
         VertexContainer::const_iterator it;
+
+        Debug << "\n\nvertex A: " << ptA << ", side A: " << sideA << " (" << partition->Distance(ptA) << ")";
 
         // find line - plane intersections
@@ -50 +58 @@
         {
                 Vector3 ptB = (*it);
-                int sideB = partition->Side(ptB);
+                int sideB = partition->Side(ptB, SIDE_TOLERANCE);
+                Debug << " <=> vertex B: " << ptB << ", side B: " << sideB << " (" << partition->Distance(ptB) << ")\n\n";
 
                 // vertices on different sides => split
@@ -62 +71 @@
                                 // add vertex to both polygons
                                 front->mVertices.push_back(splitPt);
-                                back->mVertices.push_back(splitPt);
+                                back->mVertices.push_back(splitPt); Debug << "front and back polygon + " << splitPt << endl;
                         
                                 ++ splits;
                         }
-                        front->mVertices.push_back(ptB);
+                        front->mVertices.push_back(ptB); Debug << "front polygon + " << ptB << endl;
                 }
                 else if (sideB < 0)
@@ -77 +86 @@
                                 // add vertex to both polygons
                                 front->mVertices.push_back(splitPt);
-                                back->mVertices.push_back(splitPt);
+                                back->mVertices.push_back(splitPt); Debug << "front and back polygon + " << splitPt << endl;
 
                                 ++ splits;
                         }
-                        back->mVertices.push_back(ptB);
+                        back->mVertices.push_back(ptB); Debug << "back polygon + " << ptB << endl;
                 }
                 else
@@ -87 +96 @@
                         // vertex on plane => add vertex to both polygons
                         front->mVertices.push_back(ptB);
-                        back->mVertices.push_back(ptB);
+                        back->mVertices.push_back(ptB); Debug << "front and back polygon + " << ptB << endl;
                 }
         
                 ptA = ptB;
                 sideA = sideB;
+                Debug << "vertex A: " << ptA << ", side A: " << sideA << " (" << partition->Distance(ptA) << ")";
         }
+        Debug << "\n*********************\n";
 }
 
-int Polygon3::Side(Plane3 *plane)
+int Polygon3::Side(const Plane3 &plane) const
+{
+        int classification = ClassifyPlane(plane);
+        
+        if (classification == BACK_SIDE)
+                return -1;
+        else if (classification == FRONT_SIDE)
+                return 1;
+
+        return 0;
+}
+
+int Polygon3::ClassifyPlane(const Plane3 &plane) const
 {
         VertexContainer::const_iterator it;
@@ -102 +125 @@
         bool onBackSide = false;
 
-        // find line - plane intersections
+        // find possible line-plane intersections
         for (it = mVertices.begin(); it != mVertices.end(); ++ it)
         {
-                int side = plane->Side(*it);
+                int side = plane.Side(*it, SIDE_TOLERANCE);
                 
                 if (side > 0)
@@ -116 +139 @@
                 }
 
-                if (onFrontSide && onBackSide) // split
+                if (onFrontSide && onBackSide) // split //TODO: check if through vvertex
                 {
                         return SPLIT;
@@ -131 +154 @@
         }
 
+        // plane and polygon are coincident
         return COINCIDENT;
 }