Continue shaping the code towards triangulation bliss. Added code to

[flightgear.git] / Triangulate / triangle.cxx

diff --git a/Triangulate/triangle.cxx b/Triangulate/triangle.cxx
index 2a226dd3b2777dacd7c6bcdf85e25a62f77ba037..74b5d2fa2f729ae9e1a25ba3dce9d7c208bca316 100644 (file)
--- a/Triangulate/triangle.cxx
+++ b/Triangulate/triangle.cxx
@@ -23,6 +23,7 @@
 
 
 #include "triangle.hxx"
+#include "tripoly.hxx"
 
 
 // Constructor
@@ -36,38 +37,128 @@ FGTriangle::~FGTriangle( void ) {
 
 
 // populate this class based on the specified gpc_polys list
-int FGTriangle::build( FGgpcPolyList gpc_polys ) {
+int FGTriangle::build( const FGgpcPolyList& gpc_polys ) {
+    int index;
     // traverse the gpc_polys and build a unified node list and a set
     // of Triangle PSLG that reference the node list by index
     // (starting at zero)
 
     gpc_polygon *gpc_poly;
-    gpcpoly_iterator current, last;
+    const_gpcpoly_iterator current, last;
 
     // process polygons in priority order
     cout << "prepairing node list and polygons" << endl;
 
-    for ( int i = 0; i < FG_MAX_AREAS; ++i ) {
+    for ( int i = 0; i < FG_MAX_AREA_TYPES; ++i ) {
        cout << "area type = " << i << endl;
        current = gpc_polys.polys[i].begin();
        last = gpc_polys.polys[i].end();
        for ( ; current != last; ++current ) {
            gpc_poly = *current;
+           cout << "processing a polygon, contours = " 
+                << gpc_poly->num_contours << endl;
+
+           FGTriPoly poly;
+
+           if (gpc_poly->num_contours <= 0 ) {
+               cout << "FATAL ERROR! no contours in this polygon" << endl;
+               exit(-1);
+           }
+
+           if (gpc_poly->num_contours > 1 ) {
+               cout << "FATAL ERROR! no multi-contour support" << endl;
+               sleep(5);
+               // exit(-1);
+           }
 
            for ( int j = 0; j < gpc_poly->num_contours; j++ ) {
                for ( int k = 0; k < gpc_poly->contour[j].num_vertices; k++ ) {
                    Point3D p( gpc_poly->contour[j].vertex[k].x,
                               gpc_poly->contour[j].vertex[k].y,
                               0 );
-                   cout << trinodes.unique_add( p ) << endl;
+                   index = trinodes.unique_add( p );
+                   poly.add_node(index);
+                   // cout << index << endl;
                }
+               poly.calc_point_inside( trinodes );
+               cout << endl;
+               polylist[i].push_back(poly);
            }
        }
     }
+
+    for ( int i = 0; i < FG_MAX_AREA_TYPES; ++i ) {
+       if ( polylist[i].size() ) {
+           cout << get_area_name((AreaType)i) << " = " 
+                << polylist[i].size() << endl;
+       }
+    }
+    return 0;
+}
+
+
+// do actual triangulation
+int FGTriangle::do_triangulate( const FGTriPoly& poly ) {
+    trinode_list node_list;
+    struct triangulateio in, mid, out, vorout;
+    int counter;
+
+    // define input points
+    node_list = trinodes.get_node_list();
+
+    in.numberofpoints = node_list.size();
+    in.pointlist = (REAL *) malloc(in.numberofpoints * 2 * sizeof(REAL));
+
+    trinode_list_iterator current, last;
+    current = node_list.begin();
+    last = node_list.end();
+    counter = 0;
+    for ( ; current != last; ++current ) {
+       in.pointlist[counter++] = current->x();
+       in.pointlist[counter++] = current->y();
+    }
+
+    return 0;
+}
+
+
+// triangulate each of the polygon areas
+int FGTriangle::triangulate() {
+    FGTriPoly poly;
+
+    tripoly_list_iterator current, last;
+
+    for ( int i = 0; i < FG_MAX_AREA_TYPES; ++i ) {
+       cout << "area type = " << i << endl;
+       current = polylist[i].begin();
+       last = polylist[i].end();
+       for ( ; current != last; ++current ) {
+           poly = *current;
+           cout << "triangulating a polygon, size = " << poly.size() << endl;
+
+           do_triangulate( poly );
+       }
+    }
+
+    return 0;
 }
 
 
 // $Log$
+// Revision 1.5  1999/03/20 02:21:52  curt
+// Continue shaping the code towards triangulation bliss.  Added code to
+// calculate some point guaranteed to be inside a polygon.
+//
+// Revision 1.4  1999/03/19 22:29:04  curt
+// Working on preparationsn for triangulation.
+//
+// Revision 1.3  1999/03/19 00:27:10  curt
+// Continued work on triangulation preparation.
+//
+// Revision 1.2  1999/03/18 04:31:11  curt
+// Let's not pass copies of huge structures on the stack ... ye might see a
+// segfault ... :-)
+//
 // Revision 1.1  1999/03/17 23:51:59  curt
 // Initial revision.
 //