KiCad PCB EDA Suite
Loading...
Searching...
No Matches
shape_arc.h
Go to the documentation of this file.
1/*
2 * This program source code file is part of KiCad, a free EDA CAD application.
3 *
4 * Copyright (C) 2018 CERN
5 * Copyright The KiCad Developers, see AUTHORS.txt for contributors.
6 * @author Tomasz Wlostowski <[email protected]>
7 *
8 * This program is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU General Public License
10 * as published by the Free Software Foundation; either version 2
11 * of the License, or (at your option) any later version.
12 *
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
17 *
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, you may find one here:
20 * http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
21 * or you may search the http://www.gnu.org website for the version 2 license,
22 * or you may write to the Free Software Foundation, Inc.,
23 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
24 */
25
26#pragma once
27
28#include <core/mirror.h> // for FLIP_DIRECTION
29#include <geometry/shape.h>
30#include <base_units.h>
31#include <math/vector2d.h> // for VECTOR2I
32#include <geometry/eda_angle.h>
33
34class CIRCLE;
35class SHAPE_CIRCLE;
37class SHAPE_RECT;
38
39class SHAPE_ARC : public SHAPE
40{
41public:
42
44 SHAPE( SH_ARC ),
45 m_width( 0 ),
46 m_radius( 0 )
47 {};
48
60 SHAPE_ARC( const VECTOR2I& aArcCenter, const VECTOR2I& aArcStartPoint,
61 const EDA_ANGLE& aCenterAngle, int aWidth = 0 );
62
69 SHAPE_ARC( const VECTOR2I& aArcStart, const VECTOR2I& aArcMid, const VECTOR2I& aArcEnd,
70 int aWidth );
71
80 SHAPE_ARC( const SEG& aSegmentA, const SEG& aSegmentB, int aRadius, int aWidth = 0 );
81
82 SHAPE_ARC( const SHAPE_ARC& aOther );
83
84 virtual ~SHAPE_ARC() {}
85
86 SHAPE* Clone() const override
87 {
88 return new SHAPE_ARC( *this );
89 }
90
100 SHAPE_ARC& ConstructFromStartEndAngle( const VECTOR2I& aStart, const VECTOR2I& aEnd,
101 const EDA_ANGLE& aAngle, double aWidth = 0 );
102
112 SHAPE_ARC& ConstructFromStartEndCenter( const VECTOR2I& aStart, const VECTOR2I& aEnd,
113 const VECTOR2I& aCenter, bool aClockwise = false,
114 double aWidth = 0 );
115
116 const VECTOR2I& GetP0() const { return m_start; }
117 const VECTOR2I& GetP1() const { return m_end; }
118 const VECTOR2I& GetArcMid() const { return m_mid; }
119 const VECTOR2I& GetCenter() const;
120
121 const BOX2I BBox( int aClearance = 0 ) const override;
122
123 VECTOR2I NearestPoint( const VECTOR2I& aP ) const;
124
133 bool NearestPoints( const SHAPE_ARC& aArc, VECTOR2I& aPtA, VECTOR2I& aPtB, int64_t& aDistSq ) const;
134
143 bool NearestPoints( const SHAPE_CIRCLE& aCircle, VECTOR2I& aPtA, VECTOR2I& aPtB, int64_t& aDistSq ) const;
144
153 bool NearestPoints( const SEG& aSeg, VECTOR2I& aPtA, VECTOR2I& aPtB, int64_t& aDistSq ) const;
154
163 bool NearestPoints( const SHAPE_RECT& aRect, VECTOR2I& aPtA, VECTOR2I& aPtB, int64_t& aDistSq ) const;
164
165 bool Collide( const SEG& aSeg, int aClearance = 0, int* aActual = nullptr,
166 VECTOR2I* aLocation = nullptr ) const override;
167 bool Collide( const VECTOR2I& aP, int aClearance = 0, int* aActual = nullptr,
168 VECTOR2I* aLocation = nullptr ) const override;
169
170
171 bool Collide( const SHAPE* aShape, int aClearance = 0, int* aActual = nullptr,
172 VECTOR2I* aLocation = nullptr ) const override
173 {
174 return SHAPE::Collide( aShape, aClearance, aActual, aLocation );
175 }
176
185 int IntersectLine( const SEG& aSeg, std::vector<VECTOR2I>* aIpsBuffer ) const;
186
194 int Intersect( const CIRCLE& aArc, std::vector<VECTOR2I>* aIpsBuffer ) const;
195
203 int Intersect( const SHAPE_ARC& aArc, std::vector<VECTOR2I>* aIpsBuffer ) const;
204
205 void SetWidth( int aWidth )
206 {
207 m_width = aWidth;
208 }
209
210 int GetWidth() const
211 {
212 return m_width;
213 }
214
215 bool IsSolid() const override
216 {
217 return true;
218 }
219
220 bool IsEffectiveLine() const;
221
222 void Move( const VECTOR2I& aVector ) override;
223
230 void Rotate( const EDA_ANGLE& aAngle, const VECTOR2I& aCenter ) override;
231
232 void Mirror( const VECTOR2I& aRef, FLIP_DIRECTION aFlipDirection );
233
234 void Mirror( const SEG& axis );
235
236 void Reverse();
237
238 SHAPE_ARC Reversed() const;
239
240 double GetRadius() const;
241
242 SEG GetChord() const
243 {
244 return SEG( m_start, m_end );
245 }
246
251
255 EDA_ANGLE GetStartAngle() const;
256
260 EDA_ANGLE GetEndAngle() const;
261
265 double GetLength() const;
266
276 static double DefaultAccuracyForPCB(){ return 0.005 * PCB_IU_PER_MM; }
277
293 const SHAPE_LINE_CHAIN ConvertToPolyline( double aAccuracy = DefaultAccuracyForPCB(),
294 double* aEffectiveAccuracy = nullptr ) const;
295
296 bool operator==( SHAPE_ARC const& aArc ) const
297 {
298 return ( aArc.m_start == m_start ) && ( aArc.m_end == m_end ) && ( aArc.m_mid == m_mid )
299 && ( aArc.m_width == m_width );
300 }
301
302 void TransformToPolygon( SHAPE_POLY_SET& aBuffer, int aError,
303 ERROR_LOC aErrorLoc ) const override;
304
308 bool IsCCW() const
309 {
310 VECTOR2L mid = m_mid;
311 VECTOR2L v1 = m_end - mid;
312 VECTOR2L v2 = m_start - mid;
313
314 return v1.Cross( v2 ) > 0;
315 }
316
317 bool IsClockwise() const { return !IsCCW(); }
318
319private:
320 void update_values();
321
322 bool sliceContainsPoint( const VECTOR2I& p ) const;
323
324private:
329
330 BOX2I m_bbox; // Calculated value
331 VECTOR2I m_center; // Calculated value
332 double m_radius; // Calculated value
333};
334
335// Required for Boost Test BOOST_CHECK_EQUAL:
336std::ostream& operator<<( std::ostream& aStream, const SHAPE_ARC& aArc );
ERROR_LOC
When approximating an arc or circle, should the error be placed on the outside or inside of the curve...
Definition: approximation.h:32
constexpr double PCB_IU_PER_MM
Pcbnew IU is 1 nanometer.
Definition: base_units.h:70
Represent basic circle geometry with utility geometry functions.
Definition: circle.h:33
Definition: seg.h:42
EDA_ANGLE GetCentralAngle() const
Definition: shape_arc.cpp:864
double m_radius
Definition: shape_arc.h:332
const VECTOR2I & GetArcMid() const
Definition: shape_arc.h:118
void update_values()
Definition: shape_arc.cpp:363
SEG GetChord() const
Definition: shape_arc.h:242
bool IsClockwise() const
Definition: shape_arc.h:317
bool Collide(const SHAPE *aShape, int aClearance=0, int *aActual=nullptr, VECTOR2I *aLocation=nullptr) const override
Definition: shape_arc.h:171
void Move(const VECTOR2I &aVector) override
Definition: shape_arc.cpp:952
SHAPE_ARC & ConstructFromStartEndAngle(const VECTOR2I &aStart, const VECTOR2I &aEnd, const EDA_ANGLE &aAngle, double aWidth=0)
Construct this arc from the given start, end and angle.
Definition: shape_arc.cpp:195
virtual ~SHAPE_ARC()
Definition: shape_arc.h:84
const BOX2I BBox(int aClearance=0) const override
Compute a bounding box of the shape, with a margin of aClearance a collision.
Definition: shape_arc.cpp:413
EDA_ANGLE GetEndAngle() const
Definition: shape_arc.cpp:841
bool IsCCW() const
Definition: shape_arc.h:308
double GetLength() const
Definition: shape_arc.cpp:855
BOX2I m_bbox
Definition: shape_arc.h:330
void Rotate(const EDA_ANGLE &aAngle, const VECTOR2I &aCenter) override
Rotate the arc by a given angle about a point.
Definition: shape_arc.cpp:961
bool sliceContainsPoint(const VECTOR2I &p) const
Definition: shape_arc.cpp:1012
VECTOR2I NearestPoint(const VECTOR2I &aP) const
Definition: shape_arc.cpp:427
SHAPE_ARC()
Definition: shape_arc.h:43
int Intersect(const CIRCLE &aArc, std::vector< VECTOR2I > *aIpsBuffer) const
Find intersection points between this arc and a CIRCLE.
Definition: shape_arc.cpp:326
int GetWidth() const
Definition: shape_arc.h:210
void SetWidth(int aWidth)
Definition: shape_arc.h:205
VECTOR2I m_mid
Definition: shape_arc.h:326
SHAPE_ARC & ConstructFromStartEndCenter(const VECTOR2I &aStart, const VECTOR2I &aEnd, const VECTOR2I &aCenter, bool aClockwise=false, double aWidth=0)
Constructs this arc from the given start, end and center.
Definition: shape_arc.cpp:213
void Mirror(const VECTOR2I &aRef, FLIP_DIRECTION aFlipDirection)
Definition: shape_arc.cpp:971
SHAPE_ARC Reversed() const
Definition: shape_arc.cpp:1006
VECTOR2I m_center
Definition: shape_arc.h:331
int m_width
Definition: shape_arc.h:328
const VECTOR2I & GetP1() const
Definition: shape_arc.h:117
int IntersectLine(const SEG &aSeg, std::vector< VECTOR2I > *aIpsBuffer) const
Find intersection points between this arc and aSeg, treating aSeg as an infinite line.
Definition: shape_arc.cpp:305
VECTOR2I m_end
Definition: shape_arc.h:327
bool Collide(const SEG &aSeg, int aClearance=0, int *aActual=nullptr, VECTOR2I *aLocation=nullptr) const override
Check if the boundary of shape (this) lies closer to the segment aSeg than aClearance,...
Definition: shape_arc.cpp:254
const SHAPE_LINE_CHAIN ConvertToPolyline(double aAccuracy=DefaultAccuracyForPCB(), double *aEffectiveAccuracy=nullptr) const
Construct a SHAPE_LINE_CHAIN of segments from a given arc.
Definition: shape_arc.cpp:886
double GetRadius() const
Definition: shape_arc.cpp:880
EDA_ANGLE GetStartAngle() const
Definition: shape_arc.cpp:833
void TransformToPolygon(SHAPE_POLY_SET &aBuffer, int aError, ERROR_LOC aErrorLoc) const override
Fills a SHAPE_POLY_SET with a polygon representation of this shape.
Definition: shape_arc.cpp:1038
static double DefaultAccuracyForPCB()
Definition: shape_arc.h:276
bool operator==(SHAPE_ARC const &aArc) const
Definition: shape_arc.h:296
bool IsEffectiveLine() const
Definition: shape_arc.cpp:245
SHAPE * Clone() const override
Return a dynamically allocated copy of the shape.
Definition: shape_arc.h:86
void Reverse()
Definition: shape_arc.cpp:1000
bool NearestPoints(const SHAPE_ARC &aArc, VECTOR2I &aPtA, VECTOR2I &aPtB, int64_t &aDistSq) const
Compute closest points between this arc and aArc.
Definition: shape_arc.cpp:629
const VECTOR2I & GetP0() const
Definition: shape_arc.h:116
VECTOR2I m_start
Definition: shape_arc.h:325
bool IsSolid() const override
Definition: shape_arc.h:215
const VECTOR2I & GetCenter() const
Definition: shape_arc.cpp:849
Represent a polyline containing arcs as well as line segments: A chain of connected line and/or arc s...
Represent a set of closed polygons.
An abstract shape on 2D plane.
Definition: shape.h:126
virtual bool Collide(const VECTOR2I &aP, int aClearance=0, int *aActual=nullptr, VECTOR2I *aLocation=nullptr) const
Check if the boundary of shape (this) lies closer to the point aP than aClearance,...
Definition: shape.h:181
VECTOR3< T > Cross(const VECTOR3< T > &aVector) const
Compute cross product of self with aVector.
Definition: vector3.h:134
std::ostream & operator<<(std::ostream &aStream, const EDA_TEXT &aText)
Definition: eda_text.cpp:1311
FLIP_DIRECTION
Definition: mirror.h:27
@ SH_ARC
circular arc
Definition: shape.h:54
VECTOR3I v1(5, 5, 5)
VECTOR2I v2(1, 0)