|
|
1.1 root 1: .TH VIEW2D 3X
2: .CT 2 graphics
3: .SH NAME
4: view2d, moviefil \(mi movie of a function f(x, y, t)
5: .SH SYNOPSIS
6: .nf
7: .B "view2d(fd, nx, ny, time, u, v, fixuv, pmin, pmax, p)"
8: .B short "p[];"
9: .B double time;
10: .PP
11: .B "moviefil(fd, nx, ny, time, outside, f)"
12: .B float "time, outside, f[];"
13: .fi
14: .SH DESCRIPTION
15: .I View2d
16: writes a frame in the format
17: .IR view2d (5)
18: onto the file specified by file descriptor
19: .I fd.
20: To load these routines, use the
21: .IR ld (1)
22: option
23: .BR -lview2d .
24: .I Nx, ny
25: give the grid size.
26: .I Time
27: is a (nondecreasing) frame index, typically set to simulation time
28: or iteration count.
29: .I U
30: and
31: .I v
32: describe the relation between pixel values and user function values:
33: .IP
34: .I p
35: =
36: .I u
37: +
38: \fIf\|\fR\(mu\|2\u\s7\-\fIv\fR\s0\d.
39: .LP
40: .I U
41: and
42: .I v
43: may vary from one frame to the next.
44: When the global scaling is known beforehand,
45: put
46: .I fixuv
47: = 1 and set
48: .I pmin
49: and
50: .I pmax
51: to the limits of the data.
52: (Otherwise put
53: .IR fixuv =0;
54: .I pmin
55: and
56: .I pmax
57: will be ignored.)
58: .PP
59: .I P
60: is the
61: .I nx
62: by
63: .I ny
64: array of pixel values,
65: with the
66: .I x
67: index running fastest.
68: There is a threshold for describing nonrectangular regions:
69: any pixel value less than or equal to
70: .L \%-32766
71: is treated as an
72: out-of-bounds marker and will appear as black.
73: Other pixel values should lie in the range
74: .L
75: \%-32765..32765
76: inclusive.
77: .PP
78: .I Moviefil
79: is an alternate version that
80: is somewhat less flexible
81: but easier to use.
82: It takes floats
83: and scales automatically to shorts.
84: An element of
85: .I f
86: less than
87: .I outside
88: is treated as undefined and will appear as black.
89: .SH "SEE ALSO"
90: .IR view2d (1),
91: .IR view2d (5)
92: .SH BUGS
93: The array arguments are 2-D Fortran arrays.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.