ewPOIs.cpp 7.35 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
/*
 * EasyWave - A realtime tsunami simulation program with GPU support.
 * Copyright (C) 2014  Andrey Babeyko, Johannes Spazier
 * GFZ German Research Centre for Geosciences (http://www.gfz-potsdam.de)
 *
 * Parts of this program (especially the GPU extension) were developed
 * within the context of the following publicly funded project:
 * - TRIDEC, EU 7th Framework Programme, Grant Agreement 258723
 *   (http://www.tridec-online.eu)
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Affero General Public License as
 * published by the Free Software Foundation, either version 3 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 Affero General Public License for more details.
 *
 * You should have received a copy of the GNU Affero General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */

25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utilits.h>
#include "easywave.h"

//#define SSHMAX_TO_SINGLE_FILE 0

static int MaxPOIs;
int NPOIs;
static char **idPOI;
long *idxPOI;
static int *flagRunupPOI;
static int NtPOI;
static int *timePOI;
static float **sshPOI;


int ewLoadPOIs()
{
  FILE *fp,*fpFit,*fpAcc,*fpRej;
  int ierr,line;
  int i,j,i0,j0,imin,imax,jmin,jmax,flag,it,n;
  int rad,nmin,itype;
  char record[256],buf[256],id[64];
  double lon,lat,d2,d2min,lenLon,lenLat,depth;
  double POIdistMax,POIdepthMin,POIdepthMax;

  CNode& Node = *gNode;

  // if POIs file is not specified
  if( Par.filePOIs == NULL ) return 0;

  Log.print("Loading POIs from %s", Par.filePOIs );

  MaxPOIs = utlGetNumberOfRecords( Par.filePOIs ); if( !MaxPOIs ) return Err.post( "Empty POIs file" );

  idPOI = new char*[MaxPOIs]; if( !idPOI ) return Err.post( Err.msgAllocateMem() );
  idxPOI = new long[MaxPOIs]; if( !idxPOI ) return Err.post( Err.msgAllocateMem() );
  flagRunupPOI = new int[MaxPOIs]; if( !flagRunupPOI ) return Err.post( Err.msgAllocateMem() );
  sshPOI = new float*[MaxPOIs]; if( !sshPOI ) return Err.post( Err.msgAllocateMem() );

  // read first record and get idea about the input type
  fp = fopen( Par.filePOIs, "rt" );
  line = 0; utlReadNextRecord( fp, record, &line );
  itype = sscanf( record, "%s %s %s", buf, buf, buf );
  fclose( fp );

  if( itype == 2 ) { // poi-name and grid-index

    fp = fopen( Par.filePOIs, "rt" );
    line = NPOIs = 0;
    while( utlReadNextRecord( fp, record, &line ) != EOF ) {

      i = sscanf( record, "%s %d", id, &nmin );
      if( i != 2 ) {
        Log.print( "! Bad POI record: %s", record );
        continue;
      }
      idPOI[NPOIs] = strdup(id);
      idxPOI[NPOIs] = nmin;
      flagRunupPOI[NPOIs] = 1;
      NPOIs++;
    }

    fclose( fp );
    Log.print( "%d POIs of %d loaded successfully; %d POIs rejected", NPOIs, MaxPOIs, (MaxPOIs-NPOIs) );
  }
  else if( itype == 3 ) { // poi-name and coordinates

    if( Par.poiReport ) {
      fpAcc = fopen( "poi_accepted.lst", "wt" );
      fprintf( fpAcc, "ID lon lat   lonIJ latIJ depthIJ   dist[km]\n" );
      fpRej = fopen( "poi_rejected.lst", "wt" );
    }

    lenLat = My_PI*Re/180;

    fp = fopen( Par.filePOIs, "rt" );
    line = NPOIs = 0;
    while( utlReadNextRecord( fp, record, &line ) != EOF ) {

      i = sscanf( record, "%s %lf %lf %d", id, &lon, &lat, &flag );
      if( i == 3 )
        flag = 1;
      else if( i == 4 )
        ;
      else {
        Log.print( "! Bad POI record: %s", record );
        if( Par.poiReport ) fprintf( fpRej, "%s\n", record );
        continue;
      }

      // find the closest water grid node. Local distances could be treated as cartesian (2 min cell distortion at 60 degrees is only about 2 meters or 0.2%)
119 120
      i0 = getI( lon );
      j0 = getJ( lat );
121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269
      if( i0<1 || i0>NLon || j0<1 || j0>NLat ) {
        Log.print( "!POI out of grid: %s", record );
        if( Par.poiReport ) fprintf( fpRej, "%s\n", record );
        continue;
      }
      lenLon = lenLat * R6[j0];

      for( nmin=-1,rad=0; rad<NLon && rad<NLat; rad++ ) {

        d2min = RealMax;

        imin = i0-rad; if( imin < 1 ) imin = 1;
        imax = i0+rad+1; if( imax > NLon ) imax = NLon;
        jmin = j0-rad; if( jmin < 1 ) jmin = 1;
        jmax = j0+rad+1; if( jmax > NLat ) jmax = NLat;
        for( i=imin; i<=imax; i++ )
          for( j=jmin; j<=jmax; j++ ) {
            if( i != imin && i != imax && j != jmin && j != jmax ) continue;
            n = idx(j,i);
            depth = Node(n, iD);
            if( depth < Par.poiDepthMin || depth > Par.poiDepthMax ) continue;
            d2 = pow( lenLon*(lon-getLon(i)), 2. ) + pow( lenLat*(lat-getLat(j)), 2. );
            if( d2 < d2min ) { d2min = d2; nmin = n; }
          }

        if( nmin > 0 ) break;
      }

      if( sqrt(d2min) > Par.poiDistMax ) {
        Log.print( "! Closest water node too far: %s", record );
        if( Par.poiReport ) fprintf( fpRej, "%s\n", record );
        continue;
      }

      idPOI[NPOIs] = strdup(id);
      idxPOI[NPOIs] = nmin;
      flagRunupPOI[NPOIs] = flag;
      NPOIs++;
      i = nmin/NLat + 1;
      j = nmin - (i-1)*NLat + 1;
      if( Par.poiReport ) fprintf( fpAcc, "%s %.4f %.4f   %.4f %.4f %.1f   %.3f\n", id, lon, lat, getLon(i), getLat(j), Node(nmin, iD), sqrt(d2min)/1000 );
    }

    fclose( fp );
    Log.print( "%d POIs of %d loaded successfully; %d POIs rejected", NPOIs, MaxPOIs, (MaxPOIs-NPOIs) );
    if( Par.poiReport ) {
      fclose( fpAcc );
      fclose( fpRej );
    }
  }

  // if mareograms
  if( Par.poiDt ) {
    NtPOI = Par.timeMax/Par.poiDt + 1;

    timePOI = new int[NtPOI];
    for( it=0; it<NtPOI; it++ ) timePOI[it] = -1;

    for( n=0; n<NPOIs; n++ ) {
      sshPOI[n] = new float[NtPOI];
      for( it=0; it<NtPOI; it++ ) sshPOI[n][it] = 0.;
    }
  }

  return 0;
}


int ewSavePOIs()
{
  int it,n;
  double ampFactor;

  CNode& Node = *gNode;

  if( !NPOIs ) return 0;

  it = Par.time / Par.poiDt;

  timePOI[it] = Par.time;

  for( n=0; n<NPOIs; n++ ) {

    if( flagRunupPOI[n] )
      ampFactor = pow( Node(idxPOI[n], iD), 0.25 );
    else
      ampFactor = 1.;

    sshPOI[n][it] = ampFactor * Node(idxPOI[n], iH);
  }

  return 0;
}


int ewDumpPOIs()
{
  FILE *fp;
  char buf[64];
  int n,it;
  double ampFactor,dbuf;

  CNode& Node = *gNode;

  if( !NPOIs ) return 0;

  if( Par.poiDt ) {  // Time series
    sprintf( buf, "%s.poi.ssh", Par.modelName );
    fp = fopen( buf, "wt" );

    fprintf( fp, "Minute" );
    for( n=0; n<NPOIs; n++ )
      fprintf( fp, "   %s", idPOI[n] );
    fprintf( fp, "\n" );

    for( it=0; (timePOI[it] != -1 && it < NtPOI); it++ ) {
      fprintf( fp, "%6.2f", (double)timePOI[it]/60 );
      for( n=0; n<NPOIs; n++ )
        fprintf( fp, " %7.3f", sshPOI[n][it] );
      fprintf( fp, "\n" );
    }

    fclose( fp );
  }

  // EAT EWH
  sprintf( buf, "%s.poi.summary", Par.modelName );
  fp = fopen( buf, "wt" );

  fprintf( fp, "ID ETA EWH\n" );

  for( n=0; n<NPOIs; n++ ) {
    fprintf( fp, "%s", idPOI[n] );
    dbuf = Node(idxPOI[n], iTime)/60;
    if( dbuf < 0. ) dbuf = -1.;
    fprintf( fp, " %6.2f", dbuf );

    if( flagRunupPOI[n] )
      ampFactor = pow(Node(idxPOI[n], iD), 0.25);
    else
      ampFactor = 1;

    fprintf( fp, " %6.3f\n", (ampFactor * Node(idxPOI[n], iHmax)) );
  }

  fclose( fp );

  return 0;
}