1 // triangle.cxx -- "Triangle" interface class
3 // Written by Curtis Olson, started March 1999.
5 // Copyright (C) 1999 Curtis L. Olson - curt@flightgear.org
7 // This program is free software; you can redistribute it and/or
8 // modify it under the terms of the GNU General Public License as
9 // published by the Free Software Foundation; either version 2 of the
10 // License, or (at your option) any later version.
12 // This program is distributed in the hope that it will be useful, but
13 // WITHOUT ANY WARRANTY; without even the implied warranty of
14 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 // General Public License for more details.
17 // You should have received a copy of the GNU General Public License
18 // along with this program; if not, write to the Free Software
19 // Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
22 // (Log is kept at end of this file)
25 #include "triangle.hxx"
29 FGTriangle::FGTriangle( void ) {
34 FGTriangle::~FGTriangle( void ) {
38 // populate this class based on the specified gpc_polys list
39 int FGTriangle::build( const FGgpcPolyList& gpc_polys ) {
43 // traverse the gpc_polys and build a unified node list and a set
44 // of Triangle PSLG that reference the node list by index
47 gpc_polygon *gpc_poly;
48 const_gpcpoly_iterator current, last;
50 // process polygons in priority order
51 cout << "prepairing node list and polygons" << endl;
53 for ( int i = 0; i < FG_MAX_AREA_TYPES; ++i ) {
54 cout << "area type = " << i << endl;
55 current = gpc_polys.polys[i].begin();
56 last = gpc_polys.polys[i].end();
57 for ( ; current != last; ++current ) {
59 cout << "processing a polygon, contours = "
60 << gpc_poly->num_contours << endl;
62 poly.erase(poly.begin(), poly.end());
64 if (gpc_poly->num_contours <= 0 ) {
65 cout << "FATAL ERROR! no contours in this polygon" << endl;
69 if (gpc_poly->num_contours > 1 ) {
70 cout << "FATAL ERROR! no multi-contour support" << endl;
75 for ( int j = 0; j < gpc_poly->num_contours; j++ ) {
76 for ( int k = 0; k < gpc_poly->contour[j].num_vertices; k++ ) {
77 Point3D p( gpc_poly->contour[j].vertex[k].x,
78 gpc_poly->contour[j].vertex[k].y,
80 index = trinodes.unique_add( p );
81 poly.push_back(index);
82 // cout << index << endl;
84 polylist[i].push_back(poly);
89 for ( int i = 0; i < FG_MAX_AREA_TYPES; ++i ) {
90 if ( polylist[i].size() ) {
91 cout << get_area_name((AreaType)i) << " = "
92 << polylist[i].size() << endl;
99 // do actual triangulation
100 int FGTriangle::do_triangulate( const tripoly& poly ) {
101 point_container node_list;
102 struct triangulateio in, mid, out, vorout;
105 // define input points
106 node_list = trinodes.get_node_list();
108 in.numberofpoints = node_list.size();
109 in.pointlist = (REAL *) malloc(in.numberofpoints * 2 * sizeof(REAL));
111 point_iterator current, last;
112 current = node_list.begin();
113 last = node_list.end();
115 for ( ; current != last; ++current ) {
116 in.pointlist[counter++] = current->x();
117 in.pointlist[counter++] = current->y();
122 // triangulate each of the polygon areas
123 int FGTriangle::triangulate() {
126 tripoly_list_iterator current, last;
128 for ( int i = 0; i < FG_MAX_AREA_TYPES; ++i ) {
129 cout << "area type = " << i << endl;
130 current = polylist[i].begin();
131 last = polylist[i].end();
132 for ( ; current != last; ++current ) {
134 cout << "triangulating a polygon, size = " << poly.size() << endl;
136 do_triangulate( poly );
145 // Revision 1.4 1999/03/19 22:29:04 curt
146 // Working on preparationsn for triangulation.
148 // Revision 1.3 1999/03/19 00:27:10 curt
149 // Continued work on triangulation preparation.
151 // Revision 1.2 1999/03/18 04:31:11 curt
152 // Let's not pass copies of huge structures on the stack ... ye might see a
155 // Revision 1.1 1999/03/17 23:51:59 curt