|
|
1.1 root 1: .TH CIRCLE 9.3
2: .CT 2 graphics
3: .SH NAME
4: circle, disc, arc, ellipse, eldisc, elarc \- circle-drawing functions
5: .SH SYNOPSIS
6: .B #include <jerq.h>
7: .PP
8: .B void circle(bp, p, r, f)
9: .B "Bitmap *bp; Point p; int r; Code f;
10: .PP
11: .B void disc(bp, p, r, f)
12: .B "Bitmap *bp; Point p; int r; Code f;
13: .PP
14: .B void arc(bp, p0, p1, p2, f)
15: .B "Bitmap *bp; Point p0, p1, p2; Code f;
16: .PP
17: .B void ellipse(bp, p, a, b, f)
18: .B "Bitmap *bp; Point p; int a, b; Code f;
19: .PP
20: .B void eldisc(bp, p, a, b, f)
21: .B "Bitmap *bp; Point p; int a, b; Code f;
22: .PP
23: .B "void elarc(bp, p0, a, b, p1, p2, f)
24: .B "Bitmap *bp; Point p0, p1, p2; int a, b; Code f;
25: .SH DESCRIPTION
26: .I Circle
27: draws the best approximate circle of radius
28: .I r
29: centered at Point
30: .I p
31: in the Bitmap
32: .I bp
33: with Code
34: .IR f .
35: The circle is guaranteed to be symmetrical about the horizontal,
36: vertical and diagonal axes.
37: .I Disc
38: draws the corresponding disc.
39: .PP
40: .I Arc
41: draws a circular arc centered on
42: .IR p0 ,
43: traveling counter-clockwise
44: from
45: .I p1
46: to the point on the circle closest to
47: .IR p2 .
48: .PP
49: .I Ellipse
50: draws an ellipse centered at
51: .I p
52: with horizontal semi-axis
53: .I a
54: and vertical semi-axis
55: .I b
56: in Bitmap
57: .I bp
58: with Code
59: .IR f .
60: .IR Eldisc
61: draws the corresponding elliptical disc.
62: .I Elarc
63: draws the corresponding elliptical arc, traveling
64: counter-clockwise from the ellipse point closest to
65: .I p1
66: to the point closest to
67: .IR p2 .
68: (Beware the regrettable difference between the calling conventions for
69: .I arc
70: and
71: .IR elarc .)
72: .SH BUGS
73: When an endpoint of an arc lies near a tail of
74: an ellipse so thin that its ends degenerate into
75: straight lines,
76: .I elarc
77: does not try to distinguish which side of the tail the
78: point belongs on.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.