|
|
1.1 root 1: .TH SPLINE 1
2: .CT 1 numbers graphics
3: .SH NAME
4: spline \- fit a curve
5: .SH SYNOPSIS
6: .B spline
7: [
8: .I option ...
9: ]
10: .SH DESCRIPTION
11: .I Spline
12: is a filter that interpolates extra points in an
13: input list suitable for
14: .IR graph (1).
15: It is useful for making
16: smooth-looking curves with
17: .I graph
18: or with
19: .I grap (1).
20: .PP
21: The following options are recognized,
22: each as a separate argument.
23: .TP
24: .B -a
25: Similar to
26: .IR graph (1).
27: Supply abscissas automatically; no
28: .IR x -values
29: appear in the input.
30: Spacing is given by the next
31: argument (default 1).
32: A second optional argument is the starting point for
33: automatic abscissas (default 0,
34: or the lower limit given by
35: .BR -x ).
36: .TP
37: .B -x
38: Similar to
39: .I graph.
40: Next 1 (or 2) arguments are lower (and upper)
41: .I x
42: limits.
43: Normally these quantities are determined automatically.
44: .TP
45: .B -k
46: The constant
47: .I k
48: used in the boundary value computation
49: .IP
50: .if n .ig
51: .EQ
52: y sub 0 sup {prime prime}~=~ky sub 1 sup {prime prime} , ~~~
53: y sub n sup {prime prime}~=~ky sub n-1 sup {prime prime} , ~~~
54: .EN
55: ..
56: .if t .ig
57: .ce
58: (2nd deriv. at end) = k*(2nd deriv. next to end)
59: ..
60: .IP
61: is set by the next argument.
62: (Default
63: .I k
64: = 0.)
65: .TP
66: .B -n
67: Space output points
68: so that approximately
69: .I n
70: intervals occur between the lower and upper
71: .I x
72: limits.
73: (Default
74: .I n
75: = 100.)
76: .TP
77: .B -p
78: Make output periodic, i.e. match
79: derivatives at ends.
80: First and last input values should normally agree.
81: .SH SEE ALSO
82: .IR graph (1),
83: .IR grap (1),
84: .IR port (3)
85: .SH DIAGNOSTICS
86: When data are not strictly monotone in
87: .I x,
88: .I spline
89: simply reproduces its input.
90: .SH BUGS
91: .I Spline
92: quietly discards points after the first 1000.
93: .br
94: .I Spline's
95: curves exhibit the classic ills of piecewise cubics.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.