[Thread Prev][Thread Next][Index]

Re: sub-REGIONS of three-arguments (curvilinear) SHADE,FILL,CONTOURand VECTOR



  Hi.

I am not sure if this will fix your problem, but what if you use
the hlimit and vlimit options?

  shade/hlimit=10:20/vlimit=....... temp, lon, lat


  - Jeremy


On Tue, 12 Mar 2002 emanuele.lombardi@casaccia.enea.it wrote:

> Dear Ferreters,
> here I am asking again for your help.
> 
> My data is defined on axis which are 2 dimensional. I shade the data
> using
> 	yes? set REGION/K=1/L=1
> 	yes? SHADE temp, lon, lat
> 
> where lon and lat are 2 dimensional arrays.
> lon    contains nx*ny longitudes 
> lat    contains nx*ny latitudes 
> temp   contains nx*ny temperatures at each level/time
> 
> Now I would like to shade subregions of the area using X and Y values I
> get from a java applet. For istance, If I want to shade only the area
> which longitudes lies between 10 and 20 degrees_east, I do the following
> 
> 	yes? set region/X=10:20/Y=.......
> 
> BUT the X axis doesn't exists for any variable AND I don't know how to
> create it since it should be made up of a bidimensional array of values.
> 
> I'm aware I could define the region using I & J instead of X & Y, but I
> prefere to use directely X and Y values coming from he applet without
> any conversion.
> 
> I see this is a much difficult question than the yesteday's one, 
> so I thank you in advance for any help!
> 
> Emanuele
> 
> 
> 
> 
> PS. here the ncdump -h of my file
> 
> 
> netcdf tipo1a {
> dimensions:
>         time = UNLIMITED ; // (13 currently)
>         nz = 40 ;
>         ny = 98 ;
>         nx = 162 ;
> variables:
>         double time(time) ;
>                 time:var_code = 1000 ;
>                 time:long_name = "time" ;
>                 time:short_name = "time" ;
>                 time:units = "hours since 1962-05-10 00:00:00" ;
>                 time:coordinates = "time" ;
>                 time:axis = "T" ;
>         float sigma(nz) ;
>                 sigma:var_code = 5009 ;
>                 sigma:long_name = "vertical sigma level" ;
>                 sigma:short_name = "sigma level" ;
>                 sigma:units = "adim" ;
>                 sigma:coordinates = "nz" ;
>                 sigma:axis = "Z" ;
>        float lat(ny, nx) ;
>                 lat:var_code = 5000 ;
>                 lat:long_name = "latitudine" ;
>                 lat:short_name = "lat" ;
>                 lat:units = "degree_north" ;
>                 lat:coordinates = "nx ny" ;
>                 lat:axis = "Y" ;
>         float lon(ny, nx) ;
>                 lon:var_code = 5001 ;
>                 lon:long_name = "longitude" ;
>                 lon:short_name = "lon" ;
>                 lon:units = "degree_east" ;
>                 lon:coordinates = "nx ny" ;
>                 lon:axis = "X" ;
>         float temp(time, nz, ny, nx) ;
>                 temp:var_code = 10004 ;
>                 temp:long_name = "temperature" ;
>                 temp:short_name = "t" ;
>                 temp:units = "K" ;
>                 temp:coordinates = "time sigma lon lat" ;
> }
> 
> 
> -- 
> 
> $$$ Emanuele Lombardi
> $$$ mail:  ENEA  CLIM  Casaccia
> $$$        I-00060 S.M. di Galeria (RM)  ITALY
> $$$ mailto:emanuele.lombardi@casaccia.enea.it
> $$$ tel	+39 0630483366 
> $$$ fax	+39 0630484264             
> $$$                                \|/  ;_;
> $$$ What does a process need        |   /"\
> $$$ to become a daemon ?            |   \v/
> $$$                                 |    | 
> $$$ - a fork                        o---/!\---
> $$$                                 |   |_|
> $$$                                 |  _/ \_
> $$$* Contrary to popular belief, UNIX is user friendly.
> $$$  It's just very particular about who it makes friends with.
> $$$* Computers are not intelligent, but they think they are. 
> $$$* True programmers never die, they just branch to an odd address
> $$$* THIS TRANSMISSION WAS MADE POSSIBLE BY 100% RECYCLED ELECTRONS
> 
> 



[Thread Prev][Thread Next][Index]

Dept of Commerce / NOAA / OAR / PMEL / TMAP

Contact Us | Privacy Policy | Disclaimer | Accessibility Statement