22 subroutine horiz_interp_bilinear_new_1d_ ( Interp, lon_in, lat_in, lon_out, lat_out, &
26 type(horiz_interp_type),
intent(inout) :: Interp
28 real(FMS_HI_KIND_),
intent(in),
dimension(:) :: lon_in
30 real(FMS_HI_KIND_),
intent(in),
dimension(:) :: lat_in
32 real(FMS_HI_KIND_),
intent(in),
dimension(:,:) :: lon_out
34 real(FMS_HI_KIND_),
intent(in),
dimension(:,:) :: lat_out
36 integer,
intent(in),
optional :: verbose
38 logical,
intent(in),
optional :: src_modulo
41 logical :: src_is_modulo
42 integer :: nlon_in, nlat_in, nlon_out, nlat_out, n, m
43 integer :: ie, is, je, js, ln_err, lt_err, warns, iunit
44 real(FMS_HI_KIND_) :: wtw, wte, wts, wtn, lon, lat, tpi, hpi
45 real(FMS_HI_KIND_) :: glt_min, glt_max, gln_min, gln_max, min_lon, max_lon
46 integer,
parameter :: kindl = fms_hi_kind_
47 logical :: decreasing_lat
48 logical :: decreasing_lon
51 if(
present(verbose)) warns = verbose
52 src_is_modulo = .true.
53 if (
present(src_modulo)) src_is_modulo = src_modulo
55 decreasing_lat = .false.
56 if (lat_in(1) > lat_in(2)) decreasing_lat = .true.
58 decreasing_lon = .false.
59 if (lon_in(1) > lon_in(2)) decreasing_lon = .true.
61 hpi = 0.5_kindl * real(pi, fms_hi_kind_)
73 allocate ( interp % HI_KIND_TYPE_ % wti (
size(lon_out,1),
size(lon_out,2),2), &
74 interp % HI_KIND_TYPE_ % wtj (
size(lon_out,1),
size(lon_out,2),2), &
75 interp % i_lon (
size(lon_out,1),
size(lon_out,2),2), &
76 interp % j_lat (
size(lon_out,1),
size(lon_out,2),2))
79 nlon_in =
size(lon_in(:)) ; nlat_in =
size(lat_in(:))
80 nlon_out =
size(lon_out, 1); nlat_out =
size(lon_out, 2)
81 interp%nlon_src = nlon_in; interp%nlat_src = nlat_in
82 interp%nlon_dst = nlon_out; interp%nlat_dst = nlat_out
84 if(src_is_modulo)
then
85 if(lon_in(nlon_in) - lon_in(1) .gt. tpi + real(epsln, fms_hi_kind_)) &
86 call mpp_error(fatal,
'horiz_interp_bilinear_mod: '// &
87 'The range of source grid longitude should be no larger than tpi')
89 if(lon_in(1) .lt. 0.0_kindl .OR. lon_in(nlon_in) > tpi )
then
91 max_lon = lon_in(nlon_in)
100 if(src_is_modulo)
then
101 if(lon .lt. min_lon)
then
103 else if(lon .gt. max_lon)
then
108 if((lon .lt. lon_in(1)) .or. (lon .gt. lon_in(nlon_in))) &
109 call mpp_error(fatal,
'horiz_interp_bilinear_mod: ' //&
110 'when input grid is not modulo, output grid should locate inside input grid')
113 glt_min = min(lat,glt_min); glt_max = max(lat,glt_max)
114 gln_min = min(lon,gln_min); gln_max = max(lon,gln_max)
116 is = nearest_index(lon, lon_in )
117 if (decreasing_lon)
then
122 if( lon_in(is) .lt. lon ) is = max(is-1,1)
128 if( lon_in(is) .gt. lon ) is = max(is-1,1)
130 if( lon_in(is) .eq. lon .and. is .eq. nlon_in) is = max(is - 1,1)
131 ie = min(is+1,nlon_in)
132 if(lon_in(is) .ne. lon_in(ie) .and. (decreasing_lon .or. lon_in(is) .le. lon))
then
133 wtw = ( lon_in(ie) - lon) / (lon_in(ie) - lon_in(is) )
140 if (lon_in(ie) .ge. lon )
then
141 wtw = (lon_in(ie) -lon)/(lon_in(ie)-lon_in(is)+tpi+real(epsln,fms_hi_kind_))
143 wtw = (lon_in(ie)-lon+tpi+real(epsln,fms_hi_kind_))/(lon_in(ie)-lon_in(is)+tpi+real(epsln,fms_hi_kind_))
146 wte = 1.0_kindl - wtw
148 js = nearest_index(lat, lat_in )
149 if (decreasing_lat)
then
151 if( lat_in(js) .lt. lat ) js = max(js - 1, 1)
154 if( lat_in(js) .gt. lat ) js = max(js - 1, 1)
156 if( lat_in(js) .eq. lat .and. js .eq. nlat_in) js = max(js - 1, 1)
157 je = min(js + 1, nlat_in)
159 if ( lat_in(js) .ne. lat_in(je) .and. (decreasing_lat .or. lat_in(js) .le. lat))
then
160 wts = ( lat_in(je) - lat )/(lat_in(je)-lat_in(js))
169 wtn = 1.0_kindl - wts
171 interp % i_lon (m,n,1) = is; interp % i_lon (m,n,2) = ie
172 interp % j_lat (m,n,1) = js; interp % j_lat (m,n,2) = je
173 interp % HI_KIND_TYPE_ % wti (m,n,1) = wtw
174 interp % HI_KIND_TYPE_ % wti (m,n,2) = wte
175 interp % HI_KIND_TYPE_ % wtj (m,n,1) = wts
176 interp % HI_KIND_TYPE_ % wtj (m,n,2) = wtn
183 if (ln_err .eq. 1 .and. warns > 0)
then
184 write (iunit,
'(/,(1x,a))') &
185 '==> Warning: the geographic data set does not extend far ', &
186 ' enough east or west - a cyclic boundary ', &
187 ' condition was applied. check if appropriate '
188 write (iunit,
'(/,(1x,a,2f8.4))') &
189 ' data required between longitudes:', gln_min, gln_max, &
190 ' data set is between longitudes:', lon_in(1), lon_in(nlon_in)
194 if (lt_err .eq. 1 .and. warns > 0)
then
195 write (iunit,
'(/,(1x,a))') &
196 '==> Warning: the geographic data set does not extend far ',&
197 ' enough north or south - extrapolation from ',&
198 ' the nearest data was applied. this may create ',&
199 ' artificial gradients near a geographic pole '
200 write (iunit,
'(/,(1x,a,2f8.4))') &
201 ' data required between latitudes:', glt_min, glt_max, &
202 ' data set is between latitudes:', lat_in(1), lat_in(nlat_in)
204 interp% HI_KIND_TYPE_ % is_allocated = .true.
205 interp% interp_method = bilinear
209 end subroutine horiz_interp_bilinear_new_1d_
216 subroutine horiz_interp_bilinear_new_2d_ ( Interp, lon_in, lat_in, lon_out, lat_out, &
217 verbose, src_modulo, new_search, no_crash_when_not_found )
220 type(horiz_interp_type),
intent(inout) :: Interp
222 real(FMS_HI_KIND_),
intent(in),
dimension(:,:) :: lon_in
224 real(FMS_HI_KIND_),
intent(in),
dimension(:,:) :: lat_in
226 real(FMS_HI_KIND_),
intent(in),
dimension(:,:) :: lon_out
228 real(FMS_HI_KIND_),
intent(in),
dimension(:,:) :: lat_out
230 integer,
intent(in),
optional :: verbose
232 logical,
intent(in),
optional :: src_modulo
234 logical,
intent(in),
optional :: new_search
236 logical,
intent(in),
optional :: no_crash_when_not_found
239 logical :: src_is_modulo
240 integer :: nlon_in, nlat_in, nlon_out, nlat_out
241 integer :: m, n, is, ie, js, je, num_solution
242 real(FMS_HI_KIND_) :: lon, lat, quadra, x, y, y1, y2
243 real(FMS_HI_KIND_) :: a1, b1, c1, d1, a2, b2, c2, d2, a, b, c
244 real(FMS_HI_KIND_) :: lon1, lat1, lon2, lat2, lon3, lat3, lon4, lat4
245 real(FMS_HI_KIND_) :: tpi, lon_min, lon_max
246 real(FMS_HI_KIND_) :: epsln2
247 logical :: use_new_search, no_crash
249 integer,
parameter :: kindl=fms_hi_kind_
251 tpi = 2.0_kindl * real(pi, fms_hi_kind_)
254 if(
present(verbose)) warns = verbose
255 src_is_modulo = .true.
256 if (
present(src_modulo)) src_is_modulo = src_modulo
257 use_new_search = .false.
258 if (
present(new_search)) use_new_search = new_search
260 if(
present(no_crash_when_not_found)) no_crash = no_crash_when_not_found
263 if(
size(lon_out,1) /=
size(lat_out,1) .or.
size(lon_out,2) /=
size(lat_out,2) ) &
264 call mpp_error(fatal,
'horiz_interp_bilinear_mod: when using bilinear ' // &
265 'interplation, the output grids should be geographical grids')
267 if(
size(lon_in,1) /=
size(lat_in,1) .or.
size(lon_in,2) /=
size(lat_in,2) ) &
268 call mpp_error(fatal,
'horiz_interp_bilinear_mod: when using bilinear '// &
269 'interplation, the input grids should be geographical grids')
272 nlon_in =
size(lon_in,1) ; nlat_in =
size(lat_in,2)
273 nlon_out =
size(lon_out,1); nlat_out =
size(lon_out,2)
274 interp%nlon_src = nlon_in; interp%nlat_src = nlat_in
275 interp%nlon_dst = nlon_out; interp%nlat_dst = nlat_out
277 allocate ( interp % HI_KIND_TYPE_ % wti (
size(lon_out,1),
size(lon_out,2),2), &
278 interp % HI_KIND_TYPE_ % wtj (
size(lon_out,1),
size(lon_out,2),2), &
279 interp % i_lon (
size(lon_out,1),
size(lon_out,2),2), &
280 interp % j_lat (
size(lon_out,1),
size(lon_out,2),2))
283 if(use_new_search)
then
284 epsln2 = real(epsln,fms_hi_kind_)* 1.0e5_kindl
285 call find_neighbor_new_(interp, lon_in, lat_in, lon_out, lat_out, src_is_modulo, no_crash)
287 if(kindl == r8_kind)
then
292 call find_neighbor_(interp, lon_in, lat_in, lon_out, lat_out, src_is_modulo)
329 lon_min = minval(lon_in);
330 lon_max = maxval(lon_in);
336 if(lon .lt. lon_min)
then
338 else if(lon .gt. lon_max)
then
341 is = interp%i_lon(m,n,1); ie = interp%i_lon(m,n,2)
342 js = interp%j_lat(m,n,1); je = interp%j_lat(m,n,2)
343 if( is == dummy) cycle
344 lon1 = lon_in(is,js); lat1 = lat_in(is,js);
345 lon2 = lon_in(ie,js); lat2 = lat_in(ie,js);
346 lon3 = lon_in(ie,je); lat3 = lat_in(ie,je);
347 lon4 = lon_in(is,je); lat4 = lat_in(is,je);
348 if(lon .lt. lon_min)
then
349 lon1 = lon1 -tpi; lon4 = lon4 - tpi
350 else if(lon .gt. lon_max)
then
351 lon2 = lon2 +tpi; lon3 = lon3 + tpi
355 c1 = lon1+lon3-lon4-lon2
359 c2 = lat1+lat3-lat4-lat2
363 b = a1*b2-a2*b1+c1*d2-c2*d1+c2*lon-c1*lat
364 c = a2*lon-a1*lat+a1*d2-a2*d1
365 quadra = b*b-4._kindl*a*c
366 if(abs(quadra) < real(epsln, fms_hi_kind_)) quadra = 0.0_kindl
367 if(quadra < 0.0_kindl)
call mpp_error(fatal, &
368 "horiz_interp_bilinear_mod: No solution existed for this quadratic equation")
369 if ( abs(a) .lt. epsln2)
then
370 if( abs(b) .lt. real(epsln,fms_hi_kind_))
call mpp_error(fatal, &
371 "horiz_interp_bilinear_mod: no unique solution existed for this linear equation")
374 y1 = 0.5_kindl*(-b+sqrt(quadra))/a
375 y2 = 0.5_kindl*(-b-sqrt(quadra))/a
376 if(abs(y1) < epsln2) y1 = 0.0_kindl
377 if(abs(y2) < epsln2) y2 = 0.0_kindl
378 if(abs(1.0_kindl-y1) < epsln2) y1 = 1.0_kindl
379 if(abs(1.0_kindl-y2) < epsln2) y2 = 1.0_kindl
381 if(y1 >= 0.0_kindl .and. y1 <= 1.0_kindl)
then
383 num_solution = num_solution +1
385 if(y2 >= 0.0_kindl .and. y2 <= 1.0_kindl)
then
387 num_solution = num_solution + 1
389 if(num_solution == 0)
then
390 call mpp_error(fatal,
"horiz_interp_bilinear_mod: No solution found")
391 else if(num_solution == 2)
then
392 call mpp_error(fatal,
"horiz_interp_bilinear_mod: Two solutions found")
395 if(abs(a1+c1*y) < real(epsln,fms_hi_kind_))
call mpp_error(fatal, &
396 "horiz_interp_bilinear_mod: the denomenator is 0")
397 if(abs(y) < epsln2) y = 0.0_kindl
398 if(abs(1.0_kindl-y) < epsln2) y = 1.0_kindl
399 x = (lon-b1*y-d1)/(a1+c1*y)
400 if(abs(x) < epsln2) x = 0.0_kindl
401 if(abs(1.0_kindl-x) < epsln2) x = 1.0_kindl
404 if(use_new_search)
then
405 if (x < 0.0_kindl) x = 0.0_kindl
406 if (y < 0.0_kindl) y = 0.0_kindl
407 if (x > 1.0_kindl) x = 1.0_kindl
408 if (y > 1.0_kindl) y = 1.0_kindl
411 if( kindl == r8_kind )
then
412 if( x>1.0_kindl .or. x<0.0_kindl .or. y>1.0_kindl .or. y < 0.0_kindl) &
413 call mpp_error(fatal,
"horiz_interp_bilinear_mod: weight should be between 0 and 1, x=" &
414 //string(x)//
" y="//string(y))
416 if( x>1.0_kindl + epsln2 .or. x<0.0_kindl - epsln2 .or. &
417 y>1.0_kindl + epsln2 .or. y < 0.0_kindl - epsln2) &
418 call mpp_error(fatal,
"horiz_interp_bilinear_mod: weight should be between 0 and 1, x=" &
419 //string(x)//
" y="//string(y))
421 interp % HI_KIND_TYPE_ % wti(m,n,1)=1.0_kindl-x
422 interp % HI_KIND_TYPE_ % wti(m,n,2)=x
423 interp % HI_KIND_TYPE_ % wtj(m,n,1)=1.0_kindl-y
424 interp % HI_KIND_TYPE_ % wtj(m,n,2)=y
428 interp% HI_KIND_TYPE_ % is_allocated = .true.
429 interp% interp_method = bilinear
430 end subroutine horiz_interp_bilinear_new_2d_
437 subroutine find_neighbor_ ( Interp, lon_in, lat_in, lon_out, lat_out, src_modulo )
438 type(horiz_interp_type),
intent(inout) :: Interp
440 real(FMS_HI_KIND_),
intent(in),
dimension(:,:) :: lon_in
442 real(FMS_HI_KIND_),
intent(in),
dimension(:,:) :: lat_in
444 real(FMS_HI_KIND_),
intent(in),
dimension(:,:) :: lon_out
446 real(FMS_HI_KIND_),
intent(in),
dimension(:,:) :: lat_out
448 logical,
intent(in) :: src_modulo
451 integer :: nlon_in, nlat_in, nlon_out, nlat_out
452 integer :: max_step, n, m, l, i, j, ip1, jp1, step
453 integer :: is, js, jstart, jend, istart, iend, npts
454 integer,
allocatable,
dimension(:) :: ilon, jlat
455 real(FMS_HI_KIND_) :: lon_min, lon_max, lon, lat, tpi
457 real(FMS_HI_KIND_) :: lon1, lat1, lon2, lat2, lon3, lat3, lon4, lat4
458 integer,
parameter :: kindl=fms_hi_kind_
460 tpi = 2.0_kindl*real(pi, fms_hi_kind_)
461 nlon_in =
size(lon_in,1) ; nlat_in =
size(lat_in,2)
462 nlon_out =
size(lon_out,1); nlat_out =
size(lon_out,2)
464 lon_min = minval(lon_in);
465 lon_max = maxval(lon_in);
467 max_step = max(nlon_in,nlat_in)
468 allocate(ilon(5*max_step), jlat(5*max_step) )
477 if(lon .lt. lon_min)
then
479 else if(lon .gt. lon_max)
then
483 if(lon .lt. lon_min .or. lon .gt. lon_max ) &
484 call mpp_error(fatal,
'horiz_interp_bilinear_mod: ' //&
485 'when input grid is not modulo, output grid should locate inside input grid')
488 if(m==1 .and. n==1)
then
489 j_loop:
do j = 1, nlat_in-1
500 lon1 = lon_in(i, j); lat1 = lat_in(i,j)
501 lon2 = lon_in(ip1,j); lat2 = lat_in(ip1,j)
502 lon3 = lon_in(ip1,jp1); lat3 = lat_in(ip1,jp1)
503 lon4 = lon_in(i, jp1); lat4 = lat_in(i, jp1)
505 if(lon .lt. lon_min .or. lon .gt. lon_max)
then
506 if(i .ne. nlon_in)
then
509 if(lon .lt. lon_min)
then
510 lon1 = lon1 -tpi; lon4 = lon4 - tpi
511 else if(lon .gt. lon_max)
then
512 lon2 = lon2 +tpi; lon3 = lon3 + tpi
517 if(lat .ge. intersect(lon1,lat1,lon2,lat2,lon))
then
518 if(lon .le. intersect(lat2,lon2,lat3,lon3,lat))
then
519 if(lat .le. intersect(lon3,lat3,lon4,lat4,lon))
then
520 if(lon .ge. intersect(lat4,lon4,lat1,lon1,lat))
then
522 interp % i_lon (m,n,1) = i; interp % i_lon (m,n,2) = ip1
523 interp % j_lat (m,n,1) = j; interp % j_lat (m,n,2) = jp1
533 do while ( .not. found .and. step .lt. max_step )
536 is = interp % i_lon (m,n-1,1)
537 js = interp % j_lat (m,n-1,1)
539 is = interp % i_lon (m-1,n,1)
540 js = interp % j_lat (m-1,n,1)
549 jstart = max(js-step,1)
550 jend = min(js+step,nlat_in)
557 else if (i > nlon_in)
then
560 if( i < 1 .or. i > nlon_in)
call mpp_error(fatal, &
561 'horiz_interp_bilinear_mod: max_step is too big, decrease max_step' )
563 if( i < 1 .or. i > nlon_in) cycle
575 if( istart < 1) istart = istart + nlon_in
576 if( iend > nlon_in) iend = iend - nlon_in
578 istart = max(istart,1)
579 iend = min(iend, nlon_in)
583 if( j < 1 .or. j > nlat_in .or. j==jstart .or. j==jend) cycle
599 else if (i > nlon_in)
then
602 if( i < 1 .or. i > nlon_in)
call mpp_error(fatal, &
603 'horiz_interp_bilinear_mod: max_step is too big, decrease max_step' )
605 if( i < 1 .or. i > nlon_in) cycle
629 if(jp1>nlat_in) cycle
630 lon1 = lon_in(i, j); lat1 = lat_in(i,j)
631 lon2 = lon_in(ip1,j); lat2 = lat_in(ip1,j)
632 lon3 = lon_in(ip1,jp1); lat3 = lat_in(ip1,jp1)
633 lon4 = lon_in(i, jp1); lat4 = lat_in(i, jp1)
635 if(lon .lt. lon_min .or. lon .gt. lon_max)
then
636 if(i .ne. nlon_in)
then
639 if(lon .lt. lon_min)
then
640 lon1 = lon1 -tpi; lon4 = lon4 - tpi
641 else if(lon .gt. lon_max)
then
642 lon2 = lon2 +tpi; lon3 = lon3 + tpi
647 if(lat .ge. intersect(lon1,lat1,lon2,lat2,lon))
then
648 if(lon .le. intersect(lat2,lon2,lat3,lon3,lat))
then
649 if(lat .le. intersect(lon3,lat3,lon4,lat4,lon))
then
650 if(lon .ge. intersect(lat4,lon4,lat1,lon1,lat))
then
653 interp % i_lon (m,n,1) = i; interp % i_lon (m,n,2) = ip1
654 interp % j_lat (m,n,1) = j; interp % j_lat (m,n,2) = jp1
665 print *,
'lon,lat=',lon*180.0_kindl/real(pi,fms_hi_kind_),lat*180.0_kindl/real(pi,fms_hi_kind_)
667 print *,
'is,ie= ',istart,iend
668 print *,
'js,je= ',jstart,jend
669 print *,
'lon_in(is,js)=',lon_in(istart,jstart)*180.0_kindl/real(pi,fms_hi_kind_)
670 print *,
'lon_in(ie,js)=',lon_in(iend,jstart)*180.0_kindl/real(pi,fms_hi_kind_)
671 print *,
'lat_in(is,js)=',lat_in(istart,jstart)*180.0_kindl/real(pi,fms_hi_kind_)
672 print *,
'lat_in(ie,js)=',lat_in(iend,jstart)*180.0_kindl/real(pi,fms_hi_kind_)
673 print *,
'lon_in(is,je)=',lon_in(istart,jend)*180.0_kindl/real(pi,fms_hi_kind_)
674 print *,
'lon_in(ie,je)=',lon_in(iend,jend)*180.0_kindl/real(pi,fms_hi_kind_)
675 print *,
'lat_in(is,je)=',lat_in(istart,jend)*180.0_kindl/real(pi,fms_hi_kind_)
676 print *,
'lat_in(ie,je)=',lat_in(iend,jend)*180.0_kindl/real(pi,fms_hi_kind_)
678 call mpp_error(fatal, &
679 'FIND_NEIGHBOR_: the destination point is not inside the source grid' )
684 end subroutine find_neighbor_
692 function inside_polygon_(polyx, polyy, x, y)
693 real(FMS_HI_KIND_),
dimension(:),
intent(in) :: polyx
695 real(FMS_HI_KIND_),
dimension(:),
intent(in) :: polyy
697 real(FMS_HI_KIND_),
intent(in) :: x
699 real(FMS_HI_KIND_),
intent(in) :: y
701 logical :: INSIDE_POLYGON_
702 integer :: i, j, nedges
703 real(FMS_HI_KIND_) :: xx
705 inside_polygon_ = .false.
706 nedges =
size(polyx(:))
709 if( (polyy(i) < y .AND. polyy(j) >= y) .OR. (polyy(j) < y .AND. polyy(i) >= y) )
then
710 xx = polyx(i)+(y-polyy(i))/(polyy(j)-polyy(i))*(polyx(j)-polyx(i))
712 inside_polygon_ = .true.
714 else if( xx < x )
then
715 inside_polygon_ = .not. inside_polygon_
730 subroutine find_neighbor_new_( Interp, lon_in, lat_in, lon_out, lat_out, src_modulo, no_crash )
731 type(horiz_interp_type),
intent(inout) :: Interp
733 real(FMS_HI_KIND_),
intent(in),
dimension(:,:) :: lon_in
735 real(FMS_HI_KIND_),
intent(in),
dimension(:,:) :: lat_in
737 real(FMS_HI_KIND_),
intent(in),
dimension(:,:) :: lon_out
739 real(FMS_HI_KIND_),
intent(in),
dimension(:,:) :: lat_out
741 logical,
intent(in) :: src_modulo
743 logical,
intent(in) :: no_crash
746 integer :: nlon_in, nlat_in, nlon_out, nlat_out
747 integer :: max_step, n, m, l, i, j, ip1, jp1, step
748 integer :: is, js, jstart, jend, istart, iend, npts
749 integer,
allocatable,
dimension(:) :: ilon, jlat
750 real(FMS_HI_KIND_) :: lon_min, lon_max, lon, lat, tpi
752 real(FMS_HI_KIND_) :: polyx(4), polyy(4)
753 real(FMS_HI_KIND_) :: min_lon, min_lat, max_lon, max_lat
754 integer,
parameter :: step_div=8, kindl = fms_hi_kind_
756 tpi = 2.0_kindl * real(pi, fms_hi_kind_)
757 nlon_in =
size(lon_in,1) ; nlat_in =
size(lat_in,2)
758 nlon_out =
size(lon_out,1); nlat_out =
size(lon_out,2)
760 lon_min = minval(lon_in);
761 lon_max = maxval(lon_in);
763 max_step = min(nlon_in,nlat_in)/step_div
764 allocate(ilon(step_div*max_step), jlat(step_div*max_step) )
773 if(lon .lt. lon_min)
then
775 else if(lon .gt. lon_max)
then
779 if(lon .lt. lon_min .or. lon .gt. lon_max ) &
780 call mpp_error(fatal,
'horiz_interp_bilinear_mod: ' //&
781 'when input grid is not modulo, output grid should locate inside input grid')
784 if(m==1 .and. n==1)
then
785 j_loop:
do j = 1, nlat_in-1
797 polyx(1) = lon_in(i, j); polyy(1) = lat_in(i,j)
798 polyx(2) = lon_in(ip1,j); polyy(2) = lat_in(ip1,j)
799 polyx(3) = lon_in(ip1,jp1); polyy(3) = lat_in(ip1,jp1)
800 polyx(4) = lon_in(i, jp1); polyy(4) = lat_in(i, jp1)
801 if(lon .lt. lon_min .or. lon .gt. lon_max)
then
802 if(i .ne. nlon_in)
then
805 if(lon .lt. lon_min)
then
806 polyx(1) = polyx(1) -tpi; polyx(4) = polyx(4) - tpi
807 else if(lon .gt. lon_max)
then
808 polyx(2) = polyx(2) +tpi; polyx(3) = polyx(3) + tpi
813 min_lon = minval(polyx)
814 max_lon = maxval(polyx)
815 min_lat = minval(polyy)
816 max_lat = maxval(polyy)
824 if(inside_polygon_(polyx, polyy, lon, lat))
then
827 interp % i_lon (m,n,1) = i; interp % i_lon (m,n,2) = ip1
828 interp % j_lat (m,n,1) = j; interp % j_lat (m,n,2) = jp1
835 do while ( .not. found .and. step .lt. max_step )
838 is = interp % i_lon (m,n-1,1)
839 js = interp % j_lat (m,n-1,1)
841 is = interp % i_lon (m-1,n,1)
842 js = interp % j_lat (m-1,n,1)
851 jstart = max(js-step,1)
852 jend = min(js+step,nlat_in)
859 else if (i > nlon_in)
then
862 if( i < 1 .or. i > nlon_in)
call mpp_error(fatal, &
863 'horiz_interp_bilinear_mod: max_step is too big, decrease max_step' )
865 if( i < 1 .or. i > nlon_in) cycle
880 if( istart < 1) istart = istart + nlon_in
881 if( iend > nlon_in) iend = iend - nlon_in
883 istart = max(istart,1)
884 iend = min(iend, nlon_in)
888 if( j < 1 .or. j > nlat_in) cycle
911 if(jp1>nlat_in) cycle
912 polyx(1) = lon_in(i, j); polyy(1) = lat_in(i,j)
913 polyx(2) = lon_in(ip1,j); polyy(2) = lat_in(ip1,j)
914 polyx(3) = lon_in(ip1,jp1); polyy(3) = lat_in(ip1,jp1)
915 polyx(4) = lon_in(i, jp1); polyy(4) = lat_in(i, jp1)
916 if(inside_polygon_(polyx, polyy, lon, lat))
then
918 interp % i_lon (m,n,1) = i; interp % i_lon (m,n,2) = ip1
919 interp % j_lat (m,n,1) = j; interp % j_lat (m,n,2) = jp1
928 interp % i_lon (m,n,1:2) = dummy
929 interp % j_lat (m,n,1:2) = dummy
930 print*,
'lon,lat=',lon,lat
932 call mpp_error(fatal, &
933 'horiz_interp_bilinear_mod: the destination point is not inside the source grid' )
939 end subroutine find_neighbor_new_
945 function intersect_(x1, y1, x2, y2, x)
946 real(FMS_HI_KIND_),
intent(in) :: x1
947 real(FMS_HI_KIND_),
intent(in) :: y1
948 real(FMS_HI_KIND_),
intent(in) :: x2
949 real(FMS_HI_KIND_),
intent(in) :: y2
950 real(FMS_HI_KIND_),
intent(in) :: x
951 real(FMS_HI_KIND_) :: INTERSECT_
953 intersect_ = (y2-y1)*(x-x1)/(x2-x1) + y1
957 end function intersect_
964 subroutine horiz_interp_bilinear_ ( Interp, data_in, data_out, verbose, mask_in,mask_out, &
965 missing_value, missing_permit, new_handle_missing )
967 type (horiz_interp_type),
intent(in) :: Interp
969 real(FMS_HI_KIND_),
intent(in),
dimension(:,:) :: data_in
971 real(FMS_HI_KIND_),
intent(out),
dimension(:,:) :: data_out
973 integer,
intent(in),
optional :: verbose
975 real(FMS_HI_KIND_),
intent(in),
dimension(:,:),
optional :: mask_in
978 real(FMS_HI_KIND_),
intent(out),
dimension(:,:),
optional :: mask_out
980 real(FMS_HI_KIND_),
intent(in),
optional :: missing_value
982 integer,
intent(in),
optional :: missing_permit
984 logical,
intent(in),
optional :: new_handle_missing
987 integer :: nlon_in, nlat_in, nlon_out, nlat_out, n, m, &
988 is, ie, js, je, iverbose, max_missing, num_missing, &
989 miss_in, miss_out, iunit
990 real(FMS_HI_KIND_) :: dwtsum, wtsum, min_in, max_in, avg_in, &
991 min_out, max_out, avg_out, wtw, wte, wts, wtn
992 real(FMS_HI_KIND_) :: mask(size(data_in,1), size(data_in,2) )
993 logical :: set_to_missing, is_missing(4), new_handler
994 real(FMS_HI_KIND_) :: f1, f2, f3, f4, middle, w, s
995 integer,
parameter :: kindl = fms_hi_kind_
999 nlon_in = interp%nlon_src; nlat_in = interp%nlat_src
1000 nlon_out = interp%nlon_dst; nlat_out = interp%nlat_dst
1002 if(
present(mask_in))
then
1008 if (
present(verbose))
then
1014 if(
present(missing_permit))
then
1015 max_missing = missing_permit
1020 if(
present(new_handle_missing))
then
1021 new_handler = new_handle_missing
1023 new_handler = .false.
1026 if(max_missing .gt. 3 .or. max_missing .lt. 0)
call mpp_error(fatal, &
1027 'horiz_interp_bilinear_mod: missing_permit should be between 0 and 3')
1029 if (
size(data_in,1) /= nlon_in .or.
size(data_in,2) /= nlat_in) &
1030 call mpp_error(fatal,
'horiz_interp_bilinear_mod: size of input array incorrect')
1032 if (
size(data_out,1) /= nlon_out .or.
size(data_out,2) /= nlat_out) &
1033 call mpp_error(fatal,
'horiz_interp_bilinear_mod: size of output array incorrect')
1035 if(new_handler)
then
1036 if( .not.
present(missing_value) )
call mpp_error(fatal, &
1037 "horiz_interp_bilinear_mod: misisng_value must be present when new_handle_missing is .true.")
1038 if(
present(mask_in) )
call mpp_error(fatal, &
1039 "horiz_interp_bilinear_mod: mask_in should not be present when new_handle_missing is .true.")
1042 is = interp % i_lon (m,n,1); ie = interp % i_lon (m,n,2)
1043 js = interp % j_lat (m,n,1); je = interp % j_lat (m,n,2)
1044 wtw = interp % HI_KIND_TYPE_ % wti (m,n,1)
1045 wte = interp % HI_KIND_TYPE_ % wti (m,n,2)
1046 wts = interp % HI_KIND_TYPE_ % wtj (m,n,1)
1047 wtn = interp % HI_KIND_TYPE_ % wtj (m,n,2)
1049 is_missing = .false.
1051 set_to_missing = .false.
1052 if(data_in(is,js) == missing_value)
then
1053 num_missing = num_missing+1
1054 is_missing(1) = .true.
1055 if(wtw .GE. 0.5_kindl .AND. wts .GE. 0.5_kindl) set_to_missing = .true.
1058 if(data_in(ie,js) == missing_value)
then
1059 num_missing = num_missing+1
1060 is_missing(2) = .true.
1061 if(wte .GE. 0.5_kindl .AND. wts .GE. 0.5_kindl ) set_to_missing = .true.
1063 if(data_in(ie,je) == missing_value)
then
1064 num_missing = num_missing+1
1065 is_missing(3) = .true.
1066 if(wte .GE. 0.5_kindl .AND. wtn .GE. 0.5_kindl ) set_to_missing = .true.
1068 if(data_in(is,je) == missing_value)
then
1069 num_missing = num_missing+1
1070 is_missing(4) = .true.
1071 if(wtw .GE. 0.5_kindl .AND. wtn .GE. 0.5_kindl) set_to_missing = .true.
1074 if( num_missing == 4 .OR. set_to_missing )
then
1075 data_out(m,n) = missing_value
1076 if(
present(mask_out)) mask_out(m,n) = 0.0_kindl
1078 else if(num_missing == 0)
then
1085 else if(num_missing == 3)
then
1086 if(.not. is_missing(1) )
then
1087 data_out(m,n) = data_in(is,js)
1088 else if(.not. is_missing(2) )
then
1089 data_out(m,n) = data_in(ie,js)
1090 else if(.not. is_missing(3) )
then
1091 data_out(m,n) = data_in(ie,je)
1092 else if(.not. is_missing(4) )
then
1093 data_out(m,n) = data_in(is,je)
1095 if(
present(mask_out) ) mask_out(m,n) = 1.0_kindl
1098 if( num_missing == 1)
then
1099 if( is_missing(1) .OR. is_missing(3) )
then
1100 middle = 0.5_kindl *(data_in(ie,js)+data_in(is,je))
1102 middle = 0.5_kindl *(data_in(is,js)+data_in(ie,je))
1105 if( is_missing(1) .AND. is_missing(2) )
then
1106 middle = 0.5_kindl *(data_in(ie,je)+data_in(is,je))
1107 else if( is_missing(1) .AND. is_missing(3) )
then
1108 middle = 0.5_kindl *(data_in(ie,js)+data_in(is,je))
1109 else if( is_missing(1) .AND. is_missing(4) )
then
1110 middle = 0.5_kindl *(data_in(ie,js)+data_in(ie,je))
1111 else if( is_missing(2) .AND. is_missing(3) )
then
1112 middle = 0.5_kindl *(data_in(is,js)+data_in(is,je))
1113 else if( is_missing(2) .AND. is_missing(4) )
then
1114 middle = 0.5_kindl*(data_in(is,js)+data_in(ie,je))
1115 else if( is_missing(3) .AND. is_missing(4) )
then
1116 middle = 0.5_kindl*(data_in(is,js)+data_in(ie,js))
1120 if( wtw .GE. 0.5_kindl .AND. wts .GE. 0.5_kindl )
then
1121 w = 2.0_kindl*(wtw-0.5_kindl)
1122 s = 2.0_kindl*(wts-0.5_kindl)
1124 if(is_missing(2))
then
1127 f2 = 0.5_kindl*(data_in(is,js)+data_in(ie,js))
1130 if(is_missing(4))
then
1133 f4 = 0.5_kindl*(data_in(is,js)+data_in(is,je))
1135 else if( wte .GE. 0.5_kindl .AND. wts .GE. 0.5_kindl )
then
1136 w = 2.0_kindl*(1.0_kindl-wte)
1137 s = 2.0_kindl*(wts-0.5_kindl)
1139 if(is_missing(1))
then
1142 f1 = 0.5_kindl*(data_in(is,js)+data_in(ie,js))
1145 if(is_missing(3))
then
1148 f3 = 0.5_kindl*(data_in(ie,js)+data_in(ie,je))
1150 else if( wte .GE. 0.5_kindl .AND. wtn .GE. 0.5_kindl )
then
1151 w = 2.0_kindl*(1.0_kindl-wte)
1152 s = 2.0_kindl*(1.0_kindl-wtn)
1154 if(is_missing(2))
then
1157 f2 = 0.5_kindl*(data_in(ie,js)+data_in(ie,je))
1160 if(is_missing(4))
then
1163 f4 = 0.5_kindl*(data_in(ie,je)+data_in(is,je))
1165 else if( wtw .GE. 0.5_kindl .AND. wtn .GE. 0.5_kindl )
then
1166 w = 2.0_kindl*(wtw-0.5_kindl)
1167 s = 2.0_kindl*(1.0_kindl-wtn)
1169 if(is_missing(1))
then
1172 f1 = 0.5_kindl*(data_in(is,js)+data_in(is,je))
1175 if(is_missing(3))
then
1178 f3 = 0.5_kindl*(data_in(ie,je)+data_in(is,je))
1181 call mpp_error(fatal, &
1182 "horiz_interp_bilinear_mod: the point should be in one of the four zone")
1186 data_out(m,n) = f3 + (f4-f3)*w + (f2-f3)*s + ((f1-f2)+(f3-f4))*w*s
1187 if(
present(mask_out)) mask_out(m,n) = 1.0_kindl
1193 is = interp % i_lon (m,n,1); ie = interp % i_lon (m,n,2)
1194 js = interp % j_lat (m,n,1); je = interp % j_lat (m,n,2)
1195 wtw = interp % HI_KIND_TYPE_ % wti (m,n,1)
1196 wte = interp % HI_KIND_TYPE_ % wti (m,n,2)
1197 wts = interp % HI_KIND_TYPE_ % wtj (m,n,1)
1198 wtn = interp % HI_KIND_TYPE_ % wtj (m,n,2)
1200 if(
present(missing_value) )
then
1202 if(data_in(is,js) == missing_value)
then
1203 num_missing = num_missing+1
1204 mask(is,js) = 0.0_kindl
1206 if(data_in(ie,js) == missing_value)
then
1207 num_missing = num_missing+1
1208 mask(ie,js) = 0.0_kindl
1210 if(data_in(ie,je) == missing_value)
then
1211 num_missing = num_missing+1
1212 mask(ie,je) = 0.0_kindl
1214 if(data_in(is,je) == missing_value)
then
1215 num_missing = num_missing+1
1216 mask(is,je) = 0.0_kindl
1220 dwtsum = data_in(is,js)*mask(is,js)*wtw*wts &
1221 + data_in(ie,js)*mask(ie,js)*wte*wts &
1222 + data_in(ie,je)*mask(ie,je)*wte*wtn &
1223 + data_in(is,je)*mask(is,je)*wtw*wtn
1224 wtsum = mask(is,js)*wtw*wts + mask(ie,js)*wte*wts &
1225 + mask(ie,je)*wte*wtn + mask(is,je)*wtw*wtn
1227 if(.not.
present(mask_in) .and. .not.
present(missing_value)) wtsum = 1.0_kindl
1229 if(num_missing .gt. max_missing )
then
1230 data_out(m,n) = missing_value
1231 if(
present(mask_out)) mask_out(m,n) = 0.0_kindl
1232 else if(wtsum .lt. real(epsln, fms_hi_kind_))
then
1233 if(
present(missing_value))
then
1234 data_out(m,n) = missing_value
1236 data_out(m,n) = 0.0_kindl
1238 if(
present(mask_out)) mask_out(m,n) = 0.0_kindl
1240 data_out(m,n) = dwtsum/wtsum
1241 if(
present(mask_out)) mask_out(m,n) = wtsum
1249 if (iverbose > 0)
then
1253 call stats (data_in, min_in, max_in, avg_in, miss_in, missing_value, mask_in)
1256 call stats (data_out, min_out, max_out, avg_out, miss_out, missing_value, mask_out)
1261 write (iunit,901) min_in ,max_in, avg_in
1262 if (
present(mask_in))
write (iunit,903) miss_in
1263 write (iunit,902) min_out,max_out,avg_out
1264 if (
present(mask_out))
write (iunit,903) miss_out
1266 900
format (/,1x,10(
'-'),
' output from horiz_interp ',10(
'-'))
1267 901
format (
' input: min=',f16.9,
' max=',f16.9,
' avg=',f22.15)
1268 902
format (
' output: min=',f16.9,
' max=',f16.9,
' avg=',f22.15)
1269 903
format (
' number of missing points = ',i6)
1275 end subroutine horiz_interp_bilinear_
1280 subroutine horiz_interp_read_weights_bilinear_(Interp, weight_filename, lon_out, lat_out, lon_in, lat_in, &
1281 weight_file_source, interp_method, isw, iew, jsw, jew, nglon, nglat)
1282 type(horiz_interp_type),
intent(inout) :: Interp
1284 character(len=*),
intent(in) :: weight_filename
1286 real(FMS_HI_KIND_),
target,
intent(in) :: lat_out(:,:)
1288 real(FMS_HI_KIND_),
target,
intent(in) :: lon_out(:,:)
1290 real(FMS_HI_KIND_),
intent(in) :: lat_in(:)
1292 real(FMS_HI_KIND_),
intent(in) :: lon_in(:)
1294 character(len=*),
intent(in) :: weight_file_source
1296 character(len=*),
intent(in) :: interp_method
1298 integer,
intent(in) :: isw
1300 integer,
intent(in) :: iew
1302 integer,
intent(in) :: jsw
1304 integer,
intent(in) :: jew
1306 integer,
intent(in) :: nglon
1308 integer,
intent(in) :: nglat
1311 real(FMS_HI_KIND_),
allocatable :: var(:,:,:)
1312 type(FmsNetcdfFile_t) :: weight_fileobj
1316 if (.not. open_file(weight_fileobj, weight_filename,
"read" )) &
1317 call mpp_error(fatal,
"Error opening the weight file:"//&
1318 &trim(weight_filename))
1321 select case (trim(weight_file_source))
1323 call get_dimension_size(weight_fileobj,
"nlon", nlon)
1324 if (nlon .ne. nglon) &
1325 call mpp_error(fatal,
"The nlon from the weight file is not the same as in the input grid."//&
1326 &
" From weight file:"//string(nlon)//
" from input grid:"//string(
size(lon_out,1)))
1327 call get_dimension_size(weight_fileobj,
"nlat", nlat)
1328 if (nlat .ne. nglat) &
1329 call mpp_error(fatal,
"The nlat from the weight file is not the same as in the input grid."//&
1330 &
" From weight file:"//string(nlat)//
" from input grid:"//string(
size(lon_out,2)))
1332 call mpp_error(fatal, trim(weight_file_source)//&
1333 &
" is not a supported weight file source. fregrid is the only supported weight file source." )
1336 interp%nlon_src =
size(lon_in(:)) ; interp%nlat_src =
size(lat_in(:))
1337 interp%nlon_dst =
size(lon_out,1); interp%nlat_dst =
size(lon_out,2)
1339 allocate ( interp % HI_KIND_TYPE_ % wti (interp%nlon_dst,interp%nlat_dst,2), &
1340 interp % HI_KIND_TYPE_ % wtj (interp%nlon_dst,interp%nlat_dst,2), &
1341 interp % i_lon (interp%nlon_dst,interp%nlat_dst,2), &
1342 interp % j_lat (interp%nlon_dst,interp%nlat_dst,2))
1347 allocate(var(interp%nlon_dst,interp%nlat_dst, 3))
1348 call read_data(weight_fileobj,
"index", var, corner=(/isw, jsw, 1/), edge_lengths=(/iew-isw+1, jew-jsw+1, 3/))
1352 interp % i_lon (:,:,1) = var(:,:,1)
1353 interp % i_lon (:,:,2) = interp % i_lon (:,:,1) + 1
1354 where (interp % i_lon (:,:,2) >
size(lon_in(:))) interp % i_lon (:,:,2) = 1
1356 interp % j_lat (:,:,1) = var(:,:,2)
1357 interp % j_lat (:,:,2) = interp % j_lat (:,:,1) + 1
1358 where (interp % j_lat (:,:,2) >
size(lat_in(:))) interp % j_lat (:,:,2) = 1
1362 allocate(var(interp%nlon_dst,interp%nlat_dst, 4))
1363 call read_data(weight_fileobj,
"weight", var, corner=(/isw, jsw, 1/), edge_lengths=(/iew-isw+1, jew-jsw+1, 4/))
1370 interp % HI_KIND_TYPE_ % wti = var(:,:,1:2)
1371 interp % HI_KIND_TYPE_ % wtj = var(:,:,3:4)
1374 interp% HI_KIND_TYPE_ % is_allocated = .true.
1375 interp% interp_method = bilinear
1376 interp% I_am_initialized = .true.
1377 call close_file(weight_fileobj)
1378 end subroutine horiz_interp_read_weights_bilinear_
integer function stdout()
This function returns the current standard fortran unit numbers for output.