|
|
1.1 root 1: .ds ZZ DEVELOPMENT PACKAGE
2: .TH JELLIPSE 3L "630 MTG"
3: .XE "jellipse()"
4: .XE "jeldisc()"
5: .XE "jelarc()"
6: .SH NAME
7: jellipse, jeldisc, jelarc \- draw ellipse on display
8: .SH SYNOPSIS
9: .B #include <dmd.h>
10: .sp
11: .B void jellipse (p, a, b, f)
12: .PP
13: .B void jeldisc (p, a, b, f)
14: .PP
15: \fBvoid jelarc (p, a, b, p1, p2, f)\fR
16: .PP
17: .B Point p, p1, p2;
18: .br
19: .B int a, b;
20: .br
21: .B Code f;
22: .SH DESCRIPTION
23: The
24: .I jellipse
25: function
26: draws
27: an approximate ellipse centered at
28: .IR p ,
29: with horizontal semi-axis
30: .I a
31: and vertical semi-axis
32: .I b
33: with Code
34: .IR f
35: in the display bitmap.
36: .PP
37: The
38: .I jeldisc
39: function
40: draws an elliptical disc centered at
41: .IR p ,
42: with horizontal semi-axis
43: .I a
44: and vertical semi-axis
45: .I b
46: with Code
47: .IR f
48: in the display bitmap.
49: .PP
50: The
51: .I jelarc
52: function
53: draws the corresponding elliptical arc,
54: centered at
55: .IR p ,
56: counterclockwise from the ellipse point closest to
57: .I p1
58: to the ellipse point closest to
59: .I p2
60: with Code
61: .IR f
62: in the display bitmap.
63: .PP
64: All coordinates and semi-axes are in window coordinates.
65: .SH EXAMPLE
66: The following routine draws a row of eight ellipses,
67: a row of eight discs, and a row of eight arcs, scaled
68: to the shape of the window.
69: .PP
70: .RS 3
71: .ft CM
72: .nf
73: #include <dmd.h>
74:
75: draw()
76: {
77: Point p;
78: int i, r;
79:
80: r = 50;
81: p.y = 200;
82: for ( p.x=100; p.x < XMAX-50; p.x+=120)
83: jellipse (p, r, r-25, F_XOR);
84: p.y = 600;
85: for ( p.x=100; p.x < XMAX-50; p.x+=120)
86: jeldisc (p, r-25, r, F_XOR);
87: p.y = 900;
88: for (p.x=100; p.x < XMAX-50; p.x+=120)
89: jelarc (p, r, r, Pt(p.x-r, p.y),
90: Pt(p.x+r, p.y), F_XOR);
91:
92: request(KBD);
93: wait(KBD);
94: }
95: .fi
96: .RE
97: .ft R
98: .SH SEE ALSO
99: circle(3L), ellipse(3L), globals(3R), jcircle(3L),
100: structures(3R), transform(3R/3L).
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.