1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
|
/*
* Geo.h -- Header for common geometric routines.
*
* Authors : Patrick Lecoanet.
* Creation date :
*
* $Id$
*/
/*
* Copyright (c) 1993 - 1999 CENA, Patrick Lecoanet --
*
* This code is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This code is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public
* License along with this code; if not, write to the Free
* Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*
*/
#ifndef _Geo_h
#define _Geo_h
#include "Attrs.h"
#include "List.h"
#include <math.h>
#include <limits.h>
#ifndef MIN
#define MIN(a, b) ((a) <= (b) ? (a) : (b))
#endif
#ifndef MAX
#define MAX(a, b) ((a) >= (b) ? (a) : (b))
#endif
#ifndef ABS
#define ABS(a) ((a) < 0 ? -(a) : (a))
#endif
#ifndef M_PI
#define M_PI 3.14159265358979323846264338327
#endif
#ifndef M_PI_2
#define M_PI_2 1.57079632679489661923
#endif
#ifndef M_PI_4
#define M_PI_4 0.78539816339744830962
#endif
#define PRECISION_LIMIT 1.0e-10
#define X_PRECISION_LIMIT 5.0e-2
#define LINE_END_POINTS 6
#define DegreesToRadian(angle) \
(M_PI * (double) (angle) / 180.0)
#define RadianToDegrees(angle) \
(fmod((angle) * 180.0 / M_PI, 360.0))
#define RadianToDegrees360(angle) \
(fmod(RadianToDegrees(angle)+360.0,360.0))
#define REAL_TO_INT(d) \
(((int) ((d) + (((d) > 0) ? 0.5 : -0.5))))
void
POLY_INIT(ZnPoly *poly);
void
POLY_CONTOUR1(ZnPoly *poly,
ZnPoint *pts,
int num_pts);
void
POLY_SET(ZnPoly *poly1,
ZnPoly *poly2);
void
POLY_FREE(ZnPoly *poly);
void
Anchor2Origin(ZnPoint *position,
ZnDim width,
ZnDim height,
ZnAnchor anchor,
ZnPoint *origin);
void
Origin2Anchor(ZnPoint *origin,
ZnDim width,
ZnDim height,
ZnAnchor anchor,
ZnPoint *position);
void
BBox2XRect(ZnBBox *bbox,
XRectangle *rect);
void
GetStringBBox(char *str,
ZnFont font,
ZnPos x,
ZnPos y,
ZnBBox *str_bbox);
void
ResetBBox(ZnBBox *bbox);
void
CopyBBox(ZnBBox *bbox_from,
ZnBBox *bbox_to);
void
IntersectBBox(ZnBBox *bbox1,
ZnBBox *bbox2,
ZnBBox *bbox_inter);
ZnBool
IsEmptyBBox(ZnBBox *bbox);
void
AddBBoxToBBox(ZnBBox *bbox,
ZnBBox *bbox2);
void
AddPointToBBox(ZnBBox *bbox,
ZnPos px,
ZnPos py);
void
AddPointsToBBox(ZnBBox *bbox,
ZnPoint *points,
int num_points);
void
AddStringToBBox(ZnBBox *bbox,
char *str,
ZnFont font,
ZnPos cx,
ZnPos cy);
ZnBool
PointInBBox(ZnBBox *bbox,
ZnPos x,
ZnPos y);
int
LineInBBox(ZnPoint *p1,
ZnPoint *p2,
ZnBBox *bbox);
int
BBoxInBBox(ZnBBox *bbox1,
ZnBBox *bbox2);
int
PolylineInBBox(ZnPoint *points,
int num_points,
int width,
int cap_style,
int join_style,
ZnBBox *bbox);
int
PolygonInBBox(ZnPoint *points,
int num_points,
ZnBBox *bbox,
ZnBool *area_enclosed);
int
OvalInBBox(ZnPoint *center,
int width,
int height,
ZnBBox *bbox);
ZnBool
HorizLineToArc(ZnReal x1,
ZnReal x2,
ZnReal y,
ZnReal rx,
ZnReal ry,
ZnReal start_angle,
ZnReal angle_extent);
ZnBool
VertLineToArc(ZnReal x,
ZnReal y1,
ZnReal y2,
ZnReal rx,
ZnReal ry,
ZnReal start_angle,
ZnReal angle_extent);
ZnBool
PointInAngle(int start_angle,
int angle_extent,
ZnPoint *p);
void
PointPolarToCartesian(ZnReal heading,
int rho,
int theta,
int *delta_x,
int *delta_y);
ZnReal
ProjectionToAngle(ZnDim dx,
ZnDim dy);
double
RectangleToPointDist(ZnBBox *bbox,
ZnPoint *p);
double
LineToPointDist(ZnPoint *p1,
ZnPoint *p2,
ZnPoint *p);
double
PolygonToPointDist(ZnPoint *points,
int num_points,
ZnPoint *p);
double
PolylineToPointDist(ZnPoint *points,
int num_points,
int width,
int cap_style,
int join_style,
ZnPoint *p);
double
OvalToPointDist(ZnPoint *center,
int width,
int height,
unsigned int line_width,
ZnPoint *p);
void
GetButtPoints(ZnPoint *p1,
ZnPoint *p2,
int width,
ZnBool projecting,
ZnPoint *c1,
ZnPoint *c2);
ZnBool
GetMiterPoints(ZnPoint *p1,
ZnPoint *p2,
ZnPoint *p3,
int width,
ZnPoint *c1,
ZnPoint *c2);
ZnBool
IntersectLines(ZnPoint *a1,
ZnPoint *a2,
ZnPoint *b1,
ZnPoint *b2,
ZnPoint *pi);
void
ShiftLine(ZnPoint *p1,
ZnPoint *p2,
ZnReal dist,
ZnPoint *p3,
ZnPoint *p4);
void
InsetPolygon(ZnPoint *p,
int num_points,
ZnDim inset);
void
BezierSubdivide(ZnPoint *controls,
ZnReal t,
ZnBool first);
void
SmoothPathWithBezier(ZnPoint *from_points,
int num_points,
ZnList to_points);
void
GetBezierPath(ZnList from_points,
ZnList to_points);
ZnPoint *
GetCirclePoints(int type,
int quality,
ZnReal start_angle,
ZnReal end_angle,
int *num_points,
ZnList point_list);
void
GetArcPath(ZnReal start_angle,
ZnReal end_angle,
int type,
ZnList to_points);
void
FitBezier(ZnPoint *pts,
int num_points,
ZnReal error,
ZnList controls);
void
GetLineEnd(ZnPoint *p1,
ZnPoint *p2,
unsigned int line_width,
int cap_style,
ZnLineEnd end_style,
ZnPoint *points);
#endif /* _Geo_h */
|
