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
|
//----------------------------------------------------------------------------
// Anti-Grain Geometry - Version 2.3
// Copyright (C) 2002-2005 Maxim Shemanarev (http://www.antigrain.com)
//
// Permission to copy, use, modify, sell and distribute this software
// is granted provided this copyright notice appears in all copies.
// This software is provided "as is" without express or implied
// warranty, and with no claim as to its suitability for any purpose.
//
//----------------------------------------------------------------------------
// Contact: mcseem@antigrain.com
// mcseemagg@yahoo.com
// http://www.antigrain.com
//----------------------------------------------------------------------------
#ifndef AGG_VPGEN_CLIP_POLYLINE_INCLUDED
#define AGG_VPGEN_CLIP_POLYLINE_INCLUDED
#include "agg_basics.h"
namespace agg
{
//======================================================vpgen_clip_polyline
//
// See Implementation agg_vpgen_clip_polyline.cpp
//
class vpgen_clip_polyline
{
public:
vpgen_clip_polyline() :
m_clip_box(0, 0, 1, 1),
m_x1(0),
m_y1(0),
m_f1(0),
m_x2(0),
m_y2(0),
m_f2(0),
m_num_vertices(0),
m_vertex(0)
{
}
void clip_box(double _x1, double _y1, double _x2, double _y2)
{
m_clip_box.x1 = _x1;
m_clip_box.y1 = _y1;
m_clip_box.x2 = _x2;
m_clip_box.y2 = _y2;
m_clip_box.normalize();
}
double x1() const { return m_clip_box.x1; }
double y1() const { return m_clip_box.y1; }
double x2() const { return m_clip_box.x2; }
double y2() const { return m_clip_box.y2; }
static bool auto_close() { return false; }
static bool auto_unclose() { return true; }
void reset();
void move_to(double x, double y);
void line_to(double x, double y);
unsigned vertex(double* x, double* y);
private:
enum clipping_flags_def
{
clip_x1 = 1,
clip_x2 = 2,
clip_y1 = 4,
clip_y2 = 8
};
// Determine the clipping code of the vertex according to the
// Cyrus-Beck line clipping algorithm
//--------------------------------------------------------------------
unsigned clipping_flags_x(double x)
{
unsigned f = 0;
if(x < m_clip_box.x1) f |= clip_x1;
if(x > m_clip_box.x2) f |= clip_x2;
return f;
}
unsigned clipping_flags_y(double y)
{
unsigned f = 0;
if(y < m_clip_box.y1) f |= clip_y1;
if(y > m_clip_box.y2) f |= clip_y2;
return f;
}
unsigned clipping_flags(double x, double y)
{
return clipping_flags_x(x) | clipping_flags_y(y);
}
bool move_point(double& x, double& y, unsigned& flags);
void clip_line_segment();
private:
rect_d m_clip_box;
double m_x1;
double m_y1;
unsigned m_f1;
double m_x2;
double m_y2;
unsigned m_f2;
double m_x[2];
double m_y[2];
unsigned m_cmd[2];
unsigned m_num_vertices;
unsigned m_vertex;
};
}
#endif
|