tgconstruct_landclass is obsolete. Removed.
This commit is contained in:
Scott Giese
parent
d591a24a40
commit
53cb8086b3
2 changed files with 0 additions and 285 deletions
|
|
@ -8,7 +8,6 @@ add_executable(tg-construct
|
||||||
tgconstruct_clip.cxx
|
tgconstruct_clip.cxx
|
||||||
tgconstruct_debug.cxx
|
tgconstruct_debug.cxx
|
||||||
tgconstruct_elevation.cxx
|
tgconstruct_elevation.cxx
|
||||||
tgconstruct_landclass.cxx
|
|
||||||
tgconstruct_lookup.cxx
|
tgconstruct_lookup.cxx
|
||||||
tgconstruct_math.cxx
|
tgconstruct_math.cxx
|
||||||
tgconstruct_output.cxx
|
tgconstruct_output.cxx
|
||||||
|
|
|
||||||
|
|
@ -1,284 +0,0 @@
|
||||||
// construct.cxx -- Class to manage the primary data used in the
|
|
||||||
// construction process
|
|
||||||
//
|
|
||||||
// Written by Curtis Olson, started May 1999.
|
|
||||||
//
|
|
||||||
// Copyright (C) 1999 Curtis L. Olson - http://www.flightgear.org/~curt
|
|
||||||
//
|
|
||||||
// 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., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
||||||
//
|
|
||||||
// $Id: construct.cxx,v 1.4 2004-11-19 22:25:49 curt Exp $
|
|
||||||
|
|
||||||
#if 0
|
|
||||||
|
|
||||||
#ifdef HAVE_CONFIG_H
|
|
||||||
# include <config.h>
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#include <simgear/debug/logstream.hxx>
|
|
||||||
#include <simgear/math/SGMath.hxx>
|
|
||||||
|
|
||||||
#include "tgconstruct.hxx"
|
|
||||||
|
|
||||||
using std::string;
|
|
||||||
|
|
||||||
// If we don't offset land use squares by some amount, then we can get
|
|
||||||
// land use square boundaries coinciding with tile boundaries.
|
|
||||||
//
|
|
||||||
// This can foul up our edge matching scheme because a subsequently
|
|
||||||
// generated adjacent tile might be forced to have edge nodes not
|
|
||||||
// found in the first tile and not on the shared edge. This can lead
|
|
||||||
// to gaps. If we put skirts around everything that might hide the
|
|
||||||
// problem.
|
|
||||||
static const double cover_size = 1.0 / 120.0;
|
|
||||||
static const double half_cover_size = cover_size * 0.5;
|
|
||||||
static const double quarter_cover_size = cover_size * 0.25;
|
|
||||||
|
|
||||||
// make the area specified area, look up the land cover type, and add
|
|
||||||
// it to polys
|
|
||||||
void TGConstruct::make_area( const LandCover &cover, tgpolygon_list& polys,
|
|
||||||
double x1, double y1, double x2, double y2,
|
|
||||||
double half_dx, double half_dy )
|
|
||||||
{
|
|
||||||
const double fudge = 0.0001; // (0.0001 degrees =~ 10 meters)
|
|
||||||
|
|
||||||
AreaType area = get_landcover_type( cover,
|
|
||||||
x1 + half_dx, y1 + half_dy,
|
|
||||||
x2 - x1, y2 - y1 );
|
|
||||||
|
|
||||||
if ( area != get_default_area_type() ) {
|
|
||||||
// Create a square polygon and merge it into the list.
|
|
||||||
tgContour contour;
|
|
||||||
|
|
||||||
contour.Erase();
|
|
||||||
contour.AddNode( SGGeod::fromDeg(x1 - fudge, y1 - fudge) );
|
|
||||||
contour.AddNode( SGGeod::fromDeg(x1 - fudge, y2 + fudge) );
|
|
||||||
contour.AddNode( SGGeod::fromDeg(x2 + fudge, y2 + fudge) );
|
|
||||||
contour.AddNode( SGGeod::fromDeg(x2 + fudge, y1 - fudge) );
|
|
||||||
contour.SetHole( false );
|
|
||||||
|
|
||||||
if ( measure_roughness( contour ) < 1.0 ) {
|
|
||||||
// Add this contour to the area accumulator
|
|
||||||
if ( polys[area].Contours() > 0 ) {
|
|
||||||
polys[area] = tgContour::Union( contour, polys[area] );
|
|
||||||
} else {
|
|
||||||
tgPolygon poly;
|
|
||||||
poly.AddContour( contour );
|
|
||||||
polys[area] = poly;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Come up with a "rough" metric for the roughness of the terrain
|
|
||||||
// coverted by a polygon
|
|
||||||
double TGConstruct::measure_roughness( tgContour &contour ) {
|
|
||||||
// find the elevation range
|
|
||||||
double max_z = -9999.0;
|
|
||||||
double min_z = 9999.0;
|
|
||||||
|
|
||||||
for ( unsigned int i = 0; i < contour.GetSize(); i++ ) {
|
|
||||||
double z;
|
|
||||||
z = array.altitude_from_grid( contour[i].getLongitudeDeg() * 3600.0,
|
|
||||||
contour[i].getLatitudeDeg() * 3600.0 );
|
|
||||||
if ( z < -9000 ) {
|
|
||||||
z = array.closest_nonvoid_elev( contour[i].getLongitudeDeg() * 3600.0,
|
|
||||||
contour[i].getLatitudeDeg() * 3600.0 );
|
|
||||||
}
|
|
||||||
|
|
||||||
if ( z < min_z ) {
|
|
||||||
min_z = z;
|
|
||||||
}
|
|
||||||
if ( z > max_z ) {
|
|
||||||
max_z = z;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
double diff = max_z - min_z;
|
|
||||||
|
|
||||||
// 50m difference in polygon elevation range yields a roughness
|
|
||||||
// metric of 1.0. Less than 1.0 is relatively flat. More than
|
|
||||||
// 1.0 is relatively rough.
|
|
||||||
|
|
||||||
SG_LOG(SG_GENERAL, SG_ALERT, "roughness = " << diff / 50.0 );
|
|
||||||
|
|
||||||
return diff / 50.0;
|
|
||||||
}
|
|
||||||
|
|
||||||
AreaType TGConstruct::get_landcover_type (const LandCover &cover, double xpos, double ypos, double dx, double dy)
|
|
||||||
{
|
|
||||||
// Look up the land cover for the square
|
|
||||||
int cover_value = cover.getValue(xpos, ypos);
|
|
||||||
AreaType area = translateUSGSCover(cover_value);
|
|
||||||
|
|
||||||
if ( area != get_default_area_type() ) {
|
|
||||||
// Non-default area is fine.
|
|
||||||
return area;
|
|
||||||
} else {
|
|
||||||
// If we're stuck with the default area, try to borrow from a
|
|
||||||
// neighbour.
|
|
||||||
for (double x = xpos - dx; x <= xpos + dx; x += dx) {
|
|
||||||
for (double y = ypos - dy; y < ypos + dx; y += dy) {
|
|
||||||
if (x != xpos || y != ypos) {
|
|
||||||
cover_value = cover.getValue(x, y);
|
|
||||||
area = translateUSGSCover(cover_value);
|
|
||||||
if (area != get_default_area_type() ) {
|
|
||||||
return area;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// OK, give up and return default
|
|
||||||
return get_default_area_type();
|
|
||||||
}
|
|
||||||
|
|
||||||
#if 0
|
|
||||||
// For each triangle assigned to the "default" area type, see if we
|
|
||||||
// can lookup a better land cover type from the 1km data structure.
|
|
||||||
static void fix_land_cover_assignments( TGConstruct& c ) {
|
|
||||||
SG_LOG(SG_GENERAL, SG_ALERT, "Fixing up default land cover types");
|
|
||||||
// the list of node locations
|
|
||||||
TGTriNodes trinodes = c.get_tri_nodes();
|
|
||||||
point_list geod_nodes = trinodes.get_node_list();
|
|
||||||
|
|
||||||
// the list of triangles (with area type attribute)
|
|
||||||
triele_list tri_elements = c.get_tri_elements();
|
|
||||||
|
|
||||||
// traverse the triangle element groups
|
|
||||||
SG_LOG(SG_GENERAL, SG_ALERT, " Total Nodes = " << geod_nodes.size());
|
|
||||||
SG_LOG(SG_GENERAL, SG_ALERT, " Total triangles = " << tri_elements.size());
|
|
||||||
for ( unsigned int i = 0; i < tri_elements.size(); ++i ) {
|
|
||||||
TGTriEle t = tri_elements[i];
|
|
||||||
if ( t.get_attribute() == get_default_area_type() ) {
|
|
||||||
Point3D p1 = geod_nodes[t.get_n1()];
|
|
||||||
Point3D p2 = geod_nodes[t.get_n2()];
|
|
||||||
Point3D p3 = geod_nodes[t.get_n3()];
|
|
||||||
|
|
||||||
// offset by -quarter_cover_size because that is what we
|
|
||||||
// do for the coverage squares
|
|
||||||
AreaType a1 = get_area_type( c.get_cover(),
|
|
||||||
p1.x() - quarter_cover_size,
|
|
||||||
p1.y() - quarter_cover_size,
|
|
||||||
cover_size, cover_size );
|
|
||||||
AreaType a2 = get_area_type( c.get_cover(),
|
|
||||||
p2.x() - quarter_cover_size,
|
|
||||||
p2.y() - quarter_cover_size,
|
|
||||||
cover_size, cover_size );
|
|
||||||
AreaType a3 = get_area_type( c.get_cover(),
|
|
||||||
p3.x() - quarter_cover_size,
|
|
||||||
p3.y() - quarter_cover_size,
|
|
||||||
cover_size, cover_size );
|
|
||||||
|
|
||||||
// update the original triangle element attribute
|
|
||||||
AreaType new_area;
|
|
||||||
|
|
||||||
// majority rules
|
|
||||||
if ( a1 == a2 ) {
|
|
||||||
new_area = a1;
|
|
||||||
} else if ( a1 == a3 ) {
|
|
||||||
new_area = a1;
|
|
||||||
} else if ( a2 == a3 ) {
|
|
||||||
new_area = a2;
|
|
||||||
} else {
|
|
||||||
// a different coverage for each vertex, just pick
|
|
||||||
// from the middle/average
|
|
||||||
Point3D average = ( p1 + p2 + p3 ) / 3.0;
|
|
||||||
//cout << " average triangle center = " << average;
|
|
||||||
new_area = get_area_type( c.get_cover(),
|
|
||||||
average.x() - quarter_cover_size,
|
|
||||||
average.y() - quarter_cover_size,
|
|
||||||
cover_size, cover_size );
|
|
||||||
}
|
|
||||||
|
|
||||||
//cout << " new attrib = " << get_area_name( new_area ) << endl;
|
|
||||||
c.set_tri_attribute( i, new_area );
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
|
|
||||||
// Generate polygons from land-cover raster. Horizontally- or
|
|
||||||
// vertically-adjacent polygons will be merged automatically.
|
|
||||||
int TGConstruct::load_landcover()
|
|
||||||
{
|
|
||||||
int count = 0;
|
|
||||||
#if 0
|
|
||||||
|
|
||||||
try {
|
|
||||||
|
|
||||||
LandCover cover(get_cover());
|
|
||||||
tgPolygon polys[TG_MAX_AREA_TYPES];
|
|
||||||
tgPolygon poly; // working polygon
|
|
||||||
|
|
||||||
// Get the lower left (SW) corner of the tile
|
|
||||||
double base_lon = bucket.get_center_lon()
|
|
||||||
- 0.5 * bucket.get_width()
|
|
||||||
- quarter_cover_size;
|
|
||||||
double base_lat = bucket.get_center_lat()
|
|
||||||
- 0.5 * bucket.get_height()
|
|
||||||
- quarter_cover_size;
|
|
||||||
|
|
||||||
SG_LOG(SG_GENERAL, SG_ALERT, "raster land cover: tile at " << base_lon << ',' << base_lat);
|
|
||||||
|
|
||||||
double max_lon = bucket.get_center_lon()
|
|
||||||
+ 0.5 * bucket.get_width();
|
|
||||||
double max_lat = bucket.get_center_lat()
|
|
||||||
+ 0.5 * bucket.get_height();
|
|
||||||
|
|
||||||
SG_LOG(SG_GENERAL, SG_ALERT, "raster land cover: extends to " << max_lon << ',' << max_lat);
|
|
||||||
|
|
||||||
double x1 = base_lon;
|
|
||||||
double y1 = base_lat;
|
|
||||||
double x2 = x1 + cover_size;
|
|
||||||
double y2 = y1 + cover_size;
|
|
||||||
|
|
||||||
while ( x1 < max_lon ) {
|
|
||||||
while ( y1 < max_lat ) {
|
|
||||||
make_area( cover, polys, x1, y1, x2, y2, half_cover_size, half_cover_size );
|
|
||||||
|
|
||||||
y1 = y2;
|
|
||||||
y2 += cover_size;
|
|
||||||
}
|
|
||||||
|
|
||||||
x1 = x2;
|
|
||||||
x2 += cover_size;
|
|
||||||
y1 = base_lat;
|
|
||||||
y2 = y1 + cover_size;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Now that we're finished looking up land cover, we have a list
|
|
||||||
// of lists of polygons, one (possibly-empty) list for each area
|
|
||||||
// type. Add the remaining polygons to the clipper.
|
|
||||||
for ( int i = 0; i < TG_MAX_AREA_TYPES; i++ ) {
|
|
||||||
if ( polys[i].contours() ) {
|
|
||||||
// TODO : REMOVE add_poly
|
|
||||||
add_poly( i, polys[i], get_area_name((AreaType)i ));
|
|
||||||
count++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
} catch ( string e ) {
|
|
||||||
SG_LOG(SG_GENERAL, SG_ALERT, "Died with exception: " << e);
|
|
||||||
exit(-1);
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif
|
|
||||||
// Return the number of polygons actually read.
|
|
||||||
return count;
|
|
||||||
}
|
|
||||||
|
|
||||||
#endif
|
|
||||||
Loading…
Reference in a new issue