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
|
/*
* This program source code file is part of KiCad, a free EDA CAD application.
*
* Copyright (C) 2015 Kicad Developers, see change_log.txt for contributors.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, you may find one here:
* http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
* or you may search the http://www.gnu.org website for the version 2 license,
* or you may write to the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
*/
#ifndef __SHAPE_CONVEX_H
#define __SHAPE_CONVEX_H
#include <vector>
#include <geometry/shape.h>
#include <geometry/seg.h>
#include <geometry/shape_line_chain.h>
/**
* Class SHAPE_CONVEX
*
* Represents a convex polygon consisting of a zero-thickness closed chain of
* connected line segments.
*
* Internally the vertices are held in a SHAPE_LINE_CHAIN, please note that
* there is a "virtual" line segment between the last and first vertex.
*/
class SHAPE_CONVEX : public SHAPE
{
public:
/**
* Constructor
* Creates an empty polygon
*/
SHAPE_CONVEX() :
SHAPE( SH_CONVEX )
{
m_points.SetClosed( true );
}
SHAPE_CONVEX( const SHAPE_CONVEX& aOther ) :
SHAPE( SH_CONVEX ), m_points( aOther.m_points )
{}
SHAPE* Clone() const
{
return new SHAPE_CONVEX( *this );
}
/**
* Function Clear()
* Removes all points from the polygon.
*/
void Clear()
{
m_points.Clear();
}
/// @copydoc SHAPE::BBox()
const BOX2I BBox( int aClearance = 0 ) const
{
return m_points.BBox( aClearance );
}
/**
* Function PointCount()
*
* Returns the number of points (vertices) in this polygon
* @return number of points
*/
int PointCount() const
{
return m_points.PointCount();
}
/**
* Function Point()
*
* Returns a reference to a given point in the polygon. Negative indices
* count from the end of the point list, e.g. -1 means "last point", -2
* means "second to last point" and so on.
* @param aIndex index of the point
* @return reference to the point
*/
VECTOR2I& Point( int aIndex )
{
return m_points.Point( aIndex );
}
/**
* Function CPoint()
*
* Returns a const reference to a given point in the polygon. Negative
* indices count from the end of the point list, e.g. -1 means "last
* point", -2 means "second to last point" and so on.
* @param aIndex index of the point
* @return const reference to the point
*/
const VECTOR2I& CPoint( int aIndex ) const
{
return m_points.CPoint( aIndex );
}
/**
* Function CDPoint()
*
* Returns a given point as a vector with elements of type double.
*
* @param aIndex index of the point
* @return the point with elements of type double
*/
const VECTOR2D CDPoint( int aIndex ) const
{
const VECTOR2I& v = CPoint( aIndex );
return VECTOR2D( v.x, v.y );
}
/**
* Function Vertices()
*
* Returns the list of vertices defining this convex polygon.
*
* @return the list of vertices defining this convex polygon
*/
const SHAPE_LINE_CHAIN& Vertices() const
{
return m_points;
}
/**
* Function Append()
*
* Appends a new point at the end of the polygon.
* @param aX is X coordinate of the new point
* @param aY is Y coordinate of the new point
*/
void Append( int aX, int aY )
{
VECTOR2I v( aX, aY );
Append( v );
}
/**
* Function Append()
*
* Appends a new point at the end of the polygon.
* @param aP the new point
*/
void Append( const VECTOR2I& aP )
{
m_points.Append( aP );
}
/// @copydoc SHAPE::Collide()
bool Collide( const SEG& aSeg, int aClearance = 0 ) const
{
return m_points.Collide( aSeg, aClearance );
}
void Move( const VECTOR2I& aVector )
{
m_points.Move( aVector );
}
bool IsSolid() const
{
return true;
}
private:
// vertices
SHAPE_LINE_CHAIN m_points;
};
#endif // __SHAPE_CONVEX_H
|
