b'\n
\n
\n
\n
sftree
(4.0 Mtree.c 1575 2005-11-21 14:09:06Z fomels)
index
user/fomels/Mtree.c
\n Multiple arrivals with a fast algorithm. \n
\n
\n
\n
\n
Synopsis
\n \n
\n
sftree < vel.rsf > out.rsf na=361 da=1. a0=-180. vel=y order=3 debug=n
\n
\n
\n
\n
\n
Parameters
\n \n
\n
\n
\n
\n
\n
float
a0=-180.
\tfirst angle (in degrees)
\n
\n \n\n
\n
\n
\n
float
da=1.
\tangle increment (in degrees)
\n
\n \n\n
\n
\n
\n
bool
debug=n
[y/n]
\tdebugging flag
\n
\n \n\n
\n
\n
\n
int
na=361
\tnumber of angles
\n
\n \n\n
\n
\n
\n
int
order=3
\taccuracy order
\n
\n \n\n
\n
\n
\n
bool
vel=y
[y/n]
\ty: theinput is velocity; n: slowness
\n
\n \n
'