1998-05-20 20:53:53 +00:00
|
|
|
// tilemgr.cxx -- routines to handle dynamic management of scenery tiles
|
|
|
|
//
|
|
|
|
// Written by Curtis Olson, started January 1998.
|
|
|
|
//
|
|
|
|
// Copyright (C) 1997 Curtis L. Olson - curt@infoplane.com
|
|
|
|
//
|
|
|
|
// 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$
|
1998-01-07 23:50:01 +00:00
|
|
|
|
|
|
|
|
1998-04-24 00:51:07 +00:00
|
|
|
#ifdef HAVE_CONFIG_H
|
|
|
|
# include <config.h>
|
|
|
|
#endif
|
1998-04-03 22:09:02 +00:00
|
|
|
|
|
|
|
#ifdef HAVE_WINDOWS_H
|
1998-01-07 23:50:01 +00:00
|
|
|
# include <windows.h>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include <GL/glut.h>
|
1998-01-19 19:26:51 +00:00
|
|
|
#include <XGL/xgl.h>
|
1998-01-07 23:50:01 +00:00
|
|
|
|
1998-10-17 01:33:52 +00:00
|
|
|
#include <Aircraft/aircraft.hxx>
|
1998-05-23 14:09:20 +00:00
|
|
|
|
1998-11-06 21:17:31 +00:00
|
|
|
#include <Debug/logstream.hxx>
|
1999-03-25 19:03:24 +00:00
|
|
|
// #include <Bucket/bucketutils.hxx>
|
1998-01-27 00:47:41 +00:00
|
|
|
#include <Include/fg_constants.h>
|
1998-05-06 03:16:42 +00:00
|
|
|
#include <Main/options.hxx>
|
1998-05-16 13:09:57 +00:00
|
|
|
#include <Main/views.hxx>
|
1998-10-17 01:33:52 +00:00
|
|
|
#include <Math/fg_geodesy.hxx>
|
1998-05-16 13:09:57 +00:00
|
|
|
#include <Math/mat3.h>
|
1998-10-16 00:51:46 +00:00
|
|
|
#include <Math/point3d.hxx>
|
1998-07-08 14:47:20 +00:00
|
|
|
#include <Math/polar3d.hxx>
|
|
|
|
#include <Math/vector.hxx>
|
1999-05-12 04:24:55 +00:00
|
|
|
#include <Objects/materialmgr.hxx>
|
1998-08-25 16:52:38 +00:00
|
|
|
#include <Objects/obj.hxx>
|
1999-08-12 17:13:44 +00:00
|
|
|
|
1999-10-14 20:30:54 +00:00
|
|
|
#ifndef FG_OLD_WEATHER
|
1999-08-12 17:13:44 +00:00
|
|
|
# include <WeatherCM/FGLocalWeatherDatabase.h>
|
|
|
|
#else
|
|
|
|
# include <Weather/weather.hxx>
|
|
|
|
#endif
|
1998-01-07 23:50:01 +00:00
|
|
|
|
1998-06-05 22:39:53 +00:00
|
|
|
#include "scenery.hxx"
|
|
|
|
#include "tilecache.hxx"
|
1999-06-12 21:12:13 +00:00
|
|
|
#include "tileentry.hxx"
|
1998-12-03 01:18:16 +00:00
|
|
|
#include "tilemgr.hxx"
|
1998-06-05 22:39:53 +00:00
|
|
|
|
1998-01-07 23:50:01 +00:00
|
|
|
|
1998-09-08 15:05:10 +00:00
|
|
|
// to test clipping speedup in fgTileMgrRender()
|
|
|
|
#if defined ( USE_FAST_FOV_CLIP )
|
1999-04-27 15:52:32 +00:00
|
|
|
// #define TEST_FOV_CLIP
|
|
|
|
// #define TEST_ELEV
|
1998-09-08 15:05:10 +00:00
|
|
|
#endif
|
|
|
|
|
|
|
|
|
1999-07-04 07:37:30 +00:00
|
|
|
extern ssgRoot *scene;
|
|
|
|
|
|
|
|
|
1999-06-13 05:58:02 +00:00
|
|
|
// the tile manager
|
|
|
|
FGTileMgr global_tile_mgr;
|
1998-01-24 00:03:27 +00:00
|
|
|
|
1999-05-06 21:14:06 +00:00
|
|
|
|
1999-06-13 05:58:02 +00:00
|
|
|
// Constructor
|
|
|
|
FGTileMgr::FGTileMgr ( void ):
|
|
|
|
state( Start )
|
|
|
|
{
|
|
|
|
}
|
1999-05-06 21:14:06 +00:00
|
|
|
|
1998-01-24 00:03:27 +00:00
|
|
|
|
1999-06-13 05:58:02 +00:00
|
|
|
// Destructor
|
|
|
|
FGTileMgr::~FGTileMgr ( void ) {
|
|
|
|
}
|
1999-05-06 21:14:06 +00:00
|
|
|
|
1998-01-07 23:50:01 +00:00
|
|
|
|
1998-05-20 20:53:53 +00:00
|
|
|
// Initialize the Tile Manager subsystem
|
1999-06-13 05:58:02 +00:00
|
|
|
int FGTileMgr::init( void ) {
|
1998-11-06 21:17:31 +00:00
|
|
|
FG_LOG( FG_TERRAIN, FG_INFO, "Initializing Tile Manager subsystem." );
|
1998-06-05 22:39:53 +00:00
|
|
|
|
|
|
|
// load default material library
|
1999-04-27 15:52:32 +00:00
|
|
|
if ( ! material_mgr.loaded() ) {
|
|
|
|
material_mgr.load_lib();
|
|
|
|
}
|
1998-06-05 22:39:53 +00:00
|
|
|
|
1999-08-15 15:35:07 +00:00
|
|
|
global_tile_cache.init();
|
|
|
|
|
1999-06-13 05:58:02 +00:00
|
|
|
state = Inited;
|
1999-05-06 21:14:06 +00:00
|
|
|
|
1998-02-12 21:58:27 +00:00
|
|
|
return 1;
|
1998-01-07 23:50:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-06-13 05:58:02 +00:00
|
|
|
// schedule a tile for loading
|
1999-07-04 07:37:30 +00:00
|
|
|
static void disable_tile( int cache_index ) {
|
|
|
|
// see if tile already exists in the cache
|
1999-08-14 22:07:35 +00:00
|
|
|
// cout << "DISABLING CACHE ENTRY = " << cache_index << endl;
|
1999-07-04 07:37:30 +00:00
|
|
|
FGTileEntry *t = global_tile_cache.get_tile( cache_index );
|
|
|
|
t->ssg_disable();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// schedule a tile for loading
|
|
|
|
int FGTileMgr::sched_tile( const FGBucket& b ) {
|
1999-06-13 05:58:02 +00:00
|
|
|
// see if tile already exists in the cache
|
1999-07-04 07:37:30 +00:00
|
|
|
int cache_index = global_tile_cache.exists( b );
|
|
|
|
|
|
|
|
if ( cache_index >= 0 ) {
|
|
|
|
// tile exists in cache, reenable it.
|
1999-08-14 22:07:35 +00:00
|
|
|
// cout << "REENABLING DISABLED TILE" << endl;
|
1999-07-04 07:37:30 +00:00
|
|
|
FGTileEntry *t = global_tile_cache.get_tile( cache_index );
|
|
|
|
t->select_ptr->select( 1 );
|
|
|
|
t->mark_loaded();
|
|
|
|
} else {
|
|
|
|
// find the next available cache entry and mark it as
|
|
|
|
// scheduled
|
|
|
|
cache_index = global_tile_cache.next_avail();
|
|
|
|
FGTileEntry *t = global_tile_cache.get_tile( cache_index );
|
|
|
|
t->mark_scheduled_for_use();
|
1999-06-13 05:58:02 +00:00
|
|
|
|
|
|
|
// register a load request
|
|
|
|
FGLoadRec request;
|
|
|
|
request.b = b;
|
1999-07-04 07:37:30 +00:00
|
|
|
request.cache_index = cache_index;
|
1999-06-13 05:58:02 +00:00
|
|
|
load_queue.push_back( request );
|
|
|
|
}
|
1999-07-04 07:37:30 +00:00
|
|
|
|
|
|
|
return cache_index;
|
1999-06-13 05:58:02 +00:00
|
|
|
}
|
1998-05-20 20:53:53 +00:00
|
|
|
|
|
|
|
|
1999-06-13 05:58:02 +00:00
|
|
|
// load a tile
|
|
|
|
void FGTileMgr::load_tile( const FGBucket& b, int cache_index) {
|
|
|
|
|
|
|
|
FG_LOG( FG_TERRAIN, FG_DEBUG, "Loading tile " << b );
|
1998-01-26 15:55:24 +00:00
|
|
|
|
1999-06-13 05:58:02 +00:00
|
|
|
global_tile_cache.fill_in(cache_index, b);
|
1998-01-29 00:51:38 +00:00
|
|
|
|
1999-06-13 05:58:02 +00:00
|
|
|
FG_LOG( FG_TERRAIN, FG_DEBUG, "Loaded for cache index: " << cache_index );
|
1998-01-26 15:55:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
1998-12-03 01:18:16 +00:00
|
|
|
// Calculate shortest distance from point to line
|
|
|
|
static double point_line_dist_squared( const Point3D& tc, const Point3D& vp,
|
|
|
|
MAT3vec d )
|
|
|
|
{
|
|
|
|
MAT3vec p, p0;
|
|
|
|
|
|
|
|
p[0] = tc.x(); p[1] = tc.y(); p[2] = tc.z();
|
|
|
|
p0[0] = vp.x(); p0[1] = vp.y(); p0[2] = vp.z();
|
|
|
|
|
1999-03-25 19:03:24 +00:00
|
|
|
return fgPointLineSquared(p, p0, d);
|
1998-12-03 01:18:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Determine scenery altitude. Normally this just happens when we
|
|
|
|
// render the scene, but we'd also like to be able to do this
|
|
|
|
// explicitely. lat & lon are in radians. abs_view_pos in meters.
|
|
|
|
// Returns result in meters.
|
|
|
|
double
|
1999-06-13 05:58:02 +00:00
|
|
|
FGTileMgr::current_elev_new( const FGBucket& p ) {
|
1999-06-12 21:12:13 +00:00
|
|
|
FGTileEntry *t;
|
1998-12-03 01:18:16 +00:00
|
|
|
fgFRAGMENT *frag_ptr;
|
1998-12-09 18:50:12 +00:00
|
|
|
Point3D abs_view_pos = current_view.get_abs_view_pos();
|
1998-12-03 01:18:16 +00:00
|
|
|
Point3D earth_center(0.0);
|
|
|
|
Point3D result;
|
|
|
|
MAT3vec local_up;
|
|
|
|
double dist, lat_geod, alt, sea_level_r;
|
|
|
|
int index;
|
|
|
|
|
|
|
|
local_up[0] = abs_view_pos.x();
|
|
|
|
local_up[1] = abs_view_pos.y();
|
|
|
|
local_up[2] = abs_view_pos.z();
|
|
|
|
|
|
|
|
// Find current translation offset
|
|
|
|
// fgBucketFind(lon * RAD_TO_DEG, lat * RAD_TO_DEG, &p);
|
|
|
|
index = global_tile_cache.exists(p);
|
|
|
|
if ( index < 0 ) {
|
|
|
|
FG_LOG( FG_TERRAIN, FG_WARN, "Tile not found" );
|
|
|
|
return 0.0;
|
|
|
|
}
|
|
|
|
|
|
|
|
t = global_tile_cache.get_tile(index);
|
|
|
|
|
|
|
|
scenery.next_center = t->center;
|
|
|
|
|
|
|
|
FG_LOG( FG_TERRAIN, FG_DEBUG,
|
1999-03-25 19:03:24 +00:00
|
|
|
"Current bucket = " << p << " Index = " << p.gen_index_str() );
|
1998-12-05 14:20:21 +00:00
|
|
|
FG_LOG( FG_TERRAIN, FG_DEBUG,
|
|
|
|
"abs_view_pos = " << abs_view_pos );
|
1998-12-03 01:18:16 +00:00
|
|
|
|
|
|
|
// calculate tile offset
|
|
|
|
// x = (t->offset.x = t->center.x - scenery.center.x);
|
|
|
|
// y = (t->offset.y = t->center.y - scenery.center.y);
|
|
|
|
// z = (t->offset.z = t->center.z - scenery.center.z);
|
|
|
|
|
|
|
|
// calc current terrain elevation calculate distance from
|
|
|
|
// vertical tangent line at current position to center of
|
|
|
|
// tile.
|
|
|
|
|
|
|
|
/* printf("distance squared = %.2f, bounding radius = %.2f\n",
|
|
|
|
point_line_dist_squared(&(t->offset), &(v->view_pos),
|
|
|
|
v->local_up), t->bounding_radius); */
|
|
|
|
|
|
|
|
dist = point_line_dist_squared( t->center, abs_view_pos, local_up );
|
|
|
|
if ( dist < FG_SQUARE(t->bounding_radius) ) {
|
|
|
|
|
|
|
|
// traverse fragment list for tile
|
1999-06-12 21:12:13 +00:00
|
|
|
FGTileEntry::FragmentIterator current = t->begin();
|
|
|
|
FGTileEntry::FragmentIterator last = t->end();
|
1998-12-03 01:18:16 +00:00
|
|
|
|
|
|
|
for ( ; current != last; ++current ) {
|
|
|
|
frag_ptr = &(*current);
|
|
|
|
/* printf("distance squared = %.2f, bounding radius = %.2f\n",
|
|
|
|
point_line_dist_squared( &(frag_ptr->center),
|
|
|
|
&abs_view_pos), local_up),
|
|
|
|
frag_ptr->bounding_radius); */
|
|
|
|
|
|
|
|
dist = point_line_dist_squared( frag_ptr->center,
|
|
|
|
abs_view_pos,
|
|
|
|
local_up);
|
|
|
|
if ( dist <= FG_SQUARE(frag_ptr->bounding_radius) ) {
|
|
|
|
if ( frag_ptr->intersect( abs_view_pos,
|
|
|
|
earth_center, 0, result ) ) {
|
|
|
|
FG_LOG( FG_TERRAIN, FG_DEBUG, "intersection point " <<
|
|
|
|
result );
|
|
|
|
// compute geocentric coordinates of tile center
|
|
|
|
Point3D pp = fgCartToPolar3d(result);
|
|
|
|
FG_LOG( FG_TERRAIN, FG_DEBUG, " polar form = " << pp );
|
|
|
|
// convert to geodetic coordinates
|
|
|
|
fgGeocToGeod(pp.lat(), pp.radius(), &lat_geod,
|
|
|
|
&alt, &sea_level_r);
|
|
|
|
|
|
|
|
// printf("alt = %.2f\n", alt);
|
|
|
|
// exit since we found an intersection
|
|
|
|
if ( alt > -9999.0 ) {
|
|
|
|
// printf("returning alt\n");
|
|
|
|
return alt;
|
|
|
|
} else {
|
|
|
|
// printf("returning 0\n");
|
|
|
|
return 0.0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1999-01-27 04:49:48 +00:00
|
|
|
FG_LOG( FG_TERRAIN, FG_INFO, "(new) no terrain intersection found" );
|
|
|
|
|
1998-12-03 01:18:16 +00:00
|
|
|
return 0.0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Determine scenery altitude. Normally this just happens when we
|
|
|
|
// render the scene, but we'd also like to be able to do this
|
|
|
|
// explicitely. lat & lon are in radians. abs_view_pos in meters.
|
|
|
|
// Returns result in meters.
|
|
|
|
double
|
1999-06-13 05:58:02 +00:00
|
|
|
FGTileMgr::current_elev( double lon, double lat, const Point3D& abs_view_pos ) {
|
1999-06-12 21:12:13 +00:00
|
|
|
FGTileCache *c;
|
|
|
|
FGTileEntry *t;
|
1998-12-03 01:18:16 +00:00
|
|
|
fgFRAGMENT *frag_ptr;
|
|
|
|
Point3D earth_center(0.0);
|
|
|
|
Point3D result;
|
|
|
|
MAT3vec local_up;
|
|
|
|
double dist, lat_geod, alt, sea_level_r;
|
|
|
|
int index;
|
|
|
|
|
|
|
|
c = &global_tile_cache;
|
|
|
|
|
|
|
|
local_up[0] = abs_view_pos.x();
|
|
|
|
local_up[1] = abs_view_pos.y();
|
|
|
|
local_up[2] = abs_view_pos.z();
|
|
|
|
|
1999-01-27 04:49:48 +00:00
|
|
|
FG_LOG( FG_TERRAIN, FG_DEBUG, "Absolute view pos = " << abs_view_pos );
|
|
|
|
|
1998-12-03 01:18:16 +00:00
|
|
|
// Find current translation offset
|
1999-03-25 19:03:24 +00:00
|
|
|
FGBucket p( lon * RAD_TO_DEG, lat * RAD_TO_DEG );
|
1998-12-03 01:18:16 +00:00
|
|
|
index = c->exists(p);
|
|
|
|
if ( index < 0 ) {
|
|
|
|
FG_LOG( FG_TERRAIN, FG_WARN, "Tile not found" );
|
|
|
|
return 0.0;
|
|
|
|
}
|
|
|
|
|
|
|
|
t = c->get_tile(index);
|
|
|
|
|
|
|
|
scenery.next_center = t->center;
|
|
|
|
|
|
|
|
FG_LOG( FG_TERRAIN, FG_DEBUG,
|
|
|
|
"Pos = (" << lon * RAD_TO_DEG << ", " << lat * RAD_TO_DEG
|
|
|
|
<< ") Current bucket = " << p
|
1999-03-25 19:03:24 +00:00
|
|
|
<< " Index = " << p.gen_index_str() );
|
|
|
|
|
|
|
|
FG_LOG( FG_TERRAIN, FG_DEBUG, "Tile center " << t->center
|
|
|
|
<< " bounding radius = " << t->bounding_radius );
|
1998-12-03 01:18:16 +00:00
|
|
|
|
|
|
|
// calculate tile offset
|
|
|
|
// x = (t->offset.x = t->center.x - scenery.center.x);
|
|
|
|
// y = (t->offset.y = t->center.y - scenery.center.y);
|
|
|
|
// z = (t->offset.z = t->center.z - scenery.center.z);
|
|
|
|
|
|
|
|
// calc current terrain elevation calculate distance from
|
|
|
|
// vertical tangent line at current position to center of
|
|
|
|
// tile.
|
|
|
|
|
|
|
|
/* printf("distance squared = %.2f, bounding radius = %.2f\n",
|
|
|
|
point_line_dist_squared(&(t->offset), &(v->view_pos),
|
|
|
|
v->local_up), t->bounding_radius); */
|
|
|
|
|
|
|
|
dist = point_line_dist_squared( t->center, abs_view_pos, local_up );
|
1999-03-25 19:03:24 +00:00
|
|
|
FG_LOG( FG_TERRAIN, FG_DEBUG, "(gross check) dist squared = " << dist );
|
|
|
|
|
1998-12-03 01:18:16 +00:00
|
|
|
if ( dist < FG_SQUARE(t->bounding_radius) ) {
|
|
|
|
|
|
|
|
// traverse fragment list for tile
|
1999-06-12 21:12:13 +00:00
|
|
|
FGTileEntry::FragmentIterator current = t->begin();
|
|
|
|
FGTileEntry::FragmentIterator last = t->end();
|
1998-12-03 01:18:16 +00:00
|
|
|
|
|
|
|
for ( ; current != last; ++current ) {
|
|
|
|
frag_ptr = &(*current);
|
|
|
|
/* printf("distance squared = %.2f, bounding radius = %.2f\n",
|
|
|
|
point_line_dist_squared( &(frag_ptr->center),
|
|
|
|
&abs_view_pos), local_up),
|
|
|
|
frag_ptr->bounding_radius); */
|
|
|
|
|
|
|
|
dist = point_line_dist_squared( frag_ptr->center,
|
|
|
|
abs_view_pos,
|
|
|
|
local_up);
|
|
|
|
if ( dist <= FG_SQUARE(frag_ptr->bounding_radius) ) {
|
|
|
|
if ( frag_ptr->intersect( abs_view_pos,
|
|
|
|
earth_center, 0, result ) ) {
|
|
|
|
FG_LOG( FG_TERRAIN, FG_DEBUG, "intersection point " <<
|
|
|
|
result );
|
|
|
|
// compute geocentric coordinates of tile center
|
|
|
|
Point3D pp = fgCartToPolar3d(result);
|
|
|
|
FG_LOG( FG_TERRAIN, FG_DEBUG, " polar form = " << pp );
|
|
|
|
// convert to geodetic coordinates
|
|
|
|
fgGeocToGeod(pp.lat(), pp.radius(), &lat_geod,
|
|
|
|
&alt, &sea_level_r);
|
|
|
|
|
|
|
|
// printf("alt = %.2f\n", alt);
|
|
|
|
// exit since we found an intersection
|
|
|
|
if ( alt > -9999.0 ) {
|
|
|
|
// printf("returning alt\n");
|
|
|
|
return alt;
|
|
|
|
} else {
|
|
|
|
// printf("returning 0\n");
|
|
|
|
return 0.0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1999-01-27 04:49:48 +00:00
|
|
|
FG_LOG( FG_TERRAIN, FG_INFO, "(old) no terrain intersection found" );
|
|
|
|
|
1998-12-03 01:18:16 +00:00
|
|
|
return 0.0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-11-03 21:01:59 +00:00
|
|
|
inline int fg_sign( const double x ) {
|
|
|
|
return x < 0 ? -1 : 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline double fg_min( const double a, const double b ) {
|
|
|
|
return b < a ? b : a;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline double fg_max( const double a, const double b ) {
|
|
|
|
return a < b ? b : a;
|
|
|
|
}
|
|
|
|
|
|
|
|
// return the minimum of the three values
|
|
|
|
inline double fg_min3( const double a, const double b, const double c ) {
|
|
|
|
return a > b ? fg_min(b, c) : fg_min(a, c);
|
|
|
|
}
|
|
|
|
|
|
|
|
// return the maximum of the three values
|
|
|
|
inline double fg_max3 (const double a, const double b, const double c ) {
|
|
|
|
return a < b ? fg_max(b, c) : fg_max(a, c);
|
|
|
|
}
|
|
|
|
|
|
|
|
// check for an instersection with the individual triangles of a leaf
|
1999-11-04 22:55:00 +00:00
|
|
|
static bool my_ssg_instersect_leaf( string s, ssgLeaf *leaf, sgdMat4 m,
|
|
|
|
const sgdVec3 p, const sgdVec3 dir,
|
|
|
|
sgdVec3 result )
|
1999-11-03 21:01:59 +00:00
|
|
|
{
|
1999-11-04 22:55:00 +00:00
|
|
|
sgdVec3 v1, v2, n;
|
|
|
|
sgdVec3 p1, p2, p3;
|
1999-11-03 21:01:59 +00:00
|
|
|
double x, y, z; // temporary holding spot for result
|
|
|
|
double a, b, c, d;
|
|
|
|
double x0, y0, z0, x1, y1, z1, a1, b1, c1;
|
|
|
|
double t1, t2, t3;
|
|
|
|
double xmin, xmax, ymin, ymax, zmin, zmax;
|
|
|
|
double dx, dy, dz, min_dim, x2, y2, x3, y3, rx, ry;
|
1999-11-04 22:55:00 +00:00
|
|
|
sgdVec3 tmp;
|
|
|
|
float *ftmp;
|
1999-11-03 21:01:59 +00:00
|
|
|
int side1, side2;
|
|
|
|
short i1, i2, i3;
|
|
|
|
|
1999-11-04 00:41:23 +00:00
|
|
|
// cout << s << "Intersecting" << endl;
|
1999-11-03 21:01:59 +00:00
|
|
|
|
|
|
|
// traverse the triangle list for this leaf
|
|
|
|
for ( int i = 0; i < leaf->getNumTriangles(); ++i ) {
|
1999-11-03 23:50:15 +00:00
|
|
|
// cout << s << "testing triangle = " << i << endl;
|
1999-11-03 21:01:59 +00:00
|
|
|
|
|
|
|
leaf->getTriangle( i, &i1, &i2, &i3 );
|
|
|
|
|
|
|
|
// get triangle vertex coordinates
|
|
|
|
|
1999-11-04 22:55:00 +00:00
|
|
|
ftmp = leaf->getVertex( i1 );
|
|
|
|
sgdSetVec3( tmp, ftmp );
|
1999-11-03 23:50:15 +00:00
|
|
|
// cout << s << "orig point 1 = " << tmp[0] << " " << tmp[1]
|
|
|
|
// << " " << tmp[2] << endl;
|
1999-11-04 22:55:00 +00:00
|
|
|
sgdXformPnt3( p1, tmp, m ) ;
|
1999-11-03 21:01:59 +00:00
|
|
|
|
1999-11-04 22:55:00 +00:00
|
|
|
ftmp = leaf->getVertex( i2 );
|
|
|
|
sgdSetVec3( tmp, ftmp );
|
1999-11-03 23:50:15 +00:00
|
|
|
// cout << s << "orig point 2 = " << tmp[0] << " " << tmp[1]
|
|
|
|
// << " " << tmp[2] << endl;
|
1999-11-04 22:55:00 +00:00
|
|
|
sgdXformPnt3( p2, tmp, m ) ;
|
1999-11-03 21:01:59 +00:00
|
|
|
|
1999-11-04 22:55:00 +00:00
|
|
|
ftmp = leaf->getVertex( i3 );
|
|
|
|
sgdSetVec3( tmp, ftmp );
|
1999-11-03 23:50:15 +00:00
|
|
|
// cout << s << "orig point 3 = " << tmp[0] << " " << tmp[1]
|
|
|
|
// << " " << tmp[2] << endl;
|
1999-11-04 22:55:00 +00:00
|
|
|
sgdXformPnt3( p3, tmp, m ) ;
|
1999-11-03 21:01:59 +00:00
|
|
|
|
1999-11-03 23:50:15 +00:00
|
|
|
// cout << s << "point 1 = " << p1[0] << " " << p1[1] << " " << p1[2]
|
|
|
|
// << endl;
|
|
|
|
// cout << s << "point 2 = " << p2[0] << " " << p2[1] << " " << p2[2]
|
|
|
|
// << endl;
|
|
|
|
// cout << s << "point 3 = " << p3[0] << " " << p3[1] << " " << p3[2]
|
|
|
|
// << endl;
|
1999-11-03 21:01:59 +00:00
|
|
|
|
|
|
|
// calculate two edge vectors, and the face normal
|
1999-11-04 22:55:00 +00:00
|
|
|
sgdSubVec3(v1, p2, p1);
|
|
|
|
sgdSubVec3(v2, p3, p1);
|
|
|
|
sgdVectorProductVec3(n, v1, v2);
|
1999-11-03 21:01:59 +00:00
|
|
|
|
|
|
|
// calculate the plane coefficients for the plane defined by
|
|
|
|
// this face. If n is the normal vector, n = (a, b, c) and p1
|
|
|
|
// is a point on the plane, p1 = (x0, y0, z0), then the
|
|
|
|
// equation of the line is a(x-x0) + b(y-y0) + c(z-z0) = 0
|
|
|
|
a = n[0];
|
|
|
|
b = n[1];
|
|
|
|
c = n[2];
|
|
|
|
d = a * p1[0] + b * p1[1] + c * p1[2];
|
|
|
|
// printf("a, b, c, d = %.2f %.2f %.2f %.2f\n", a, b, c, d);
|
|
|
|
|
|
|
|
// printf("p1(d) = %.2f\n", a * p1[0] + b * p1[1] + c * p1[2]);
|
|
|
|
// printf("p2(d) = %.2f\n", a * p2[0] + b * p2[1] + c * p2[2]);
|
|
|
|
// printf("p3(d) = %.2f\n", a * p3[0] + b * p3[1] + c * p3[2]);
|
|
|
|
|
|
|
|
// calculate the line coefficients for the specified line
|
|
|
|
x0 = p[0]; x1 = p[0] + dir[0];
|
|
|
|
y0 = p[1]; y1 = p[1] + dir[1];
|
|
|
|
z0 = p[2]; z1 = p[2] + dir[2];
|
|
|
|
|
|
|
|
if ( fabs(x1 - x0) > FG_EPSILON ) {
|
|
|
|
a1 = 1.0 / (x1 - x0);
|
|
|
|
} else {
|
|
|
|
// we got a big divide by zero problem here
|
|
|
|
a1 = 0.0;
|
|
|
|
}
|
|
|
|
b1 = y1 - y0;
|
|
|
|
c1 = z1 - z0;
|
|
|
|
|
|
|
|
// intersect the specified line with this plane
|
|
|
|
t1 = b * b1 * a1;
|
|
|
|
t2 = c * c1 * a1;
|
|
|
|
|
|
|
|
// printf("a = %.2f t1 = %.2f t2 = %.2f\n", a, t1, t2);
|
|
|
|
|
|
|
|
if ( fabs(a + t1 + t2) > FG_EPSILON ) {
|
|
|
|
x = (t1*x0 - b*y0 + t2*x0 - c*z0 + d) / (a + t1 + t2);
|
|
|
|
t3 = a1 * (x - x0);
|
|
|
|
y = b1 * t3 + y0;
|
|
|
|
z = c1 * t3 + z0;
|
|
|
|
// printf("result(d) = %.2f\n", a * x + b * y + c * z);
|
|
|
|
} else {
|
|
|
|
// no intersection point
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
#if 0
|
|
|
|
if ( side_flag ) {
|
|
|
|
// check to see if end0 and end1 are on opposite sides of
|
|
|
|
// plane
|
|
|
|
if ( (x - x0) > FG_EPSILON ) {
|
|
|
|
t1 = x;
|
|
|
|
t2 = x0;
|
|
|
|
t3 = x1;
|
|
|
|
} else if ( (y - y0) > FG_EPSILON ) {
|
|
|
|
t1 = y;
|
|
|
|
t2 = y0;
|
|
|
|
t3 = y1;
|
|
|
|
} else if ( (z - z0) > FG_EPSILON ) {
|
|
|
|
t1 = z;
|
|
|
|
t2 = z0;
|
|
|
|
t3 = z1;
|
|
|
|
} else {
|
|
|
|
// everything is too close together to tell the difference
|
|
|
|
// so the current intersection point should work as good
|
|
|
|
// as any
|
1999-11-04 22:55:00 +00:00
|
|
|
sgdSetVec3( result, x, y, z );
|
1999-11-03 21:01:59 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
side1 = fg_sign (t1 - t2);
|
|
|
|
side2 = fg_sign (t1 - t3);
|
|
|
|
if ( side1 == side2 ) {
|
|
|
|
// same side, punt
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
// check to see if intersection point is in the bounding
|
|
|
|
// cube of the face
|
|
|
|
#ifdef XTRA_DEBUG_STUFF
|
|
|
|
xmin = fg_min3 (p1[0], p2[0], p3[0]);
|
|
|
|
xmax = fg_max3 (p1[0], p2[0], p3[0]);
|
|
|
|
ymin = fg_min3 (p1[1], p2[1], p3[1]);
|
|
|
|
ymax = fg_max3 (p1[1], p2[1], p3[1]);
|
|
|
|
zmin = fg_min3 (p1[2], p2[2], p3[2]);
|
|
|
|
zmax = fg_max3 (p1[2], p2[2], p3[2]);
|
|
|
|
printf("bounding cube = %.2f,%.2f,%.2f %.2f,%.2f,%.2f\n",
|
|
|
|
xmin, ymin, zmin, xmax, ymax, zmax);
|
|
|
|
#endif
|
|
|
|
// punt if outside bouding cube
|
|
|
|
if ( x < (xmin = fg_min3 (p1[0], p2[0], p3[0])) ) {
|
|
|
|
continue;
|
|
|
|
} else if ( x > (xmax = fg_max3 (p1[0], p2[0], p3[0])) ) {
|
|
|
|
continue;
|
|
|
|
} else if ( y < (ymin = fg_min3 (p1[1], p2[1], p3[1])) ) {
|
|
|
|
continue;
|
|
|
|
} else if ( y > (ymax = fg_max3 (p1[1], p2[1], p3[1])) ) {
|
|
|
|
continue;
|
|
|
|
} else if ( z < (zmin = fg_min3 (p1[2], p2[2], p3[2])) ) {
|
|
|
|
continue;
|
|
|
|
} else if ( z > (zmax = fg_max3 (p1[2], p2[2], p3[2])) ) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// (finally) check to see if the intersection point is
|
|
|
|
// actually inside this face
|
|
|
|
|
|
|
|
//first, drop the smallest dimension so we only have to work
|
|
|
|
//in 2d.
|
|
|
|
dx = xmax - xmin;
|
|
|
|
dy = ymax - ymin;
|
|
|
|
dz = zmax - zmin;
|
|
|
|
min_dim = fg_min3 (dx, dy, dz);
|
|
|
|
if ( fabs(min_dim - dx) <= FG_EPSILON ) {
|
|
|
|
// x is the smallest dimension
|
|
|
|
x1 = p1[1];
|
|
|
|
y1 = p1[2];
|
|
|
|
x2 = p2[1];
|
|
|
|
y2 = p2[2];
|
|
|
|
x3 = p3[1];
|
|
|
|
y3 = p3[2];
|
|
|
|
rx = y;
|
|
|
|
ry = z;
|
|
|
|
} else if ( fabs(min_dim - dy) <= FG_EPSILON ) {
|
|
|
|
// y is the smallest dimension
|
|
|
|
x1 = p1[0];
|
|
|
|
y1 = p1[2];
|
|
|
|
x2 = p2[0];
|
|
|
|
y2 = p2[2];
|
|
|
|
x3 = p3[0];
|
|
|
|
y3 = p3[2];
|
|
|
|
rx = x;
|
|
|
|
ry = z;
|
|
|
|
} else if ( fabs(min_dim - dz) <= FG_EPSILON ) {
|
|
|
|
// z is the smallest dimension
|
|
|
|
x1 = p1[0];
|
|
|
|
y1 = p1[1];
|
|
|
|
x2 = p2[0];
|
|
|
|
y2 = p2[1];
|
|
|
|
x3 = p3[0];
|
|
|
|
y3 = p3[1];
|
|
|
|
rx = x;
|
|
|
|
ry = y;
|
|
|
|
} else {
|
|
|
|
// all dimensions are really small so lets call it close
|
|
|
|
// enough and return a successful match
|
1999-11-04 22:55:00 +00:00
|
|
|
sgdSetVec3( result, x, y, z );
|
1999-11-03 21:01:59 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// check if intersection point is on the same side of p1 <-> p2 as p3
|
|
|
|
t1 = (y1 - y2) / (x1 - x2);
|
|
|
|
side1 = fg_sign (t1 * ((x3) - x2) + y2 - (y3));
|
|
|
|
side2 = fg_sign (t1 * ((rx) - x2) + y2 - (ry));
|
|
|
|
if ( side1 != side2 ) {
|
|
|
|
// printf("failed side 1 check\n");
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// check if intersection point is on correct side of p2 <-> p3 as p1
|
|
|
|
t1 = (y2 - y3) / (x2 - x3);
|
|
|
|
side1 = fg_sign (t1 * ((x1) - x3) + y3 - (y1));
|
|
|
|
side2 = fg_sign (t1 * ((rx) - x3) + y3 - (ry));
|
|
|
|
if ( side1 != side2 ) {
|
|
|
|
// printf("failed side 2 check\n");
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// check if intersection point is on correct side of p1 <-> p3 as p2
|
|
|
|
t1 = (y1 - y3) / (x1 - x3);
|
|
|
|
side1 = fg_sign (t1 * ((x2) - x3) + y3 - (y2));
|
|
|
|
side2 = fg_sign (t1 * ((rx) - x3) + y3 - (ry));
|
|
|
|
if ( side1 != side2 ) {
|
|
|
|
// printf("failed side 3 check\n");
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// printf( "intersection point = %.2f %.2f %.2f\n", x, y, z);
|
1999-11-04 22:55:00 +00:00
|
|
|
sgdSetVec3( result, x, y, z );
|
1999-11-03 21:01:59 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// printf("\n");
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-11-04 22:55:00 +00:00
|
|
|
void FGTileMgr::my_ssg_los( string s, ssgBranch *branch, sgdMat4 m,
|
|
|
|
const sgdVec3 p, const sgdVec3 dir )
|
1999-11-03 21:01:59 +00:00
|
|
|
{
|
|
|
|
sgSphere *bsphere;
|
|
|
|
for ( ssgEntity *kid = branch->getKid( 0 );
|
|
|
|
kid != NULL;
|
|
|
|
kid = branch->getNextKid() )
|
|
|
|
{
|
|
|
|
if ( kid->getTraversalMask() & SSGTRAV_HOT ) {
|
|
|
|
bsphere = kid->getBSphere();
|
1999-11-04 22:55:00 +00:00
|
|
|
sgVec3 fcenter;
|
|
|
|
sgCopyVec3( fcenter, bsphere->getCenter() );
|
|
|
|
sgdVec3 center;
|
|
|
|
center[0] = fcenter[0];
|
|
|
|
center[1] = fcenter[1];
|
|
|
|
center[2] = fcenter[2];
|
|
|
|
sgdXformPnt3( center, m ) ;
|
1999-11-03 23:50:15 +00:00
|
|
|
// cout << s << "entity bounding sphere:" << endl;
|
|
|
|
// cout << s << "center = " << center[0] << " "
|
1999-11-04 00:41:23 +00:00
|
|
|
// << center[1] << " " << center[2] << endl;
|
1999-11-03 23:50:15 +00:00
|
|
|
// cout << s << "radius = " << bsphere->getRadius() << endl;
|
1999-11-03 21:01:59 +00:00
|
|
|
double radius_sqd = bsphere->getRadius() * bsphere->getRadius();
|
1999-11-04 22:55:00 +00:00
|
|
|
if ( sgdPointLineDistSquared( center, p, dir ) < radius_sqd ) {
|
1999-11-03 21:01:59 +00:00
|
|
|
// possible intersections
|
|
|
|
if ( kid->isAKindOf ( ssgTypeBranch() ) ) {
|
1999-11-04 22:55:00 +00:00
|
|
|
sgdMat4 m_new;
|
|
|
|
sgdCopyMat4(m_new, m);
|
1999-11-03 21:01:59 +00:00
|
|
|
if ( kid->isA( ssgTypeTransform() ) ) {
|
1999-11-04 22:55:00 +00:00
|
|
|
sgMat4 fxform;
|
|
|
|
((ssgTransform *)kid)->getTransform( fxform );
|
|
|
|
sgdMat4 xform;
|
|
|
|
sgdSetMat4( xform, fxform );
|
|
|
|
sgdPreMultMat4( m_new, xform );
|
1999-11-03 21:01:59 +00:00
|
|
|
}
|
|
|
|
my_ssg_los( s + " ", (ssgBranch *)kid, m_new, p, dir );
|
|
|
|
} else if ( kid->isAKindOf ( ssgTypeLeaf() ) ) {
|
1999-11-04 22:55:00 +00:00
|
|
|
sgdVec3 result;
|
1999-11-03 21:01:59 +00:00
|
|
|
if ( my_ssg_instersect_leaf( s, (ssgLeaf *)kid, m, p, dir,
|
|
|
|
result ) )
|
1999-11-04 00:41:23 +00:00
|
|
|
{
|
1999-11-04 22:55:00 +00:00
|
|
|
// cout << "sgLOS hit: " << result[0] << ","
|
|
|
|
// << result[1] << "," << result[2] << endl;
|
2000-02-10 23:37:56 +00:00
|
|
|
for (int i=0; i < 3; i++) {
|
|
|
|
hit_pts[hitcount][i] = result[i];
|
|
|
|
}
|
1999-11-04 00:41:23 +00:00
|
|
|
hitcount++;
|
|
|
|
}
|
1999-11-03 21:01:59 +00:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// end of the line for this branch
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// branch requested not to be traversed
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-07-04 07:37:30 +00:00
|
|
|
// Determine scenery altitude via ssg. Normally this just happens
|
|
|
|
// when we render the scene, but we'd also like to be able to do this
|
|
|
|
// explicitely. lat & lon are in radians. view_pos in current world
|
|
|
|
// coordinate translated near (0,0,0) (in meters.) Returns result in
|
|
|
|
// meters.
|
|
|
|
double
|
|
|
|
FGTileMgr::current_elev_ssg( const Point3D& abs_view_pos,
|
|
|
|
const Point3D& view_pos )
|
|
|
|
{
|
1999-11-03 21:01:59 +00:00
|
|
|
hitcount = 0;
|
1999-07-04 07:37:30 +00:00
|
|
|
|
1999-11-04 22:55:00 +00:00
|
|
|
sgdMat4 m;
|
|
|
|
sgdMakeIdentMat4 ( m ) ;
|
1999-07-04 07:37:30 +00:00
|
|
|
|
1999-11-04 22:55:00 +00:00
|
|
|
sgdVec3 sgavp, sgvp;
|
|
|
|
sgdSetVec3(sgavp, abs_view_pos.x(), abs_view_pos.y(), abs_view_pos.z() );
|
|
|
|
sgdSetVec3(sgvp, view_pos.x(), view_pos.y(), view_pos.z() );
|
1999-07-04 07:37:30 +00:00
|
|
|
|
1999-11-04 22:55:00 +00:00
|
|
|
// cout << "starting ssg_los, abs view pos = " << abs_view_pos[0] << " "
|
|
|
|
// << abs_view_pos[1] << " " << abs_view_pos[2] << endl;
|
|
|
|
// cout << "starting ssg_los, view pos = " << view_pos[0] << " "
|
|
|
|
// << view_pos[1] << " " << view_pos[2] << endl;
|
1999-11-03 21:01:59 +00:00
|
|
|
my_ssg_los( "", scene, m, sgvp, sgavp );
|
1999-11-04 22:55:00 +00:00
|
|
|
|
1999-11-04 00:41:23 +00:00
|
|
|
double result = -9999;
|
|
|
|
|
|
|
|
for ( int i = 0; i < hitcount; ++i ) {
|
|
|
|
Point3D rel_cart( hit_pts[i][0], hit_pts[i][1], hit_pts[i][2] );
|
|
|
|
Point3D abs_cart = rel_cart + scenery.center;
|
|
|
|
Point3D pp = fgCartToPolar3d( abs_cart );
|
1999-11-04 22:55:00 +00:00
|
|
|
FG_LOG( FG_TERRAIN, FG_DEBUG, " polar form = " << pp );
|
1999-11-04 00:41:23 +00:00
|
|
|
// convert to geodetic coordinates
|
|
|
|
double lat_geod, alt, sea_level_r;
|
|
|
|
fgGeocToGeod(pp.lat(), pp.radius(), &lat_geod,
|
|
|
|
&alt, &sea_level_r);
|
|
|
|
|
|
|
|
// printf("alt = %.2f\n", alt);
|
|
|
|
// exit since we found an intersection
|
|
|
|
if ( alt > result && alt < 10000 ) {
|
|
|
|
// printf("returning alt\n");
|
|
|
|
result = alt;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( result > -9000 ) {
|
|
|
|
return result;
|
|
|
|
} else {
|
|
|
|
FG_LOG( FG_TERRAIN, FG_INFO, "no terrain intersection" );
|
|
|
|
return 0.0;
|
|
|
|
}
|
1999-07-04 07:37:30 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
1998-05-20 20:53:53 +00:00
|
|
|
// given the current lon/lat, fill in the array of local chunks. If
|
|
|
|
// the chunk isn't already in the cache, then read it from disk.
|
1999-06-13 05:58:02 +00:00
|
|
|
int FGTileMgr::update( void ) {
|
1999-06-12 21:12:13 +00:00
|
|
|
FGTileCache *c;
|
1999-02-05 21:28:09 +00:00
|
|
|
FGInterface *f;
|
1999-11-04 22:55:00 +00:00
|
|
|
FGTileEntry *t;
|
|
|
|
FGBucket p2;
|
1999-03-25 19:03:24 +00:00
|
|
|
static FGBucket p_last(false);
|
|
|
|
static double last_lon = -1000.0; // in degrees
|
|
|
|
static double last_lat = -1000.0; // in degrees
|
1998-07-13 21:00:09 +00:00
|
|
|
int tile_diameter;
|
1998-01-24 00:03:27 +00:00
|
|
|
int i, j, dw, dh;
|
1998-01-07 23:50:01 +00:00
|
|
|
|
1998-05-20 20:53:53 +00:00
|
|
|
c = &global_tile_cache;
|
1998-12-05 15:53:59 +00:00
|
|
|
f = current_aircraft.fdm_state;
|
1998-07-13 21:00:09 +00:00
|
|
|
|
|
|
|
tile_diameter = current_options.get_tile_diameter();
|
1998-01-07 23:50:01 +00:00
|
|
|
|
1999-03-25 19:03:24 +00:00
|
|
|
FGBucket p1( f->get_Longitude() * RAD_TO_DEG,
|
|
|
|
f->get_Latitude() * RAD_TO_DEG );
|
1999-11-04 22:55:00 +00:00
|
|
|
|
|
|
|
long int index = c->exists(p1);
|
|
|
|
if ( index >= 0 ) {
|
|
|
|
t = c->get_tile(index);
|
|
|
|
scenery.next_center = t->center;
|
|
|
|
} else {
|
|
|
|
FG_LOG( FG_TERRAIN, FG_WARN, "Tile not found" );
|
|
|
|
}
|
|
|
|
|
1998-07-13 21:00:09 +00:00
|
|
|
dw = tile_diameter / 2;
|
|
|
|
dh = tile_diameter / 2;
|
1998-01-08 02:22:26 +00:00
|
|
|
|
1999-06-13 05:58:02 +00:00
|
|
|
if ( (p1 == p_last) && (state == Running) ) {
|
1998-05-20 20:53:53 +00:00
|
|
|
// same bucket as last time
|
1998-11-06 21:17:31 +00:00
|
|
|
FG_LOG( FG_TERRAIN, FG_DEBUG, "Same bucket as last time" );
|
1999-06-13 05:58:02 +00:00
|
|
|
} else if ( (state == Start) || (state == Inited) ) {
|
|
|
|
state = Running;
|
1999-05-06 21:14:06 +00:00
|
|
|
|
1999-07-04 07:37:30 +00:00
|
|
|
// First time through or we have teleported, initialize the
|
1999-05-06 21:14:06 +00:00
|
|
|
// system and load all relavant tiles
|
1998-01-19 18:40:15 +00:00
|
|
|
|
1999-01-27 04:49:48 +00:00
|
|
|
FG_LOG( FG_TERRAIN, FG_INFO, "Updating Tile list for " << p1 );
|
1998-11-06 21:17:31 +00:00
|
|
|
FG_LOG( FG_TERRAIN, FG_INFO, " First time through ... " );
|
1998-11-09 23:40:46 +00:00
|
|
|
FG_LOG( FG_TERRAIN, FG_INFO, " Updating Tile list for " << p1 );
|
1998-11-06 21:17:31 +00:00
|
|
|
FG_LOG( FG_TERRAIN, FG_INFO, " Loading "
|
1998-11-09 23:40:46 +00:00
|
|
|
<< tile_diameter * tile_diameter << " tiles" );
|
1998-01-13 00:23:08 +00:00
|
|
|
|
1998-05-20 20:53:53 +00:00
|
|
|
// wipe/initialize tile cache
|
1998-09-14 12:45:23 +00:00
|
|
|
c->init();
|
1999-04-27 15:52:32 +00:00
|
|
|
p_last.make_bad();
|
1998-01-13 00:23:08 +00:00
|
|
|
|
1999-06-13 05:58:02 +00:00
|
|
|
// build the local area list and schedule tiles for loading
|
|
|
|
|
|
|
|
// start with the center tile and work out in concentric
|
|
|
|
// "rings"
|
|
|
|
|
|
|
|
p2 = fgBucketOffset( f->get_Longitude() * RAD_TO_DEG,
|
|
|
|
f->get_Latitude() * RAD_TO_DEG,
|
|
|
|
0, 0 );
|
1999-08-08 15:23:39 +00:00
|
|
|
sched_tile( p2 );
|
1999-06-13 05:58:02 +00:00
|
|
|
|
1999-11-04 00:41:23 +00:00
|
|
|
// prime scenery center calculations
|
1999-11-04 22:55:00 +00:00
|
|
|
Point3D geod_view_center( p2.get_center_lon(),
|
|
|
|
p2.get_center_lat(),
|
1999-11-04 00:41:23 +00:00
|
|
|
cur_fdm_state->get_Altitude()*FEET_TO_METER +
|
|
|
|
3 );
|
|
|
|
current_view.abs_view_pos = fgGeodToCart( geod_view_center );
|
1999-11-04 22:55:00 +00:00
|
|
|
current_view.view_pos = current_view.abs_view_pos - scenery.next_center;
|
1999-11-04 00:41:23 +00:00
|
|
|
|
1999-06-13 05:58:02 +00:00
|
|
|
for ( i = 3; i <= tile_diameter; i = i + 2 ) {
|
|
|
|
int span = i / 2;
|
|
|
|
|
|
|
|
// bottom row
|
|
|
|
for ( j = -span; j <= span; ++j ) {
|
|
|
|
p2 = fgBucketOffset( f->get_Longitude() * RAD_TO_DEG,
|
|
|
|
f->get_Latitude() * RAD_TO_DEG,
|
|
|
|
j, -span );
|
1999-08-08 15:23:39 +00:00
|
|
|
sched_tile( p2 );
|
1999-06-13 05:58:02 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// top row
|
|
|
|
for ( j = -span; j <= span; ++j ) {
|
|
|
|
p2 = fgBucketOffset( f->get_Longitude() * RAD_TO_DEG,
|
|
|
|
f->get_Latitude() * RAD_TO_DEG,
|
|
|
|
j, span );
|
1999-08-08 15:23:39 +00:00
|
|
|
sched_tile( p2 );
|
1999-06-13 05:58:02 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// middle rows
|
|
|
|
for ( j = -span + 1; j <= span - 1; ++j ) {
|
|
|
|
p2 = fgBucketOffset( f->get_Longitude() * RAD_TO_DEG,
|
|
|
|
f->get_Latitude() * RAD_TO_DEG,
|
|
|
|
-span, j );
|
1999-08-08 15:23:39 +00:00
|
|
|
sched_tile( p2 );
|
1999-06-13 05:58:02 +00:00
|
|
|
p2 = fgBucketOffset( f->get_Longitude() * RAD_TO_DEG,
|
|
|
|
f->get_Latitude() * RAD_TO_DEG,
|
|
|
|
span, j );
|
1999-08-08 15:23:39 +00:00
|
|
|
sched_tile( p2 );
|
1999-06-13 05:58:02 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
/* for ( j = 0; j < tile_diameter; j++ ) {
|
1998-07-13 21:00:09 +00:00
|
|
|
for ( i = 0; i < tile_diameter; i++ ) {
|
1999-03-25 19:03:24 +00:00
|
|
|
// fgBucketOffset(&p1, &p2, i - dw, j - dh);
|
|
|
|
p2 = fgBucketOffset( f->get_Longitude() * RAD_TO_DEG,
|
|
|
|
f->get_Latitude() * RAD_TO_DEG,
|
|
|
|
i - dw, j -dh );
|
1999-08-08 15:23:39 +00:00
|
|
|
sched_tile( p2 );
|
1999-06-13 05:58:02 +00:00
|
|
|
}
|
|
|
|
} */
|
|
|
|
|
|
|
|
// Now force a load of the center tile and inner ring so we
|
|
|
|
// have something to see in our first frame.
|
|
|
|
for ( i = 0; i < 9; ++i ) {
|
|
|
|
if ( load_queue.size() ) {
|
1999-09-28 22:44:23 +00:00
|
|
|
FG_LOG( FG_TERRAIN, FG_DEBUG,
|
1999-06-13 05:58:02 +00:00
|
|
|
"Load queue not empty, loading a tile" );
|
|
|
|
|
|
|
|
FGLoadRec pending = load_queue.front();
|
|
|
|
load_queue.pop_front();
|
1999-07-04 07:37:30 +00:00
|
|
|
load_tile( pending.b, pending.cache_index );
|
1998-01-24 00:03:27 +00:00
|
|
|
}
|
1998-01-13 00:23:08 +00:00
|
|
|
}
|
1999-06-13 05:58:02 +00:00
|
|
|
|
1998-01-26 15:55:24 +00:00
|
|
|
} else {
|
1998-05-20 20:53:53 +00:00
|
|
|
// We've moved to a new bucket, we need to scroll our
|
|
|
|
// structures, and load in the new tiles
|
1998-01-26 15:55:24 +00:00
|
|
|
|
1999-07-04 07:37:30 +00:00
|
|
|
#if 0
|
|
|
|
// make sure load queue is flushed before doing shift
|
|
|
|
while ( load_queue.size() ) {
|
1999-09-28 22:44:23 +00:00
|
|
|
FG_LOG( FG_TERRAIN, FG_DEBUG,
|
1999-07-04 07:37:30 +00:00
|
|
|
"Load queue not empty, flushing queue before tile shift." );
|
|
|
|
|
|
|
|
FGLoadRec pending = load_queue.front();
|
|
|
|
load_queue.pop_front();
|
|
|
|
load_tile( pending.b, pending.index );
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
1998-05-20 20:53:53 +00:00
|
|
|
// CURRENTLY THIS ASSUMES WE CAN ONLY MOVE TO ADJACENT TILES.
|
|
|
|
// AT ULTRA HIGH SPEEDS THIS ASSUMPTION MAY NOT BE VALID IF
|
|
|
|
// THE AIRCRAFT CAN SKIP A TILE IN A SINGLE ITERATION.
|
1998-01-26 15:55:24 +00:00
|
|
|
|
1998-11-09 23:40:46 +00:00
|
|
|
FG_LOG( FG_TERRAIN, FG_INFO, "Updating Tile list for " << p1 );
|
1998-05-07 23:15:20 +00:00
|
|
|
|
1999-03-25 19:03:24 +00:00
|
|
|
if ( (p1.get_lon() > p_last.get_lon()) ||
|
1999-08-08 15:23:39 +00:00
|
|
|
( (p1.get_lon() == p_last.get_lon()) &&
|
|
|
|
(p1.get_x() > p_last.get_x()) ) ) {
|
1998-11-06 21:17:31 +00:00
|
|
|
FG_LOG( FG_TERRAIN, FG_INFO,
|
1999-07-25 01:52:36 +00:00
|
|
|
" (East) Loading " << tile_diameter << " tiles" );
|
1998-07-13 21:00:09 +00:00
|
|
|
for ( j = 0; j < tile_diameter; j++ ) {
|
1998-05-20 20:53:53 +00:00
|
|
|
// scrolling East
|
1999-08-08 15:23:39 +00:00
|
|
|
// schedule new column
|
1999-03-25 19:03:24 +00:00
|
|
|
p2 = fgBucketOffset( last_lon, last_lat, dw + 1, j - dh );
|
1999-08-08 15:23:39 +00:00
|
|
|
sched_tile( p2 );
|
1998-01-26 15:55:24 +00:00
|
|
|
}
|
1999-03-25 19:03:24 +00:00
|
|
|
} else if ( (p1.get_lon() < p_last.get_lon()) ||
|
1999-07-04 07:37:30 +00:00
|
|
|
( (p1.get_lon() == p_last.get_lon()) &&
|
|
|
|
(p1.get_x() < p_last.get_x()) ) ) {
|
1998-11-06 21:17:31 +00:00
|
|
|
FG_LOG( FG_TERRAIN, FG_INFO,
|
1999-07-25 01:52:36 +00:00
|
|
|
" (West) Loading " << tile_diameter << " tiles" );
|
1998-07-13 21:00:09 +00:00
|
|
|
for ( j = 0; j < tile_diameter; j++ ) {
|
1998-05-20 20:53:53 +00:00
|
|
|
// scrolling West
|
1999-08-08 15:23:39 +00:00
|
|
|
// schedule new column
|
1999-03-25 19:03:24 +00:00
|
|
|
p2 = fgBucketOffset( last_lon, last_lat, -dw - 1, j - dh );
|
1999-08-08 15:23:39 +00:00
|
|
|
sched_tile( p2 );
|
1998-01-26 15:55:24 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1999-03-25 19:03:24 +00:00
|
|
|
if ( (p1.get_lat() > p_last.get_lat()) ||
|
1999-08-08 15:23:39 +00:00
|
|
|
( (p1.get_lat() == p_last.get_lat()) &&
|
|
|
|
(p1.get_y() > p_last.get_y()) ) ) {
|
1998-11-06 21:17:31 +00:00
|
|
|
FG_LOG( FG_TERRAIN, FG_INFO,
|
1999-07-25 01:52:36 +00:00
|
|
|
" (North) Loading " << tile_diameter << " tiles" );
|
1998-07-13 21:00:09 +00:00
|
|
|
for ( i = 0; i < tile_diameter; i++ ) {
|
1998-05-20 20:53:53 +00:00
|
|
|
// scrolling North
|
1999-08-08 15:23:39 +00:00
|
|
|
// schedule new row
|
1999-03-25 19:03:24 +00:00
|
|
|
p2 = fgBucketOffset( last_lon, last_lat, i - dw, dh + 1);
|
1999-08-08 15:23:39 +00:00
|
|
|
sched_tile( p2 );
|
1998-01-26 15:55:24 +00:00
|
|
|
}
|
1999-03-25 19:03:24 +00:00
|
|
|
} else if ( (p1.get_lat() < p_last.get_lat()) ||
|
1999-08-08 15:23:39 +00:00
|
|
|
( (p1.get_lat() == p_last.get_lat()) &&
|
|
|
|
(p1.get_y() < p_last.get_y()) ) ) {
|
1998-11-06 21:17:31 +00:00
|
|
|
FG_LOG( FG_TERRAIN, FG_INFO,
|
1999-07-25 01:52:36 +00:00
|
|
|
" (South) Loading " << tile_diameter << " tiles" );
|
1998-07-13 21:00:09 +00:00
|
|
|
for ( i = 0; i < tile_diameter; i++ ) {
|
1998-05-20 20:53:53 +00:00
|
|
|
// scrolling South
|
1999-08-08 15:23:39 +00:00
|
|
|
// schedule new row
|
1999-03-25 19:03:24 +00:00
|
|
|
p2 = fgBucketOffset( last_lon, last_lat, i - dw, -dh - 1);
|
1999-08-08 15:23:39 +00:00
|
|
|
sched_tile( p2 );
|
1998-01-26 15:55:24 +00:00
|
|
|
}
|
1998-02-12 21:58:27 +00:00
|
|
|
}
|
1998-01-13 00:23:08 +00:00
|
|
|
}
|
1998-12-03 01:18:16 +00:00
|
|
|
|
1999-06-13 05:58:02 +00:00
|
|
|
if ( load_queue.size() ) {
|
1999-09-28 22:44:23 +00:00
|
|
|
FG_LOG( FG_TERRAIN, FG_DEBUG, "Load queue not empty, loading a tile" );
|
1999-06-13 05:58:02 +00:00
|
|
|
|
|
|
|
FGLoadRec pending = load_queue.front();
|
|
|
|
load_queue.pop_front();
|
1999-07-04 07:37:30 +00:00
|
|
|
load_tile( pending.b, pending.cache_index );
|
1999-06-13 05:58:02 +00:00
|
|
|
}
|
|
|
|
|
1998-12-03 01:18:16 +00:00
|
|
|
// find our current elevation (feed in the current bucket to save work)
|
1999-01-27 04:49:48 +00:00
|
|
|
Point3D geod_pos = Point3D( f->get_Longitude(), f->get_Latitude(), 0.0);
|
|
|
|
Point3D tmp_abs_view_pos = fgGeodToCart(geod_pos);
|
|
|
|
|
1999-11-04 22:55:00 +00:00
|
|
|
// cout << "current elevation (old) == "
|
|
|
|
// << current_elev( f->get_Longitude(), f->get_Latitude(),
|
|
|
|
// tmp_abs_view_pos )
|
|
|
|
// << endl;
|
1999-11-04 00:41:23 +00:00
|
|
|
scenery.cur_elev = current_elev_ssg( current_view.abs_view_pos,
|
|
|
|
current_view.view_pos );
|
1999-11-04 22:55:00 +00:00
|
|
|
// cout << "current elevation (ssg) == " << scenery.cur_elev << endl;
|
1999-07-04 07:37:30 +00:00
|
|
|
|
1999-03-25 19:03:24 +00:00
|
|
|
p_last = p1;
|
|
|
|
last_lon = f->get_Longitude() * RAD_TO_DEG;
|
|
|
|
last_lat = f->get_Latitude() * RAD_TO_DEG;
|
1998-01-13 00:23:08 +00:00
|
|
|
|
1998-12-03 01:18:16 +00:00
|
|
|
return 1;
|
1998-07-08 14:47:20 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
1998-09-08 15:05:10 +00:00
|
|
|
// NEW
|
|
|
|
|
|
|
|
// inrange() IS THIS POINT WITHIN POSSIBLE VIEWING RANGE ?
|
|
|
|
// calculate distance from vertical tangent line at
|
|
|
|
// current position to center of object.
|
|
|
|
// this is equivalent to
|
|
|
|
// dist = point_line_dist_squared( &(t->center), &(v->abs_view_pos),
|
|
|
|
// v->local_up );
|
|
|
|
// if ( dist < FG_SQUARE(t->bounding_radius) ) {
|
|
|
|
//
|
|
|
|
// the compiler should inline this for us
|
|
|
|
|
|
|
|
static int
|
1998-10-16 00:51:46 +00:00
|
|
|
inrange( const double radius, const Point3D& center, const Point3D& vp,
|
1998-09-08 15:05:10 +00:00
|
|
|
const MAT3vec up)
|
|
|
|
{
|
|
|
|
MAT3vec u, u1, v;
|
|
|
|
// double tmp;
|
|
|
|
|
|
|
|
// u = p - p0
|
1998-10-16 00:51:46 +00:00
|
|
|
u[0] = center.x() - vp.x();
|
|
|
|
u[1] = center.y() - vp.y();
|
|
|
|
u[2] = center.z() - vp.z();
|
1998-09-08 15:05:10 +00:00
|
|
|
|
|
|
|
// calculate the projection, u1, of u along d.
|
|
|
|
// u1 = ( dot_prod(u, d) / dot_prod(d, d) ) * d;
|
|
|
|
|
|
|
|
MAT3_SCALE_VEC(u1, up,
|
|
|
|
(MAT3_DOT_PRODUCT(u, up) / MAT3_DOT_PRODUCT(up, up)) );
|
|
|
|
|
|
|
|
// v = u - u1 = vector from closest point on line, p1, to the
|
|
|
|
// original point, p.
|
|
|
|
MAT3_SUB_VEC(v, u, u1);
|
|
|
|
|
|
|
|
return( FG_SQUARE(radius) >= MAT3_DOT_PRODUCT(v, v));
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// NEW for legibility
|
|
|
|
|
|
|
|
// update this tile's geometry for current view
|
|
|
|
// The Compiler should inline this
|
|
|
|
static void
|
1999-06-12 21:12:13 +00:00
|
|
|
update_tile_geometry( FGTileEntry *t, GLdouble *MODEL_VIEW)
|
1998-09-08 15:05:10 +00:00
|
|
|
{
|
1999-04-27 15:52:32 +00:00
|
|
|
GLfloat *m;
|
1998-09-08 15:05:10 +00:00
|
|
|
double x, y, z;
|
|
|
|
|
|
|
|
// calculate tile offset
|
1998-10-16 00:51:46 +00:00
|
|
|
t->offset = t->center - scenery.center;
|
|
|
|
|
|
|
|
x = t->offset.x();
|
|
|
|
y = t->offset.y();
|
|
|
|
z = t->offset.z();
|
1998-09-08 15:05:10 +00:00
|
|
|
|
|
|
|
m = t->model_view;
|
|
|
|
|
|
|
|
// Calculate the model_view transformation matrix for this tile
|
|
|
|
FG_MEM_COPY( m, MODEL_VIEW, 16*sizeof(GLdouble) );
|
|
|
|
|
|
|
|
// This is equivalent to doing a glTranslatef(x, y, z);
|
|
|
|
m[12] += (m[0]*x + m[4]*y + m[8] *z);
|
|
|
|
m[13] += (m[1]*x + m[5]*y + m[9] *z);
|
|
|
|
m[14] += (m[2]*x + m[6]*y + m[10]*z);
|
|
|
|
// m[15] += (m[3]*x + m[7]*y + m[11]*z);
|
|
|
|
// m[3] m7[] m[11] are 0.0 see LookAt() in views.cxx
|
|
|
|
// so m[15] is unchanged
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-06-30 00:28:20 +00:00
|
|
|
// Prepare the ssg nodes ... for each tile, set it's proper
|
|
|
|
// transform and update it's range selector based on current
|
|
|
|
// visibilty
|
|
|
|
void FGTileMgr::prep_ssg_nodes( void ) {
|
|
|
|
FGTileEntry *t;
|
|
|
|
|
|
|
|
float ranges[2];
|
|
|
|
ranges[0] = 0.0f;
|
|
|
|
|
|
|
|
// traverse the potentially viewable tile list and update range
|
|
|
|
// selector and transform
|
1999-08-08 15:23:39 +00:00
|
|
|
for ( int i = 0; i < (int)global_tile_cache.get_size(); i++ ) {
|
|
|
|
t = global_tile_cache.get_tile( i );
|
1999-06-30 00:28:20 +00:00
|
|
|
|
|
|
|
if ( t->is_loaded() ) {
|
1999-06-30 14:35:01 +00:00
|
|
|
// set range selector (LOD trick) to be distance to center
|
|
|
|
// of tile + bounding radius
|
1999-10-14 20:30:54 +00:00
|
|
|
#ifndef FG_OLD_WEATHER
|
1999-08-10 03:45:47 +00:00
|
|
|
ranges[1] = WeatherDatabase->getWeatherVisibility()
|
|
|
|
+ t->bounding_radius;
|
1999-08-12 17:13:44 +00:00
|
|
|
#else
|
|
|
|
ranges[1] = current_weather.get_visibility()+t->bounding_radius;
|
|
|
|
#endif
|
1999-06-30 00:28:20 +00:00
|
|
|
t->range_ptr->setRanges( ranges, 2 );
|
|
|
|
|
|
|
|
// calculate tile offset
|
|
|
|
t->SetOffset( scenery.center );
|
|
|
|
|
|
|
|
// calculate ssg transform
|
|
|
|
sgCoord sgcoord;
|
|
|
|
sgSetCoord( &sgcoord,
|
|
|
|
t->offset.x(), t->offset.y(), t->offset.z(),
|
|
|
|
0.0, 0.0, 0.0 );
|
1999-07-04 07:37:30 +00:00
|
|
|
t->transform_ptr->setTransform( &sgcoord );
|
1999-06-30 00:28:20 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|