2002-06-07 21:03:27 +00:00
|
|
|
// navlist.cxx -- navaids management class
|
2000-04-21 04:19:22 +00:00
|
|
|
//
|
|
|
|
// Written by Curtis Olson, started April 2000.
|
|
|
|
//
|
2004-11-19 22:10:41 +00:00
|
|
|
// Copyright (C) 2000 Curtis L. Olson - http://www.flightgear.org/~curt
|
2000-04-21 04:19:22 +00:00
|
|
|
//
|
|
|
|
// 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$
|
|
|
|
|
|
|
|
|
2001-05-15 22:30:39 +00:00
|
|
|
#ifdef HAVE_CONFIG_H
|
|
|
|
# include <config.h>
|
|
|
|
#endif
|
|
|
|
|
2000-04-21 04:19:22 +00:00
|
|
|
#include <simgear/debug/logstream.hxx>
|
2001-03-25 14:20:12 +00:00
|
|
|
#include <simgear/misc/sgstream.hxx>
|
2000-09-27 20:16:22 +00:00
|
|
|
#include <simgear/math/sg_geodesy.hxx>
|
2000-04-21 04:19:22 +00:00
|
|
|
|
2000-04-21 16:03:36 +00:00
|
|
|
#include "navlist.hxx"
|
2000-04-21 04:19:22 +00:00
|
|
|
|
|
|
|
|
|
|
|
// Constructor
|
2000-04-21 16:42:01 +00:00
|
|
|
FGNavList::FGNavList( void ) {
|
2000-04-21 04:19:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Destructor
|
2000-04-21 16:42:01 +00:00
|
|
|
FGNavList::~FGNavList( void ) {
|
2000-04-21 04:19:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// load the navaids and build the map
|
2004-05-28 05:24:54 +00:00
|
|
|
bool FGNavList::init() {
|
2000-04-21 04:19:22 +00:00
|
|
|
|
2004-05-28 05:24:54 +00:00
|
|
|
// FIXME: leaves all the individual navaid entries leaked
|
2000-04-21 04:19:22 +00:00
|
|
|
navaids.erase( navaids.begin(), navaids.end() );
|
2004-05-28 05:24:54 +00:00
|
|
|
navaids_by_tile.erase( navaids_by_tile.begin(), navaids_by_tile.end() );
|
|
|
|
ident_navaids.erase( ident_navaids.begin(), ident_navaids.end() );
|
2000-04-21 04:19:22 +00:00
|
|
|
|
2004-05-28 05:24:54 +00:00
|
|
|
return true;
|
|
|
|
}
|
2000-04-21 04:19:22 +00:00
|
|
|
|
|
|
|
|
2004-05-28 05:24:54 +00:00
|
|
|
// real add a marker beacon
|
|
|
|
static void real_add( nav_map_type &navmap, const int master_index,
|
|
|
|
FGNavRecord *n )
|
|
|
|
{
|
|
|
|
navmap[master_index].push_back( n );
|
|
|
|
}
|
2000-04-21 04:19:22 +00:00
|
|
|
|
|
|
|
|
2004-05-28 05:24:54 +00:00
|
|
|
// front end for add a marker beacon
|
|
|
|
static void tile_add( nav_map_type &navmap, FGNavRecord *n ) {
|
|
|
|
double diff;
|
2002-03-27 12:49:29 +00:00
|
|
|
|
2004-05-28 05:24:54 +00:00
|
|
|
double lon = n->get_lon();
|
|
|
|
double lat = n->get_lat();
|
2002-03-27 12:49:29 +00:00
|
|
|
|
2004-05-28 05:24:54 +00:00
|
|
|
int lonidx = (int)lon;
|
|
|
|
diff = lon - (double)lonidx;
|
|
|
|
if ( (lon < 0.0) && (fabs(diff) > SG_EPSILON) ) {
|
|
|
|
lonidx -= 1;
|
2000-04-21 04:19:22 +00:00
|
|
|
}
|
2004-05-28 05:24:54 +00:00
|
|
|
double lonfrac = lon - (double)lonidx;
|
|
|
|
lonidx += 180;
|
2000-04-21 04:19:22 +00:00
|
|
|
|
2004-05-28 05:24:54 +00:00
|
|
|
int latidx = (int)lat;
|
|
|
|
diff = lat - (double)latidx;
|
|
|
|
if ( (lat < 0.0) && (fabs(diff) > SG_EPSILON) ) {
|
|
|
|
latidx -= 1;
|
|
|
|
}
|
|
|
|
double latfrac = lat - (double)latidx;
|
|
|
|
latidx += 90;
|
|
|
|
|
|
|
|
int master_index = lonidx * 1000 + latidx;
|
|
|
|
// cout << "lonidx = " << lonidx << " latidx = " << latidx << " ";
|
|
|
|
// cout << "Master index = " << master_index << endl;
|
|
|
|
|
|
|
|
// add to the actual bucket
|
|
|
|
real_add( navmap, master_index, n );
|
|
|
|
|
|
|
|
// if we are close to the edge, add to adjacent buckets so we only
|
|
|
|
// have to search one bucket at run time
|
|
|
|
|
|
|
|
// there are 8 cases since there are 8 adjacent tiles
|
|
|
|
|
|
|
|
if ( lonfrac < 0.2 ) {
|
|
|
|
real_add( navmap, master_index - 1000, n );
|
|
|
|
if ( latfrac < 0.2 ) {
|
|
|
|
real_add( navmap, master_index - 1000 - 1, n );
|
|
|
|
} else if ( latfrac > 0.8 ) {
|
|
|
|
real_add( navmap, master_index - 1000 + 1, n );
|
|
|
|
}
|
|
|
|
} else if ( lonfrac > 0.8 ) {
|
|
|
|
real_add( navmap, master_index + 1000, n );
|
|
|
|
if ( latfrac < 0.2 ) {
|
|
|
|
real_add( navmap, master_index + 1000 - 1, n );
|
|
|
|
} else if ( latfrac > 0.8 ) {
|
|
|
|
real_add( navmap, master_index + 1000 + 1, n );
|
|
|
|
}
|
|
|
|
} else if ( latfrac < 0.2 ) {
|
|
|
|
real_add( navmap, master_index - 1, n );
|
|
|
|
} else if ( latfrac > 0.8 ) {
|
|
|
|
real_add( navmap, master_index + 1, n );
|
|
|
|
}
|
|
|
|
}
|
2000-04-25 17:33:13 +00:00
|
|
|
|
2004-05-28 05:24:54 +00:00
|
|
|
|
|
|
|
|
|
|
|
// add an entry to the lists
|
|
|
|
bool FGNavList::add( FGNavRecord *n ) {
|
|
|
|
navaids[n->get_freq()].push_back(n);
|
|
|
|
ident_navaids[n->get_ident()].push_back(n);
|
|
|
|
tile_add( navaids_by_tile, n );
|
2000-04-21 04:19:22 +00:00
|
|
|
return true;
|
|
|
|
}
|
2000-04-21 05:26:24 +00:00
|
|
|
|
|
|
|
|
2003-01-25 20:45:39 +00:00
|
|
|
// Query the database for the specified frequency. It is assumed that
|
|
|
|
// there will be multiple stations with matching frequencies so a
|
|
|
|
// position must be specified. Lon and lat are in degrees, elev is in
|
|
|
|
// meters.
|
2004-05-28 05:24:54 +00:00
|
|
|
FGNavRecord *FGNavList::findByFreq( double freq, double lon, double lat, double elev )
|
2000-04-21 05:26:24 +00:00
|
|
|
{
|
2000-04-24 23:51:56 +00:00
|
|
|
nav_list_type stations = navaids[(int)(freq*100.0 + 0.5)];
|
2000-09-27 20:16:22 +00:00
|
|
|
Point3D aircraft = sgGeodToCart( Point3D(lon, lat, elev) );
|
2003-01-25 20:45:39 +00:00
|
|
|
|
|
|
|
return findNavFromList( aircraft, stations );
|
2002-06-07 21:03:27 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-05-28 05:24:54 +00:00
|
|
|
FGNavRecord *FGNavList::findByIdent( const char* ident,
|
2003-01-25 20:45:39 +00:00
|
|
|
const double lon, const double lat )
|
2002-06-07 21:03:27 +00:00
|
|
|
{
|
|
|
|
nav_list_type stations = ident_navaids[ident];
|
|
|
|
Point3D aircraft = sgGeodToCart( Point3D(lon, lat, 0.0) );
|
2003-01-25 20:45:39 +00:00
|
|
|
|
|
|
|
return findNavFromList( aircraft, stations );
|
2002-06-07 21:03:27 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-01-25 20:45:39 +00:00
|
|
|
// Given an Ident and optional freqency, return the first matching
|
|
|
|
// station.
|
2004-05-28 05:24:54 +00:00
|
|
|
FGNavRecord *FGNavList::findByIdentAndFreq( const char* ident, const double freq )
|
2003-01-05 00:10:36 +00:00
|
|
|
{
|
|
|
|
nav_list_type stations = ident_navaids[ident];
|
|
|
|
|
2003-01-25 20:45:39 +00:00
|
|
|
if ( freq > 0.0 ) {
|
|
|
|
// sometimes there can be duplicated idents. If a freq is
|
|
|
|
// specified, use it to refine the search.
|
2003-01-05 00:10:36 +00:00
|
|
|
int f = (int)(freq*100.0 + 0.5);
|
2003-01-25 20:45:39 +00:00
|
|
|
for ( unsigned int i = 0; i < stations.size(); ++i ) {
|
|
|
|
if ( f == stations[i]->get_freq() ) {
|
|
|
|
return stations[i];
|
2003-01-05 00:10:36 +00:00
|
|
|
}
|
|
|
|
}
|
2005-05-01 14:27:06 +00:00
|
|
|
} else if (stations.size()) {
|
2003-01-25 20:45:39 +00:00
|
|
|
return stations[0];
|
2003-01-05 00:10:36 +00:00
|
|
|
}
|
|
|
|
|
2003-01-25 20:45:39 +00:00
|
|
|
return NULL;
|
2003-01-05 00:10:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-01-25 20:45:39 +00:00
|
|
|
// Given a point and a list of stations, return the closest one to the
|
|
|
|
// specified point.
|
2004-05-28 05:24:54 +00:00
|
|
|
FGNavRecord *FGNavList::findNavFromList( const Point3D &aircraft,
|
|
|
|
const nav_list_type &stations )
|
2002-06-07 21:03:27 +00:00
|
|
|
{
|
2004-05-28 05:24:54 +00:00
|
|
|
FGNavRecord *nav = NULL;
|
2000-05-04 01:18:45 +00:00
|
|
|
Point3D station;
|
2004-07-19 18:02:00 +00:00
|
|
|
double d2; // in meters squared
|
|
|
|
double min_dist
|
|
|
|
= FG_NAV_MAX_RANGE*SG_NM_TO_METER*FG_NAV_MAX_RANGE*SG_NM_TO_METER;
|
2003-01-25 20:45:39 +00:00
|
|
|
|
2004-06-20 18:58:44 +00:00
|
|
|
// find the closest station within a sensible range (FG_NAV_MAX_RANGE)
|
|
|
|
for ( unsigned int i = 0; i < stations.size(); ++i ) {
|
2000-04-21 05:26:24 +00:00
|
|
|
// cout << "testing " << current->get_ident() << endl;
|
2003-02-03 20:05:27 +00:00
|
|
|
station = Point3D( stations[i]->get_x(),
|
|
|
|
stations[i]->get_y(),
|
|
|
|
stations[i]->get_z() );
|
2000-05-04 01:18:45 +00:00
|
|
|
|
2004-07-19 18:02:00 +00:00
|
|
|
d2 = aircraft.distance3Dsquared( station );
|
2000-05-04 01:18:45 +00:00
|
|
|
|
2000-05-14 01:41:11 +00:00
|
|
|
// cout << " dist = " << sqrt(d)
|
2002-06-07 21:03:27 +00:00
|
|
|
// << " range = " << current->get_range() * SG_NM_TO_METER
|
|
|
|
// << endl;
|
2001-03-14 07:25:14 +00:00
|
|
|
|
2004-07-19 18:02:00 +00:00
|
|
|
// LOC, ILS, GS, and DME antenna's could potentially be
|
|
|
|
// installed at the opposite end of the runway. So it's not
|
|
|
|
// enough to simply find the closest antenna with the right
|
|
|
|
// frequency. We need the closest antenna with the right
|
|
|
|
// frequency that is most oriented towards us. (We penalize
|
|
|
|
// stations that are facing away from us by adding 5000 meters
|
|
|
|
// which is further than matching stations would ever be
|
|
|
|
// placed from each other. (Do the expensive check only for
|
|
|
|
// directional atennas and only when there is a chance it is
|
|
|
|
// the closest station.)
|
|
|
|
if ( d2 < min_dist &&
|
|
|
|
(stations[i]->get_type() == 4 || stations[i]->get_type() == 5 ||
|
|
|
|
stations[i]->get_type() == 6 || stations[i]->get_type() == 12) )
|
|
|
|
{
|
|
|
|
double hdg_deg = 0.0;
|
|
|
|
if ( stations[i]->get_type() == 4 || stations[i]->get_type() == 5 ){
|
|
|
|
hdg_deg = stations[i]->get_multiuse();
|
|
|
|
} else if ( stations[i]->get_type() == 6 ) {
|
|
|
|
int tmp = (int)(stations[i]->get_multiuse() / 1000.0);
|
|
|
|
hdg_deg = stations[i]->get_multiuse() - (tmp * 1000);
|
|
|
|
} else if ( stations[i]->get_type() == 12 ) {
|
|
|
|
// oops, Robin's data format doesn't give us the
|
|
|
|
// needed information to compute a heading for a DME
|
|
|
|
// transmitter. FIXME Robin!
|
|
|
|
}
|
|
|
|
|
|
|
|
double az1 = 0.0, az2 = 0.0, s = 0.0;
|
|
|
|
double elev_m = 0.0, lat_rad = 0.0, lon_rad = 0.0;
|
|
|
|
double xyz[3] = { aircraft.x(), aircraft.y(), aircraft.z() };
|
|
|
|
sgCartToGeod( xyz, &lat_rad, &lon_rad, &elev_m );
|
|
|
|
geo_inverse_wgs_84( elev_m,
|
|
|
|
lat_rad * SG_RADIANS_TO_DEGREES,
|
|
|
|
lon_rad * SG_RADIANS_TO_DEGREES,
|
|
|
|
stations[i]->get_lat(), stations[i]->get_lon(),
|
|
|
|
&az1, &az2, &s);
|
|
|
|
az1 = az1 - stations[i]->get_multiuse();
|
|
|
|
if ( az1 > 180.0) az1 -= 360.0;
|
|
|
|
if ( az1 < -180.0) az1 += 360.0;
|
|
|
|
// penalize opposite facing stations by adding 5000 meters
|
|
|
|
// (squared) which is further than matching stations would
|
|
|
|
// ever be placed from each other.
|
|
|
|
if ( fabs(az1) > 90.0 ) {
|
2004-07-20 00:59:17 +00:00
|
|
|
double dist = sqrt(d2);
|
|
|
|
d2 = (dist + 5000) * (dist + 5000);
|
2004-07-19 18:02:00 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( d2 < min_dist ) {
|
|
|
|
min_dist = d2;
|
2003-01-25 20:45:39 +00:00
|
|
|
nav = stations[i];
|
|
|
|
}
|
2000-04-21 05:26:24 +00:00
|
|
|
}
|
|
|
|
|
2003-01-25 20:45:39 +00:00
|
|
|
return nav;
|
2000-04-21 05:26:24 +00:00
|
|
|
}
|
2004-05-28 05:24:54 +00:00
|
|
|
|
|
|
|
|
|
|
|
// returns the closest entry to the give lon/lat/elev
|
|
|
|
FGNavRecord *FGNavList::findClosest( double lon_rad, double lat_rad,
|
|
|
|
double elev_m )
|
|
|
|
{
|
|
|
|
FGNavRecord *result = NULL;
|
|
|
|
double diff;
|
|
|
|
|
|
|
|
double lon_deg = lon_rad * SG_RADIANS_TO_DEGREES;
|
|
|
|
double lat_deg = lat_rad * SG_RADIANS_TO_DEGREES;
|
|
|
|
int lonidx = (int)lon_deg;
|
|
|
|
diff = lon_deg - (double)lonidx;
|
|
|
|
if ( (lon_deg < 0.0) && (fabs(diff) > SG_EPSILON) ) {
|
|
|
|
lonidx -= 1;
|
|
|
|
}
|
|
|
|
lonidx += 180;
|
|
|
|
|
|
|
|
int latidx = (int)lat_deg;
|
|
|
|
diff = lat_deg - (double)latidx;
|
|
|
|
if ( (lat_deg < 0.0) && (fabs(diff) > SG_EPSILON) ) {
|
|
|
|
latidx -= 1;
|
|
|
|
}
|
|
|
|
latidx += 90;
|
|
|
|
|
|
|
|
int master_index = lonidx * 1000 + latidx;
|
|
|
|
|
|
|
|
nav_list_type navs = navaids_by_tile[ master_index ];
|
|
|
|
// cout << "Master index = " << master_index << endl;
|
|
|
|
// cout << "beacon search length = " << beacons.size() << endl;
|
|
|
|
|
|
|
|
nav_list_iterator current = navs.begin();
|
|
|
|
nav_list_iterator last = navs.end();
|
|
|
|
|
|
|
|
Point3D aircraft = sgGeodToCart( Point3D(lon_rad,
|
|
|
|
lat_rad,
|
|
|
|
elev_m) );
|
|
|
|
|
|
|
|
double min_dist = 999999999.0;
|
|
|
|
|
|
|
|
for ( ; current != last ; ++current ) {
|
|
|
|
// cout << " testing " << (*current)->get_ident() << endl;
|
|
|
|
Point3D station = Point3D( (*current)->get_x(),
|
|
|
|
(*current)->get_y(),
|
|
|
|
(*current)->get_z() );
|
|
|
|
// cout << " aircraft = " << aircraft << " station = " << station
|
|
|
|
// << endl;
|
|
|
|
|
|
|
|
double d = aircraft.distance3Dsquared( station ); // meters^2
|
|
|
|
// cout << " distance = " << d << " ("
|
|
|
|
// << FG_ILS_DEFAULT_RANGE * SG_NM_TO_METER
|
|
|
|
// * FG_ILS_DEFAULT_RANGE * SG_NM_TO_METER
|
|
|
|
// << ")" << endl;
|
|
|
|
|
|
|
|
// cout << " range = " << sqrt(d) << endl;
|
|
|
|
|
|
|
|
if ( d < min_dist ) {
|
|
|
|
min_dist = d;
|
|
|
|
result = (*current);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// cout << "lon = " << lon << " lat = " << lat
|
|
|
|
// << " closest beacon = " << sqrt( min_dist ) << endl;
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|