1
0
Fork 0
flightgear/Tools/Construct/Clipper/clipper.cxx

296 lines
7.6 KiB
C++
Raw Normal View History

1999-03-01 15:39:39 +00:00
// clipper.cxx -- top level routines to take a series of arbitrary areas and
// produce a tight fitting puzzle pieces that combine to make a
// tile
//
// Written by Curtis Olson, started February 1999.
//
// Copyright (C) 1999 Curtis L. Olson - curt@flightgear.org
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
//
// $Id$
#include <Debug/logstream.hxx>
#include <Include/fg_constants.h>
#include <Misc/fgstream.hxx>
#include <Polygon/names.hxx>
#include "clipper.hxx"
1999-03-01 15:39:39 +00:00
// Constructor
FGClipper::FGClipper( void ) {
}
1999-03-01 15:39:39 +00:00
// Destructor
FGClipper::~FGClipper( void ) {
}
1999-03-01 15:39:39 +00:00
// Initialize Clipper (allocate and/or connect structures)
bool FGClipper::init() {
1999-03-01 15:39:39 +00:00
v_list.num_vertices = 0;
v_list.vertex = new gpc_vertex[FG_MAX_VERTICES];;
for ( int i = 0; i < FG_MAX_AREA_TYPES; ++i ) {
polys_in.polys[i].clear();
}
1999-03-01 15:39:39 +00:00
return true;
}
// Load a polygon definition file
bool FGClipper::load_polys(const string& path) {
1999-03-01 15:39:39 +00:00
string poly_name;
AreaType poly_type = DefaultArea;
1999-03-01 15:39:39 +00:00
int contours, count, i, j;
int hole_flag;
1999-03-01 15:39:39 +00:00
double startx, starty, x, y, lastx, lasty;
FG_LOG( FG_CLIPPER, FG_INFO, "Loading " << path << " ..." );
fg_gzifstream in( path );
if ( !in ) {
FG_LOG( FG_CLIPPER, FG_ALERT, "Cannot open file: " << path );
exit(-1);
}
gpc_polygon *poly = new gpc_polygon;
poly->num_contours = 0;
poly->contour = NULL;
1999-03-01 15:39:39 +00:00
in >> skipcomment;
while ( !in.eof() ) {
in >> poly_name;
cout << "poly name = " << poly_name << endl;
poly_type = get_area_type( poly_name );
cout << "poly type (int) = " << (int)poly_type << endl;
in >> contours;
cout << "num contours = " << contours << endl;
for ( i = 0; i < contours; ++i ) {
in >> count;
if ( count < 3 ) {
FG_LOG( FG_CLIPPER, FG_ALERT,
"Polygon with less than 3 data points." );
exit(-1);
}
in >> hole_flag;
1999-03-01 15:39:39 +00:00
in >> startx;
in >> starty;
v_list.vertex[0].x = startx;
v_list.vertex[0].y = starty;
FG_LOG( FG_CLIPPER, FG_BULK, "0 = "
<< startx << ", " << starty );
for ( j = 1; j < count - 1; ++j ) {
in >> x;
in >> y;
v_list.vertex[j].x = x;
v_list.vertex[j].y = y;
FG_LOG( FG_CLIPPER, FG_BULK, j << " = " << x << ", " << y );
}
v_list.num_vertices = count - 1;
in >> lastx;
in >> lasty;
if ( (fabs(startx - lastx) < FG_EPSILON)
&& (fabs(starty - lasty) < FG_EPSILON) ) {
// last point same as first, discard
} else {
v_list.vertex[count - 1].x = lastx;
v_list.vertex[count - 1].y = lasty;
++v_list.num_vertices;
FG_LOG( FG_CLIPPER, FG_BULK, count - 1 << " = "
<< lastx << ", " << lasty );
}
gpc_add_contour( poly, &v_list, hole_flag );
1999-03-01 15:39:39 +00:00
}
in >> skipcomment;
}
int area = (int)poly_type;
if ( area == OceanArea ) {
// TEST - Ignore
} else if ( area < FG_MAX_AREA_TYPES ) {
polys_in.polys[area].push_back(poly);
} else {
FG_LOG( FG_CLIPPER, FG_ALERT, "Polygon type out of range = "
<< (int)poly_type);
exit(-1);
}
1999-03-01 15:39:39 +00:00
// FILE *ofp= fopen("outfile", "w");
// gpc_write_polygon(ofp, &polys.landuse);
return true;
}
// Do actually clipping work
bool FGClipper::clip_all(const point2d& min, const point2d& max) {
gpc_polygon accum, result_union, tmp;
gpc_polygon *result_diff, *remains;
gpcpoly_iterator current, last;
1999-03-01 15:39:39 +00:00
FG_LOG( FG_CLIPPER, FG_INFO, "Running master clipper" );
accum.num_contours = 0;
cout << " (" << min.x << "," << min.y << ") ("
<< max.x << "," << max.y << ")" << endl;
// set up clipping tile
v_list.vertex[0].x = min.x;
v_list.vertex[0].y = min.y;
v_list.vertex[1].x = max.x;
v_list.vertex[1].y = min.y;
v_list.vertex[2].x = max.x;
v_list.vertex[2].y = max.y;
v_list.vertex[3].x = min.x;
v_list.vertex[3].y = max.y;
v_list.num_vertices = 4;
polys_in.safety_base.num_contours = 0;
polys_in.safety_base.contour = NULL;
gpc_add_contour( &polys_in.safety_base, &v_list, 0 );
1999-03-01 15:39:39 +00:00
1999-05-20 04:23:19 +00:00
int count = 0;
1999-03-01 15:39:39 +00:00
// process polygons in priority order
for ( int i = 0; i < FG_MAX_AREA_TYPES; ++i ) {
cout << "num polys of type (" << i << ") = "
<< polys_in.polys[i].size() << endl;
1999-03-01 15:39:39 +00:00
current = polys_in.polys[i].begin();
last = polys_in.polys[i].end();
for ( ; current != last; ++current ) {
FG_LOG( FG_CLIPPER, FG_DEBUG, get_area_name( (AreaType)i )
<< " = " << (*current)->contour->num_vertices );
#ifdef EXTRA_SAFETY_CLIP
// clip to base tile
gpc_polygon_clip(GPC_INT, *current, &polys_in.safety_base, &tmp);
1999-03-01 15:39:39 +00:00
#else
tmp = *current;
1999-03-01 15:39:39 +00:00
#endif
// clip current polygon against previous higher priority
// stuff
result_diff = new gpc_polygon;
result_diff->num_contours = 0;
result_diff->contour = NULL;
1999-03-01 15:39:39 +00:00
if ( accum.num_contours == 0 ) {
*result_diff = tmp;
1999-03-01 15:39:39 +00:00
result_union = tmp;
} else {
1999-03-31 23:46:38 +00:00
// cout << "DIFF: tmp.num_contours = " << tmp.num_contours
// << " accum.num_contours = " << accum.num_contours
// << endl;
1999-03-30 23:49:22 +00:00
// tmp output accum
1999-05-20 04:23:19 +00:00
// FILE *ofp= fopen("tmp-debug", "w");
// gpc_write_polygon(ofp, 1, &tmp);
// fclose(ofp);
// ofp= fopen("accum-debug", "w");
// gpc_write_polygon(ofp, 1, &accum);
// fclose(ofp);
1999-03-30 23:49:22 +00:00
gpc_polygon_clip(GPC_DIFF, &tmp, &accum, result_diff);
gpc_polygon_clip(GPC_UNION, &tmp, &accum, &result_union);
1999-03-01 15:39:39 +00:00
}
/*
cout << "original contours = " << tmp.num_contours << endl;
for ( int j = 0; j < tmp.num_contours; j++ ) {
for (int k = 0;k < tmp.contour[j].num_vertices;k++ ) {
cout << tmp.contour[j].vertex[k].x << ","
<< tmp.contour[j].vertex[k].y << endl;
}
}
cout << "clipped contours = " << result_diff->num_contours << endl;
for ( int j = 0; j < result_diff->num_contours; j++ ) {
for (int k = 0;k < result_diff->contour[j].num_vertices;k++ ) {
cout << result_diff->contour[j].vertex[k].x << ","
<< result_diff->contour[j].vertex[k].y << endl;
}
}
*/
// only add to output list if the clip left us with a polygon
if ( result_diff->num_contours > 0 ) {
polys_clipped.polys[i].push_back(result_diff);
1999-05-20 04:23:19 +00:00
// char filename[256];
// sprintf(filename, "next-result-%02d", count++);
// FILE *tmpfp= fopen(filename, "w");
// gpc_write_polygon(tmpfp, 1, result_diff);
// fclose(tmpfp);
}
1999-03-01 15:39:39 +00:00
accum = result_union;
}
}
// finally, what ever is left over goes to ocean
1999-03-01 15:39:39 +00:00
// clip to accum against original base tile
remains = new gpc_polygon;
remains->num_contours = 0;
remains->contour = NULL;
1999-03-01 15:39:39 +00:00
gpc_polygon_clip(GPC_DIFF, &polys_in.safety_base, &accum,
remains);
if ( remains->num_contours > 0 ) {
polys_clipped.polys[(int)OceanArea].push_back(remains);
}
1999-03-01 15:39:39 +00:00
FILE *ofp;
1999-03-01 15:39:39 +00:00
// tmp output accum
if ( accum.num_contours ) {
ofp = fopen("accum", "w");
gpc_write_polygon(ofp, 1, &accum);
fclose(ofp);
}
1999-03-01 15:39:39 +00:00
// tmp output safety_base
if ( remains->num_contours ) {
ofp= fopen("remains", "w");
gpc_write_polygon(ofp, 1, remains);
fclose(ofp);
}
1999-03-01 15:39:39 +00:00
return true;
}