SHAPE_ARC Class Reference

#include <shape_arc.h>

Inheritance diagram for SHAPE_ARC:

Public Member Functions
	SHAPE_ARC ()
	SHAPE_ARC (const VECTOR2I &aArcCenter, const VECTOR2I &aArcStartPoint, double aCenterAngle, int aWidth=0)
	Construct and arc using center, start, angle. More...
	SHAPE_ARC (const VECTOR2I &aArcStart, const VECTOR2I &aArcMid, const VECTOR2I &aArcEnd, int aWidth)
	SHAPE_ARC (const SEG &aSegmentA, const SEG &aSegmentB, int aRadius, int aWidth=0)
	Build a SHAPE_ARC which is tangent to two segments and a given radius. More...
	SHAPE_ARC (const SHAPE_ARC &aOther)
virtual	~SHAPE_ARC ()
SHAPE *	Clone () const override
	Return a dynamically allocated copy of the shape. More...
SHAPE_ARC &	ConstructFromStartEndAngle (const VECTOR2I &aStart, const VECTOR2I &aEnd, double aAngle, double aWidth=0)
	Construct this arc from the given start, end and angle. More...
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. More...
const VECTOR2I &	GetP0 () const
const VECTOR2I &	GetP1 () const
const VECTOR2I &	GetArcMid () const
VECTOR2I	GetCenter () const
const BOX2I	BBox (int aClearance=0) const override
	Compute a bounding box of the shape, with a margin of aClearance a collision. More...
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, indicating a collision. More...
bool	Collide (const VECTOR2I &aP, int aClearance=0, int *aActual=nullptr, VECTOR2I *aLocation=nullptr) const override
	Check if the boundary of shape (this) lies closer to the point aP than aClearance, indicating a collision. More...
bool	Collide (const SHAPE *aShape, int aClearance=0, int *aActual=nullptr, VECTOR2I *aLocation=nullptr) const override
int	IntersectLine (const SEG &aSeg, std::vector< VECTOR2I > *aIpsBuffer) const
	Find intersection points between this arc and aSeg, treating aSeg as an infinite line. More...
int	Intersect (const SHAPE_ARC &aArc, std::vector< VECTOR2I > *aIpsBuffer) const
	Find intersection points between this arc and aArc. More...
bool	IsClockwise () const
void	SetWidth (int aWidth)
int	GetWidth () const
bool	IsSolid () const override
void	Move (const VECTOR2I &aVector) override
void	Rotate (double aAngle, const VECTOR2I &aCenter) override
	Rotate the arc by a given angle about a point. More...
void	Mirror (bool aX=true, bool aY=false, const VECTOR2I &aVector={ 0, 0 })
void	Mirror (const SEG &axis)
void	Reverse ()
SHAPE_ARC	Reversed () const
double	GetRadius () const
SEG	GetChord () const
double	GetCentralAngle () const
double	GetStartAngle () const
double	GetEndAngle () const
double	GetLength () const
const SHAPE_LINE_CHAIN	ConvertToPolyline (double aAccuracy=DefaultAccuracyForPCB(), double *aEffectiveAccuracy=nullptr) const
	Construct a SHAPE_LINE_CHAIN of segments from a given arc. More...
bool	operator== (SHAPE_ARC const &aArc) const
bool	IsNull () const
	Return true if the shape is a null shape. More...
virtual bool	Collide (const SHAPE *aShape, int aClearance, VECTOR2I *aMTV) const
	Check if the boundary of shape (this) lies closer to the shape aShape than aClearance, indicating a collision. More...
virtual VECTOR2I	Centre () const
	Compute a center-of-mass of the shape. More...
virtual bool	Parse (std::stringstream &aStream)
virtual const std::string	Format () const
FACET *	NewFacet ()
SGNODE *	CalcShape (SGNODE *aParent, SGNODE *aColor, WRL1_ORDER aVertexOrder, float aCreaseLimit=0.74317, bool isVRML2=false)
SHAPE_TYPE	Type () const
	Return the type of the shape. More...
virtual bool	HasIndexableSubshapes () const
virtual size_t	GetIndexableSubshapeCount () const
virtual void	GetIndexableSubshapes (std::vector< SHAPE * > &aSubshapes)

Static Public Member Functions
static double	DefaultAccuracyForPCB ()

Static Public Attributes
static const int	MIN_PRECISION_IU = 4
	This is the minimum precision for all the points in a shape. More...

Protected Types
typedef VECTOR2I::extended_type	ecoord

Protected Attributes
SHAPE_TYPE	m_type
	< type of our shape More...

Private Member Functions
bool	ccw (const VECTOR2I &aA, const VECTOR2I &aB, const VECTOR2I &aC) const
void	update_bbox ()
bool	sliceContainsPoint (const VECTOR2I &p) const

Private Attributes
VECTOR2I	m_start
VECTOR2I	m_mid
VECTOR2I	m_end
int	m_width
BOX2I	m_bbox

Detailed Description

Definition at line 35 of file shape_arc.h.

Member Typedef Documentation

ecoord

typedef VECTOR2I::extended_type SHAPE::ecoord

protectedinherited

Definition at line 236 of file shape.h.

Constructor & Destructor Documentation

SHAPE_ARC() [1/5]

SHAPE_ARC::SHAPE_ARC ( )

inline

Definition at line 39 of file shape_arc.h.

 :
 SHAPE( SH_ARC ),
 m_width( 0 )
 {};

Referenced by Clone(), and Reversed().

SHAPE_ARC() [2/5]

SHAPE_ARC::SHAPE_ARC	(	const VECTOR2I &	aArcCenter,
		const VECTOR2I &	aArcStartPoint,
		double	aCenterAngle,
		int	aWidth = 0
	)

Construct and arc using center, start, angle.

Center and angle are used to calculate the mid and end points of the arc, and are not stored.

Parameters

aArcCenter	is the arc center.
aArcStartPoint	is the arc start point.
aCenterAngle	is the arc angle in degrees.
aWidth	is the arc line thickness.

Definition at line 43 of file shape_arc.cpp.

 :
 SHAPE( SH_ARC ), m_width( aWidth )
{
 m_start = aArcStartPoint;
 m_mid = aArcStartPoint;
 m_end = aArcStartPoint;

 RotatePoint( m_mid, aArcCenter, -aCenterAngle * 10.0 / 2.0 );
 RotatePoint( m_end, aArcCenter, -aCenterAngle * 10.0 );

 update_bbox();
}

References m_end, m_mid, m_start, RotatePoint(), and update_bbox().

SHAPE_ARC() [3/5]

SHAPE_ARC::SHAPE_ARC	(	const VECTOR2I &	aArcStart,
		const VECTOR2I &	aArcMid,
		const VECTOR2I &	aArcEnd,
		int	aWidth
	)

Parameters

aArcStart	is the arc start point.
aArcEnd	is the arc end point.
aArcMid	is the arc mid point.
aWidth	is the arc line thickness.

Definition at line 58 of file shape_arc.cpp.

 :
 SHAPE( SH_ARC ), m_start( aArcStart ), m_mid( aArcMid ), m_end( aArcEnd ),
 m_width( aWidth )
{
 update_bbox();
}

References update_bbox().

SHAPE_ARC() [4/5]

SHAPE_ARC::SHAPE_ARC	(	const SEG &	aSegmentA,
		const SEG &	aSegmentB,
		int	aRadius,
		int	aWidth = 0
	)

Build a SHAPE_ARC which is tangent to two segments and a given radius.

Parameters

aSegmentA	is the first segment
aSegmentB	is the second segment
aRadius	is the arc radius
aWidth	is the arc line thickness

Definition at line 67 of file shape_arc.cpp.

 : SHAPE( SH_ARC )
{
 m_width = aWidth;

 /*
 * Construct an arc that is tangent to two segments with a given radius.
 *
 * p
 * A
 * A \
 * / \
 * / . . \ segB
 * /. .\
 * segA / c \
 * / B
 * /
 * /
 * B
 *
 *
 * segA is the fist segment (with its points A and B)
 * segB is the second segment (with its points A and B)
 * p is the point at which segA and segB would intersect if they were projected
 * c is the centre of the arc to be constructed
 * rad is the radius of the arc to be constructed
 *
 * We can create two vectors, between point p and segA /segB
 * pToA = p - segA.B //< note that segA.A would also be valid as it is colinear
 * pToB = p - segB.B //< note that segB.A would also be valid as it is colinear
 *
 * Let the angle formed by segA and segB be called 'alpha':
 * alpha = angle( pToA ) - angle( pToB )
 *
 * The distance PC can be computed as
 * distPC = rad / abs( sin( alpha / 2 ) )
 *
 * The polar angle of the vector PC can be computed as:
 * anglePC = angle( pToA ) + alpha / 2
 *
 * Therefore:
 * C.x = P.x + distPC*cos( anglePC )
 * C.y = P.y + distPC*sin( anglePC )
 */

 OPT_VECTOR2I p = aSegmentA.Intersect( aSegmentB, true, true );

 if( !p || aSegmentA.Length() == 0 || aSegmentB.Length() == 0 )
 {
 // Catch bugs in debug
 wxASSERT_MSG( false, "The input segments do not intersect or one is zero length." );

 // Make a 180 degree arc around aSegmentA in case we end up here in release
 m_start = aSegmentA.A;
 m_end = aSegmentA.B;
 m_mid = m_start;

 VECTOR2I arcCenter = aSegmentA.Center();
 RotatePoint( m_mid, arcCenter, 900.0 ); // mid point at 90 degrees
 }
 else
 {
 VECTOR2I pToA = aSegmentA.B - p.get();
 VECTOR2I pToB = aSegmentB.B - p.get();

 if( pToA.EuclideanNorm() == 0 )
 pToA = aSegmentA.A - p.get();

 if( pToB.EuclideanNorm() == 0 )
 pToB = aSegmentB.A - p.get();

 double pToAangle = ArcTangente( pToA.y, pToA.x );
 double pToBangle = ArcTangente( pToB.y, pToB.x );

 double alpha = NormalizeAngle180( pToAangle - pToBangle );

 double distPC = (double) aRadius / abs( sin( DECIDEG2RAD( alpha / 2 ) ) );
 double angPC = pToAangle - alpha / 2;

 VECTOR2I arcCenter;

 arcCenter.x = p.get().x + KiROUND( distPC * cos( DECIDEG2RAD( angPC ) ) );
 arcCenter.y = p.get().y + KiROUND( distPC * sin( DECIDEG2RAD( angPC ) ) );

 // The end points of the arc are the orthogonal projected lines from the line segments
 // to the center of the arc
 m_start = aSegmentA.LineProject( arcCenter );
 m_end = aSegmentB.LineProject( arcCenter );

 //The mid point is rotated start point around center, half the angle of the arc.
 VECTOR2I startVector = m_start - arcCenter;
 VECTOR2I endVector = m_end - arcCenter;

 double startAngle = ArcTangente( startVector.y, startVector.x );
 double endAngle = ArcTangente( endVector.y, endVector.x );

 double midPointRotAngle = NormalizeAngle180( startAngle - endAngle ) / 2;
 m_mid = m_start;
 RotatePoint( m_mid, arcCenter, midPointRotAngle );
 }

 update_bbox();
}

References SEG::A, ArcTangente(), SEG::B, SEG::Center(), DECIDEG2RAD(), VECTOR2< T >::EuclideanNorm(), SEG::Intersect(), KiROUND(), SEG::Length(), SEG::LineProject(), m_end, m_mid, m_start, m_width, NormalizeAngle180(), RotatePoint(), update_bbox(), VECTOR2< T >::x, and VECTOR2< T >::y.

SHAPE_ARC() [5/5]

SHAPE_ARC::SHAPE_ARC

(

const SHAPE_ARC &

aOther

)

Definition at line 172 of file shape_arc.cpp.

 : SHAPE( SH_ARC )
{
 m_start = aOther.m_start;
 m_end = aOther.m_end;
 m_mid = aOther.m_mid;
 m_width = aOther.m_width;
 m_bbox = aOther.m_bbox;
}

References m_bbox, m_end, m_mid, m_start, and m_width.

~SHAPE_ARC()

virtual SHAPE_ARC::~SHAPE_ARC ( )

inlinevirtual

Definition at line 79 of file shape_arc.h.

{}

Member Function Documentation

BBox()

const BOX2I SHAPE_ARC::BBox ( int  aClearance = 0 ) const

overridevirtual

Compute a bounding box of the shape, with a margin of aClearance a collision.

Parameters

aClearance

how much the bounding box is expanded wrs to the minimum enclosing rectangle for the shape.

Returns

the bounding box.

Implements SHAPE.

Definition at line 340 of file shape_arc.cpp.

{
 BOX2I bbox( m_bbox );

 if( aClearance != 0 )
 bbox.Inflate( aClearance );

 return bbox;
}

References BOX2< Vec >::Inflate(), and m_bbox.

Referenced by BOOST_AUTO_TEST_CASE(), CheckArcGeom(), Collide(), drawShapes(), GERBER_DRAW_ITEM::GetBoundingBox(), and playground_main_func().

CalcShape()

SGNODE * SHAPE::CalcShape ( SGNODE *  aParent, SGNODE *  aColor, WRL1_ORDER  aVertexOrder, float  aCreaseLimit = 0.74317, bool  isVRML2 = false  )

inherited

Definition at line 703 of file wrlfacet.cpp.

{
 if( facets.empty() || !facets.front()->HasMinPoints() )
 return nullptr;

 std::vector< std::list< FACET* > > flist;

 // determine the max. index and size flist as appropriate
 std::list< FACET* >::iterator sF = facets.begin();
 std::list< FACET* >::iterator eF = facets.end();

 int maxIdx = 0;
 int tmi;
 float maxV = 0.0;
 float tV = 0.0;

 while( sF != eF )
 {
 tV = ( *sF )->CalcFaceNormal();
 tmi = ( *sF )->GetMaxIndex();

 if( tmi > maxIdx )
 maxIdx = tmi;

 if( tV > maxV )
 maxV = tV;

 ++sF;
 }

 ++maxIdx;

 if( maxIdx < 3 )
 return nullptr;

 flist.resize( maxIdx );

 // create the lists of facets common to indices
 sF = facets.begin();

 while( sF != eF )
 {
 ( *sF )->Renormalize( tV );
 ( *sF )->CollectVertices( flist );
 ++sF;
 }

 // calculate the normals
 size_t vs = flist.size();

 for( size_t i = 0; i < vs; ++i )
 {
 sF = flist[i].begin();
 eF = flist[i].end();

 while( sF != eF )
 {
 ( *sF )->CalcVertexNormal( static_cast<int>( i ), flist[i], aCreaseLimit );
 ++sF;
 }
 }

 std::vector< WRLVEC3F > vertices;
 std::vector< WRLVEC3F > normals;
 std::vector< SGCOLOR > colors;

 // push the facet data to the final output list
 sF = facets.begin();
 eF = facets.end();

 while( sF != eF )
 {
 ( *sF )->GetData( vertices, normals, colors, aVertexOrder );
 ++sF;
 }

 flist.clear();

 if( vertices.size() < 3 )
 return nullptr;

 IFSG_SHAPE shapeNode( false );

 if( !isVRML2 )
 {
 shapeNode.NewNode( aParent );

 if( aColor )
 {
 if( nullptr == S3D::GetSGNodeParent( aColor ) )
 shapeNode.AddChildNode( aColor );
 else
 shapeNode.AddRefNode( aColor );
 }
 }

 std::vector< SGPOINT > lCPts; // vertex points in SGPOINT (double) format
 std::vector< SGVECTOR > lCNorm; // per-vertex normals
 vs = vertices.size();

 for( size_t i = 0; i < vs; ++i )
 {
 SGPOINT pt;
 pt.x = vertices[i].x;
 pt.y = vertices[i].y;
 pt.z = vertices[i].z;
 lCPts.push_back( pt );
 lCNorm.emplace_back( normals[i].x, normals[i].y, normals[i].z );
 }

 vertices.clear();
 normals.clear();

 IFSG_FACESET fsNode( false );

 if( !isVRML2 )
 fsNode.NewNode( shapeNode );
 else
 fsNode.NewNode( aParent );

 IFSG_COORDS cpNode( fsNode );
 cpNode.SetCoordsList( lCPts.size(), &lCPts[0] );
 IFSG_COORDINDEX ciNode( fsNode );

 for( int i = 0; i < (int)lCPts.size(); ++i )
 ciNode.AddIndex( i );

 IFSG_NORMALS nmNode( fsNode );
 nmNode.SetNormalList( lCNorm.size(), &lCNorm[0] );

 if( !colors.empty() )
 {
 IFSG_COLORS nmColor( fsNode );
 nmColor.SetColorList( colors.size(), &colors[0] );
 colors.clear();
 }

 if( !isVRML2 )
 return shapeNode.GetRawPtr();

 return fsNode.GetRawPtr();
}

References IFSG_NODE::AddChildNode(), IFSG_INDEX::AddIndex(), IFSG_NODE::AddRefNode(), SHAPE::facets, IFSG_NODE::GetRawPtr(), S3D::GetSGNodeParent(), IFSG_FACESET::NewNode(), IFSG_SHAPE::NewNode(), IFSG_COLORS::SetColorList(), IFSG_COORDS::SetCoordsList(), IFSG_NORMALS::SetNormalList(), SGPOINT::x, SGPOINT::y, and SGPOINT::z.

Referenced by WRL1FACESET::TranslateToSG(), WRL2FACESET::TranslateToSG(), and X3DIFACESET::TranslateToSG().

ccw()

bool SHAPE_ARC::ccw ( const VECTOR2I &  aA, const VECTOR2I &  aB, const VECTOR2I &  aC  ) const

inlineprivate

Definition at line 247 of file shape_arc.h.

 {
 return ( ecoord{ aC.y } - aA.y ) * ( ecoord{ aB.x } - aA.x ) >
 ( ecoord{ aB.y } - aA.y ) * ( ecoord{ aC.x } - aA.x );
 }

References VECTOR2< T >::x, and VECTOR2< T >::y.

Referenced by Collide().

Centre()

virtual VECTOR2I SHAPE::Centre ( ) const

inlinevirtualinherited

Compute a center-of-mass of the shape.

Returns

the center-of-mass point

Definition at line 216 of file shape.h.

 {
 return BBox( 0 ).Centre(); // if nothing better is available....
 }

References SHAPE::BBox(), and BOX2< Vec >::Centre().

Referenced by Collide().

Clone()

SHAPE* SHAPE_ARC::Clone ( ) const

inlineoverridevirtual

Return a dynamically allocated copy of the shape.

Return values

copy	of the shape

Reimplemented from SHAPE.

Definition at line 81 of file shape_arc.h.

 {
 return new SHAPE_ARC( *this );
 }

References SHAPE_ARC().

Referenced by CheckArc().

Collide() [1/4]

bool SHAPE_ARC::Collide ( const SEG &  aSeg, int  aClearance = 0, int *  aActual = nullptr, VECTOR2I *  aLocation = nullptr  ) const

overridevirtual

Check if the boundary of shape (this) lies closer to the segment aSeg than aClearance, indicating a collision.

Parameters

aActual	[out] an optional pointer to an int to be updated with the actual distance int the event of a collision.
aLocation	[out] an option pointer to a point to store a nearby location in the event of a collision.

Returns

true, if there is a collision.

Implements SHAPE.

Definition at line 229 of file shape_arc.cpp.

{
 if( aSeg.A == aSeg.B )
 return Collide( aSeg.A, aClearance, aActual, aLocation );

 VECTOR2I center = GetCenter();
 CIRCLE circle( center, GetRadius() );

 // Possible points of the collision are:
 // 1. Intersetion of the segment with the full circle
 // 2. Closest point on the segment to the center of the circle
 // 3. Closest point on the segment to the end points of the arc
 // 4. End points of the segment

 std::vector<VECTOR2I> candidatePts = circle.Intersect( aSeg );

 candidatePts.push_back( aSeg.NearestPoint( center ) );
 candidatePts.push_back( aSeg.NearestPoint( m_start ) );
 candidatePts.push_back( aSeg.NearestPoint( m_end ) );
 candidatePts.push_back( aSeg.A );
 candidatePts.push_back( aSeg.B );

 for( const VECTOR2I& candidate : candidatePts )
 {
 if( Collide( candidate, aClearance, aActual, aLocation ) )
 return true;
 }

 return false;
}

References SEG::A, SEG::B, GetCenter(), GetRadius(), CIRCLE::Intersect(), m_end, m_start, and SEG::NearestPoint().

Referenced by BOOST_AUTO_TEST_CASE(), SHAPE_LINE_CHAIN::Collide(), Collide(), drawShapes(), and GEOM_TEST::IsOutlineValid().

Collide() [2/4]

bool SHAPE_ARC::Collide ( const VECTOR2I &  aP, int  aClearance = 0, int *  aActual = nullptr, VECTOR2I *  aLocation = nullptr  ) const

overridevirtual

Check if the boundary of shape (this) lies closer to the point aP than aClearance, indicating a collision.

Parameters

aActual	[out] an optional pointer to an int to store the actual distance in the event of a collision.
aLocation	[out] an option pointer to a point to store a nearby location in the event of a collision.

Returns

true, if there is a collision.

Reimplemented from SHAPE.

Definition at line 357 of file shape_arc.cpp.

{
 int minDist = aClearance + m_width / 2;
 auto bbox = BBox( minDist );

 // Fast check using bounding box:
 if( !bbox.Contains( aP ) )
 return false;

 VECTOR2I center = GetCenter();
 VECTOR2I vec = aP - center;

 int dist = abs( vec.EuclideanNorm() - GetRadius() );

 // If not a 360 degree arc, need to use arc angles to decide if point collides
 if( m_start != m_end )
 {
 bool ccw = GetCentralAngle() > 0.0;
 double rotatedVecAngle = NormalizeAngleDegreesPos( NormalizeAngleDegreesPos( RAD2DEG( vec.Angle() ) )
 - GetStartAngle() );
 double rotatedEndAngle = NormalizeAngleDegreesPos( GetEndAngle() - GetStartAngle() );

 if( ( ccw && rotatedVecAngle > rotatedEndAngle )
 || ( !ccw && rotatedVecAngle < rotatedEndAngle ) )
 {
 int distStartpt = ( aP - m_start ).EuclideanNorm();
 int distEndpt = ( aP - m_end ).EuclideanNorm();
 dist = std::min( distStartpt, distEndpt );
 }
 }

 if( dist <= minDist )
 {
 if( aLocation )
 *aLocation = ( aP + GetCenter() ) / 2;

 if( aActual )
 *aActual = std::max( 0, dist - m_width / 2 );

 return true;
 }

 return false;
}

References VECTOR2< T >::Angle(), BBox(), ccw(), VECTOR2< T >::EuclideanNorm(), EuclideanNorm(), GetCenter(), GetCentralAngle(), GetEndAngle(), GetRadius(), GetStartAngle(), m_end, m_start, m_width, NormalizeAngleDegreesPos(), and RAD2DEG().

Collide() [3/4]

bool SHAPE_ARC::Collide ( const SHAPE *  aShape, int  aClearance = 0, int *  aActual = nullptr, VECTOR2I *  aLocation = nullptr  ) const

inlineoverridevirtual

Reimplemented from SHAPE.

Definition at line 124 of file shape_arc.h.

 {
 return SHAPE::Collide( aShape, aClearance, aActual, aLocation );
 }

References SHAPE::Collide().

Collide() [4/4]

bool SHAPE::Collide ( const SHAPE *  aShape, int  aClearance, VECTOR2I *  aMTV  ) const

virtualinherited

Check if the boundary of shape (this) lies closer to the shape aShape than aClearance, indicating a collision.

Parameters

aShape	shape to check collision against
aClearance	minimum clearance
aMTV	minimum translation vector
aActual	[out] an optional pointer to an int to store the actual distance in the event of a collision.
aLocation	[out] an option pointer to a point to store a nearby location in the event of a collision.

Returns

true, if there is a collision.

Reimplemented in SHAPE_RECT, SHAPE_SEGMENT, and SHAPE_COMPOUND.

Definition at line 1103 of file shape_collisions.cpp.

{
 return collideShapes( this, aShape, aClearance, nullptr, nullptr, aMTV );
}

References collideShapes().

ConstructFromStartEndAngle()

SHAPE_ARC & SHAPE_ARC::ConstructFromStartEndAngle	(	const VECTOR2I &	aStart,
		const VECTOR2I &	aEnd,
		double	aAngle,
		double	aWidth = 0
	)

Construct this arc from the given start, end and angle.

Parameters

aStart	is the arc starting point
aEnd	is the arc endpoint
aAngle	is the arc included angle
aWidth	is the arc line thickness

Returns

this arc.

Definition at line 183 of file shape_arc.cpp.

{
 m_start = aStart;
 m_mid = aStart;
 m_end = aEnd;
 m_width = aWidth;

 VECTOR2I center( CalcArcCenter( aStart, aEnd, aAngle ) );

 RotatePoint( m_mid, center, -aAngle * 10.0 / 2.0 );

 update_bbox();

 return *this;
}

References CalcArcCenter(), m_end, m_mid, m_start, m_width, RotatePoint(), and update_bbox().

Referenced by DIRECTION_45::BuildInitialTrace().

ConstructFromStartEndCenter()

SHAPE_ARC & 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.

Parameters

aStart	is the arc starting point
aEnd	is the arc endpoint
aCenter	is the arc center
aClockwise	determines which of the two solutions to construct
aWidth	is the arc line thickness

Returns

*this

Definition at line 201 of file shape_arc.cpp.

{
 VECTOR2I startLine = aStart - aCenter;
 VECTOR2I endLine = aEnd - aCenter;

 double startangle = NormalizeAnglePos(RAD2DECIDEG( startLine.Angle() ));
 double endangle = NormalizeAnglePos(RAD2DECIDEG( endLine.Angle() ));
 double angle = endangle - startangle;

 if( aClockwise )
 angle = NormalizeAngleNeg( angle );
 else
 angle = NormalizeAnglePos( angle );

 m_start = aStart;
 m_end = aEnd;
 m_mid = aStart;

 RotatePoint( m_mid, aCenter, -angle / 2.0 );

 update_bbox();

 return *this;
}

References PNS::angle(), VECTOR2< T >::Angle(), m_end, m_mid, m_start, NormalizeAngleNeg(), NormalizeAnglePos(), RAD2DECIDEG(), RotatePoint(), and update_bbox().

Referenced by SHAPE_LINE_CHAIN::amendArc(), BOOST_AUTO_TEST_CASE(), DIRECTION_45::BuildInitialTrace(), SHAPE_LINE_CHAIN::Slice(), and SHAPE_LINE_CHAIN::splitArc().

ConvertToPolyline()

const SHAPE_LINE_CHAIN SHAPE_ARC::ConvertToPolyline	(	double	aAccuracy = DefaultAccuracyForPCB(),
		double *	aEffectiveAccuracy = nullptr
	)		const

Construct a SHAPE_LINE_CHAIN of segments from a given arc.

Note

The default is #ARC_HIGH_DEF in Pcbnew units. This is to allow common geometry collision functions. Other programs should call this using explicit accuracy values.

Todo:

Unify KiCad internal units.

Parameters

aAccuracy	maximum divergence from true arc given in internal units.
aEffectiveAccuracy	is the actual divergence from true arc given. the approximation error is between -aEffectiveAccuracy/2 and +aEffectiveAccuracy/2 in internal units

Returns

a SHAPE_LINE_CHAIN.

Definition at line 458 of file shape_arc.cpp.

{
 SHAPE_LINE_CHAIN rv;
 double r = GetRadius();
 double sa = GetStartAngle();
 VECTOR2I c = GetCenter();
 double ca = GetCentralAngle();

 int n;

 // To calculate the arc to segment count, use the external radius instead of the radius.
 // for a arc with small radius and large width, the difference can be significant
 double external_radius = r+(m_width/2);
 double effectiveAccuracy;

 if( external_radius < aAccuracy/2 ) // Should be a very rare case
 {
 // In this case, the arc is approximated by one segment, with a effective error
 // between -aAccuracy/2 and +aAccuracy/2, as expected.
 n = 0;
 effectiveAccuracy = external_radius;
 }
 else
 {
 double arc_angle = std::abs( ca );
 n = GetArcToSegmentCount( external_radius, aAccuracy, arc_angle );

 // Recalculate the effective error of approximation, that can be < aAccuracy
 int seg360 = n * 360.0 / arc_angle;
 effectiveAccuracy = CircleToEndSegmentDeltaRadius( external_radius, seg360 );
 }

 // Split the error on either side of the arc. Since we want the start and end points
 // to be exactly on the arc, the first and last segments need to be shorter to stay within
 // the error band (since segments normally start 1/2 the error band outside the arc).
 r += effectiveAccuracy / 2;
 n = n * 2;

 rv.Append( m_start );

 for( int i = 1; i < n ; i += 2 )
 {
 double a = sa;

 if( n != 0 )
 a += ( ca * i ) / n;

 double x = c.x + r * cos( a * M_PI / 180.0 );
 double y = c.y + r * sin( a * M_PI / 180.0 );

 rv.Append( KiROUND( x ), KiROUND( y ) );
 }

 rv.Append( m_end );

 if( aEffectiveAccuracy )
 *aEffectiveAccuracy = effectiveAccuracy;

 return rv;
}

References SHAPE_LINE_CHAIN::Append(), CircleToEndSegmentDeltaRadius(), GetArcToSegmentCount(), GetCenter(), GetCentralAngle(), GetRadius(), GetStartAngle(), KiROUND(), m_end, m_start, m_width, r, VECTOR2< T >::x, and VECTOR2< T >::y.

Referenced by SHAPE_LINE_CHAIN::Append(), PNS::ArcHull(), BOARD_ADAPTER::createPadWithClearance(), SHAPE_LINE_CHAIN::Insert(), CADSTAR_SCH_ARCHIVE_LOADER::loadShapeVertices(), EDA_SHAPE::MakeEffectiveShapes(), SHAPE_LINE_CHAIN::SHAPE_LINE_CHAIN(), and TransformArcToPolygon().

DefaultAccuracyForPCB()

static double SHAPE_ARC::DefaultAccuracyForPCB ( )

inlinestatic

Note

The default is #ARC_HIGH_DEF in Pcbnew units. This is to allow common geometry collision functions. Other programs should call this using explicit accuracy values.

Todo:

Unify KiCad internal units.

Returns

a default accuracy value for ConvertToPolyline() to build the polyline.

Definition at line 220 of file shape_arc.h.

{ return 0.005 * PCB_IU_PER_MM; }

References PCB_IU_PER_MM.

Referenced by PNS::ArcHull(), BOOST_AUTO_TEST_CASE(), GEOM_TEST::IsOutlineValid(), PNS::SHOVE::ShoveObstacleLine(), and TransformArcToPolygon().

Format()

const std::string SHAPE::Format ( ) const

virtualinherited

Reimplemented in SHAPE_POLY_SET, SHAPE_LINE_CHAIN, SHAPE_RECT, SHAPE_SEGMENT, and SHAPE_COMPOUND.

Definition at line 35 of file shape.cpp.

{
 assert( false );
 return std::string( "" );
}

Referenced by SHAPE_FILE_IO::Write().

GetArcMid()

const VECTOR2I& SHAPE_ARC::GetArcMid ( ) const

inline

Definition at line 113 of file shape_arc.h.

{ return m_mid; }

References m_mid.

Referenced by SHAPE_LINE_CHAIN::Append(), BOOST_AUTO_TEST_CASE(), PCB_GRID_HELPER::computeAnchors(), PCB_PLUGIN::format(), ALTIUM_PCB::HelperCreateBoardOutline(), FABMASTER::loadFootprints(), FABMASTER::loadGraphics(), FABMASTER::loadOutline(), operator<<(), PCB_ARC::PCB_ARC(), GERBER_PLOTTER::plotArc(), and PNS_KICAD_IFACE::UpdateItem().

GetCenter()

VECTOR2I SHAPE_ARC::GetCenter

(

)

const

Definition at line 424 of file shape_arc.cpp.

{
 return CalcArcCenter( m_start, m_mid, m_end );
}

References CalcArcCenter(), m_end, m_mid, and m_start.

Referenced by PNS_LOG_VIEWER_OVERLAY::Arc(), PLOTTER::Arc(), CheckArcGeom(), Collide(), Collide(), collideArc2Arc(), ConvertToPolyline(), ROUTER_PREVIEW_ITEM::drawLineChain(), ROUTER_PREVIEW_ITEM::drawShape(), GetCentralAngle(), GetEndAngle(), GetRadius(), GetStartAngle(), Intersect(), IntersectLine(), GERBER_PLOTTER::plotArc(), SHAPE_LINE_CHAIN::Slice(), sliceContainsPoint(), SHAPE_LINE_CHAIN::splitArc(), TransformArcToPolygon(), and update_bbox().

GetCentralAngle()

double SHAPE_ARC::GetCentralAngle

(

)

const

Returns

the central angle of the arc shape in degrees, normalized between 0.0, 360.0 deg.

Definition at line 439 of file shape_arc.cpp.

{
 VECTOR2I center = GetCenter();
 VECTOR2I p0 = m_start - center;
 VECTOR2I p1 = m_mid - center;
 VECTOR2I p2 = m_end - center;
 double angle1 = ArcTangente( p1.y, p1.x ) - ArcTangente( p0.y, p0.x );
 double angle2 = ArcTangente( p2.y, p2.x ) - ArcTangente( p1.y, p1.x );

 return ( NormalizeAngle180( angle1 ) + NormalizeAngle180( angle2 ) ) / 10.0;
}

References ArcTangente(), GetCenter(), m_end, m_mid, m_start, NormalizeAngle180(), VECTOR2< T >::x, and VECTOR2< T >::y.

Referenced by PNS_LOG_VIEWER_OVERLAY::Arc(), CheckArcGeom(), Collide(), ConvertToPolyline(), ROUTER_PREVIEW_ITEM::drawLineChain(), ROUTER_PREVIEW_ITEM::drawShape(), GetLength(), IsClockwise(), sliceContainsPoint(), TransformArcToPolygon(), and update_bbox().

GetChord()

SEG SHAPE_ARC::GetChord ( ) const

inline

Definition at line 186 of file shape_arc.h.

 {
 return SEG( m_start, m_end );
 }

References m_end, and m_start.

Referenced by CheckArcGeom().

GetEndAngle()

double SHAPE_ARC::GetEndAngle

(

)

const

Returns

the end angle of the arc shape in degrees, normalized between 0.0, 360.0 deg.

Definition at line 414 of file shape_arc.cpp.

{
 VECTOR2D d( m_end - GetCenter() );

 auto ang = 180.0 / M_PI * atan2( d.y, d.x );

 return NormalizeAngleDegrees( ang, 0.0, 360.0 );
}

References GetCenter(), m_end, NormalizeAngleDegrees(), VECTOR2< T >::x, and VECTOR2< T >::y.

Referenced by PLOTTER::Arc(), CheckArcGeom(), Collide(), and TransformArcToPolygon().

GetIndexableSubshapeCount()

virtual size_t SHAPE_BASE::GetIndexableSubshapeCount ( ) const

inlinevirtualinherited

Reimplemented in SHAPE_POLY_SET, and SHAPE_COMPOUND.

Definition at line 104 of file shape.h.

{ return 0; }

GetIndexableSubshapes()

virtual void SHAPE_BASE::GetIndexableSubshapes ( std::vector< SHAPE * > &  aSubshapes )

inlinevirtualinherited

Reimplemented in SHAPE_POLY_SET, and SHAPE_COMPOUND.

Definition at line 106 of file shape.h.

{ }

Referenced by SHAPE_COMPOUND::AddShape(), and ROUTER_PREVIEW_ITEM::ViewDraw().

GetLength()

double SHAPE_ARC::GetLength

(

)

const

Returns

the length of the arc shape.

Definition at line 430 of file shape_arc.cpp.

{
 double radius = GetRadius();
 double includedAngle = std::abs( GetCentralAngle() );

 return radius * M_PI * includedAngle / 180.0;
}

References GetCentralAngle(), and GetRadius().

GetP0()

const VECTOR2I& SHAPE_ARC::GetP0 ( ) const

inline

Definition at line 111 of file shape_arc.h.

{ return m_start; }

References m_start.

Referenced by PNS::NODE::Add(), PCB_GRID_HELPER::AlignToArc(), PNS::ARC::Anchor(), SHAPE_LINE_CHAIN::Append(), BOOST_AUTO_TEST_CASE(), DIRECTION_45::BuildInitialTrace(), Collide(), collideArc2Arc(), PCB_GRID_HELPER::computeAnchors(), DIRECTION_45::DIRECTION_45(), EDIT_TOOL::FilletTracks(), PCB_PLUGIN::format(), PNS::LINE_PLACER::handlePullback(), ALTIUM_PCB::HelperCreateBoardOutline(), GEOM_TEST::IsOutlineValid(), FABMASTER::loadFootprints(), FABMASTER::loadGraphics(), FABMASTER::loadOutline(), CONVERT_TOOL::makePolysFromSegs(), SHAPE_LINE_CHAIN::NearestPoint(), operator<<(), PCB_ARC::PCB_ARC(), GERBER_PLOTTER::plotArc(), SHAPE_LINE_CHAIN::Slice(), SHAPE_LINE_CHAIN::splitArc(), and PNS_KICAD_IFACE::UpdateItem().

GetP1()

const VECTOR2I& SHAPE_ARC::GetP1 ( ) const

inline

Definition at line 112 of file shape_arc.h.

{ return m_end; }

References m_end.

Referenced by PNS::NODE::Add(), PNS::MEANDERED_LINE::AddArc(), PCB_GRID_HELPER::AlignToArc(), PNS::ARC::Anchor(), SHAPE_LINE_CHAIN::Append(), BOOST_AUTO_TEST_CASE(), DIRECTION_45::BuildInitialTrace(), CheckArcGeom(), Collide(), collideArc2Arc(), PCB_GRID_HELPER::computeAnchors(), DIRECTION_45::DIRECTION_45(), EDIT_TOOL::FilletTracks(), PCB_PLUGIN::format(), ALTIUM_PCB::HelperCreateBoardOutline(), GEOM_TEST::IsOutlineValid(), FABMASTER::loadFootprints(), FABMASTER::loadGraphics(), FABMASTER::loadOutline(), PNS::MEANDER_SHAPE::MakeArc(), SHAPE_LINE_CHAIN::NearestPoint(), operator<<(), PCB_ARC::PCB_ARC(), GERBER_PLOTTER::plotArc(), SHAPE_LINE_CHAIN::Slice(), SHAPE_LINE_CHAIN::splitArc(), and PNS_KICAD_IFACE::UpdateItem().

GetRadius()

double SHAPE_ARC::GetRadius

(

)

const

Definition at line 452 of file shape_arc.cpp.

{
 return ( m_start - GetCenter() ).EuclideanNorm();
}

References GetCenter(), and m_start.

Referenced by PNS_LOG_VIEWER_OVERLAY::Arc(), PLOTTER::Arc(), CheckArcGeom(), Collide(), ConvertToPolyline(), ROUTER_PREVIEW_ITEM::drawLineChain(), ROUTER_PREVIEW_ITEM::drawShape(), GetLength(), Intersect(), IntersectLine(), TransformArcToPolygon(), and update_bbox().

GetStartAngle()

double SHAPE_ARC::GetStartAngle

(

)

const

Returns

the start angle of the arc shape in degrees, normalized between 0.0, 360.0 deg.

Definition at line 404 of file shape_arc.cpp.

{
 VECTOR2D d( m_start - GetCenter() );

 auto ang = 180.0 / M_PI * atan2( d.y, d.x );

 return NormalizeAngleDegrees( ang, 0.0, 360.0 );
}

References GetCenter(), m_start, NormalizeAngleDegrees(), VECTOR2< T >::x, and VECTOR2< T >::y.

Referenced by PNS_LOG_VIEWER_OVERLAY::Arc(), PLOTTER::Arc(), CheckArcGeom(), Collide(), ConvertToPolyline(), ROUTER_PREVIEW_ITEM::drawLineChain(), ROUTER_PREVIEW_ITEM::drawShape(), sliceContainsPoint(), TransformArcToPolygon(), and update_bbox().

GetWidth()

int SHAPE_ARC::GetWidth ( ) const

inline

Definition at line 156 of file shape_arc.h.

 {
 return m_width;
 }

References m_width.

Referenced by GERBER_PLOTTER::Arc(), PNS_LOG_VIEWER_OVERLAY::Arc(), PLOTTER::Arc(), PNS::ArcHull(), BOOST_AUTO_TEST_CASE(), SHAPE_LINE_CHAIN::Collide(), Collide(), collideArc2Arc(), BOARD_ADAPTER::createPadWithClearance(), ROUTER_PREVIEW_ITEM::drawShape(), drawShapes(), operator<<(), and PNS::ARC::Width().

HasIndexableSubshapes()

virtual bool SHAPE_BASE::HasIndexableSubshapes ( ) const

inlinevirtualinherited

Reimplemented in SHAPE_POLY_SET, and SHAPE_COMPOUND.

Definition at line 99 of file shape.h.

 {
 return false;
 }

Referenced by SHAPE_COMPOUND::AddShape(), and ROUTER_PREVIEW_ITEM::ViewDraw().

Intersect()

int SHAPE_ARC::Intersect	(	const SHAPE_ARC &	aArc,
		std::vector< VECTOR2I > *	aIpsBuffer
	)		const

Find intersection points between this arc and aArc.

Ignores arc width.

Parameters

aSeg
aIpsBuffer	Buffer to store the resulting intersection points (if any)

Returns

Number of intersection points found

Definition at line 279 of file shape_arc.cpp.

{
 CIRCLE thiscirc( GetCenter(), GetRadius() );
 CIRCLE othercirc( aArc.GetCenter(), aArc.GetRadius() );

 std::vector<VECTOR2I> intersections = thiscirc.Intersect( othercirc );

 size_t originalSize = aIpsBuffer->size();

 for( const VECTOR2I& intersection : intersections )
 {
 if( sliceContainsPoint( intersection ) && aArc.sliceContainsPoint( intersection ) )
 aIpsBuffer->push_back( intersection );
 }

 return aIpsBuffer->size() - originalSize;
}

References GetCenter(), GetRadius(), CIRCLE::Intersect(), and sliceContainsPoint().

Referenced by Collide(), and collideArc2Arc().

IntersectLine()

int SHAPE_ARC::IntersectLine	(	const SEG &	aSeg,
		std::vector< VECTOR2I > *	aIpsBuffer
	)		const

Find intersection points between this arc and aSeg, treating aSeg as an infinite line.

Ignores arc width.

Parameters

aSeg	Line to intersect against (treated as an infinite line)
aIpsBuffer	Buffer to store the resulting intersection points (if any)

Returns

Number of intersection points found

Definition at line 261 of file shape_arc.cpp.

{
 CIRCLE circ( GetCenter(), GetRadius() );

 std::vector<VECTOR2I> intersections = circ.IntersectLine( aSeg );

 size_t originalSize = aIpsBuffer->size();

 for( const VECTOR2I& intersection : intersections )
 {
 if( sliceContainsPoint( intersection ) )
 aIpsBuffer->push_back( intersection );
 }

 return aIpsBuffer->size() - originalSize;
}

References GetCenter(), GetRadius(), CIRCLE::IntersectLine(), and sliceContainsPoint().

Referenced by Collide(), and collideArc2Arc().

IsClockwise()

bool SHAPE_ARC::IsClockwise

(

)

const

Definition at line 351 of file shape_arc.cpp.

{
 return GetCentralAngle() < 0;
}

References GetCentralAngle().

Referenced by GERBER_PLOTTER::plotArc(), SHAPE_LINE_CHAIN::Slice(), and SHAPE_LINE_CHAIN::splitArc().

IsNull()

bool SHAPE::IsNull ( ) const

inlineinherited

Return true if the shape is a null shape.

Return values

true	if null :-)

Definition at line 150 of file shape.h.

 {
 return m_type == SH_NULL;
 }

References SHAPE_BASE::m_type, and SH_NULL.

IsSolid()

bool SHAPE_ARC::IsSolid ( ) const

inlineoverridevirtual

Implements SHAPE.

Definition at line 161 of file shape_arc.h.

 {
 return true;
 }

Referenced by CheckArcGeom().

Mirror() [1/2]

void SHAPE_ARC::Mirror	(	bool	aX = true,
		bool	aY = false,
		const VECTOR2I &	aVector = { 0, 0 }
	)

Definition at line 548 of file shape_arc.cpp.

{
 if( aX )
 {
 m_start.x = -m_start.x + 2 * aVector.x;
 m_end.x = -m_end.x + 2 * aVector.x;
 m_mid.x = -m_mid.x + 2 * aVector.x;
 }

 if( aY )
 {
 m_start.y = -m_start.y + 2 * aVector.y;
 m_end.y = -m_end.y + 2 * aVector.y;
 m_mid.y = -m_mid.y + 2 * aVector.y;
 }

 update_bbox();
}

References m_end, m_mid, m_start, update_bbox(), VECTOR2< T >::x, and VECTOR2< T >::y.

Mirror() [2/2]

void SHAPE_ARC::Mirror

(

const SEG &

axis

)

Definition at line 568 of file shape_arc.cpp.

{
 m_start = axis.ReflectPoint( m_start );
 m_end = axis.ReflectPoint( m_end );
 m_mid = axis.ReflectPoint( m_mid );

 update_bbox();
}

References m_end, m_mid, m_start, SEG::ReflectPoint(), and update_bbox().

Move()

void SHAPE_ARC::Move ( const VECTOR2I &  aVector )

overridevirtual

Implements SHAPE.

Definition at line 521 of file shape_arc.cpp.

{
 m_start += aVector;
 m_end += aVector;
 m_mid += aVector;
 update_bbox();
}

References m_end, m_mid, m_start, and update_bbox().

Referenced by PNS::COMPONENT_DRAGGER::Drag().

NewFacet()

FACET * SHAPE::NewFacet ( )

inherited

Definition at line 695 of file wrlfacet.cpp.

{
 FACET* fp = new FACET;
 facets.push_back( fp );
 return fp;
}

References SHAPE::facets.

Referenced by WRL1FACESET::TranslateToSG(), WRL2FACESET::TranslateToSG(), and X3DIFACESET::TranslateToSG().

operator==()

bool SHAPE_ARC::operator== ( SHAPE_ARC const &  aArc ) const

inline

Definition at line 240 of file shape_arc.h.

 {
 return ( aArc.m_start == m_start ) && ( aArc.m_end == m_end ) && ( aArc.m_mid == m_mid )
 && ( aArc.m_width == m_width );
 }

References m_end, m_mid, m_start, and m_width.

Parse()

bool SHAPE::Parse ( std::stringstream &  aStream )

virtualinherited

Reimplemented in SHAPE_POLY_SET, and SHAPE_LINE_CHAIN.

Definition at line 28 of file shape.cpp.

{
 assert( false );
 return false;
}

Reverse()

void SHAPE_ARC::Reverse

(

)

Definition at line 578 of file shape_arc.cpp.

{
 std::swap( m_start, m_end );
}

References m_end, and m_start.

Referenced by CADSTAR_PCB_ARCHIVE_LOADER::getLineChainFromShapes(), CADSTAR_PCB_ARCHIVE_LOADER::makeTracksFromShapes(), and SHAPE_LINE_CHAIN::Reverse().

Reversed()

SHAPE_ARC SHAPE_ARC::Reversed

(

)

const

Definition at line 584 of file shape_arc.cpp.

{
 return SHAPE_ARC( m_end, m_mid, m_start, m_width );
}

References m_end, m_mid, m_start, m_width, and SHAPE_ARC().

Referenced by PNS::NODE::AssembleLine(), BOOST_AUTO_TEST_CASE(), and CONVERT_TOOL::makePolysFromSegs().

Rotate()

void SHAPE_ARC::Rotate ( double  aAngle, const VECTOR2I &  aCenter  )

overridevirtual

Rotate the arc by a given angle about a point.

Parameters

aCenter	is the rotation center.
aAngle	rotation angle in radians.

Implements SHAPE.

Definition at line 530 of file shape_arc.cpp.

{
 m_start -= aCenter;
 m_end -= aCenter;
 m_mid -= aCenter;

 m_start = m_start.Rotate( aAngle );
 m_end = m_end.Rotate( aAngle );
 m_mid = m_mid.Rotate( aAngle );

 m_start += aCenter;
 m_end += aCenter;
 m_mid += aCenter;

 update_bbox();
}

References m_end, m_mid, m_start, VECTOR2< T >::Rotate(), and update_bbox().

SetWidth()

void SHAPE_ARC::SetWidth ( int  aWidth )

inline

Definition at line 151 of file shape_arc.h.

 {
 m_width = aWidth;
 }

References m_width.

Referenced by BOOST_AUTO_TEST_CASE(), SHAPE_LINE_CHAIN::Insert(), and PNS::ARC::SetWidth().

sliceContainsPoint()

bool SHAPE_ARC::sliceContainsPoint ( const VECTOR2I &  p ) const

private

Definition at line 590 of file shape_arc.cpp.

{
 VECTOR2I center = GetCenter();
 double phi = 180.0 / M_PI * atan2( p.y - center.y, p.x - center.x );
 double ca = GetCentralAngle();
 double sa = GetStartAngle();
 double ea;

 if( ca >= 0 )
 {
 ea = sa + ca;
 }
 else
 {
 ea = sa;
 sa += ca;
 }

 return alg::within_wrapped_range( phi, sa, ea, 360.0 );
}

References GetCenter(), GetCentralAngle(), GetStartAngle(), alg::within_wrapped_range(), VECTOR2< T >::x, and VECTOR2< T >::y.

Referenced by Intersect(), and IntersectLine().

Type()

SHAPE_TYPE SHAPE_BASE::Type ( ) const

inlineinherited

Return the type of the shape.

Return values

the

type

Definition at line 94 of file shape.h.

 {
 return m_type;
 }

References SHAPE_BASE::m_type.

Referenced by PNS::DP_GATEWAYS::BuildFromPrimitivePair(), PNS::buildHullForPrimitiveShape(), Collide(), SHAPE_POLY_SET::Collide(), collideShapes(), collideSingleShapes(), PNS::OPTIMIZER::computeBreakouts(), ROUTER_PREVIEW_ITEM::drawShape(), PNS::SOLID::HoleHull(), PNS::SOLID::Hull(), and SHAPE_FILE_IO::Write().

update_bbox()

void SHAPE_ARC::update_bbox ( )

private

Definition at line 298 of file shape_arc.cpp.

{
 std::vector<VECTOR2I> points;
 // Put start and end points in the point list
 points.push_back( m_start );
 points.push_back( m_end );

 double start_angle = GetStartAngle();
 double end_angle = start_angle + GetCentralAngle();

 // we always count quadrants clockwise (increasing angle)
 if( start_angle > end_angle )
 std::swap( start_angle, end_angle );

 int quad_angle_start = std::ceil( start_angle / 90.0 );
 int quad_angle_end = std::floor( end_angle / 90.0 );

 // count through quadrants included in arc
 for( int quad_angle = quad_angle_start; quad_angle <= quad_angle_end; ++quad_angle )
 {
 const int radius = KiROUND( GetRadius() );
 VECTOR2I quad_pt = GetCenter();

 switch( quad_angle % 4 )
 {
 case 0: quad_pt += { radius, 0 }; break;
 case 1:
 case -3: quad_pt += { 0, radius }; break;
 case 2:
 case -2: quad_pt += { -radius, 0 }; break;
 case 3:
 case -1: quad_pt += { 0, -radius }; break;
 default: assert( false );
 }

 points.push_back( quad_pt );
 }

 m_bbox.Compute( points );
}

References BOX2< Vec >::Compute(), GetCenter(), GetCentralAngle(), GetRadius(), GetStartAngle(), KiROUND(), m_bbox, m_end, and m_start.

Referenced by ConstructFromStartEndAngle(), ConstructFromStartEndCenter(), Mirror(), Move(), Rotate(), and SHAPE_ARC().

Member Data Documentation

m_bbox

BOX2I SHAPE_ARC::m_bbox

private

Definition at line 263 of file shape_arc.h.

Referenced by BBox(), SHAPE_ARC(), and update_bbox().

m_end

VECTOR2I SHAPE_ARC::m_end

private

Definition at line 260 of file shape_arc.h.

Referenced by Collide(), ConstructFromStartEndAngle(), ConstructFromStartEndCenter(), ConvertToPolyline(), GetCenter(), GetCentralAngle(), GetChord(), GetEndAngle(), GetP1(), Mirror(), Move(), operator==(), Reverse(), Reversed(), Rotate(), SHAPE_ARC(), and update_bbox().

m_mid

VECTOR2I SHAPE_ARC::m_mid

private

Definition at line 259 of file shape_arc.h.

Referenced by ConstructFromStartEndAngle(), ConstructFromStartEndCenter(), GetArcMid(), GetCenter(), GetCentralAngle(), Mirror(), Move(), operator==(), Reversed(), Rotate(), and SHAPE_ARC().

m_start

VECTOR2I SHAPE_ARC::m_start

private

Definition at line 258 of file shape_arc.h.

Referenced by Collide(), ConstructFromStartEndAngle(), ConstructFromStartEndCenter(), ConvertToPolyline(), GetCenter(), GetCentralAngle(), GetChord(), GetP0(), GetRadius(), GetStartAngle(), Mirror(), Move(), operator==(), Reverse(), Reversed(), Rotate(), SHAPE_ARC(), and update_bbox().

m_type

SHAPE_TYPE SHAPE_BASE::m_type

protectedinherited

< type of our shape

Definition at line 110 of file shape.h.

Referenced by SHAPE::IsNull(), and SHAPE_BASE::Type().

m_width

int SHAPE_ARC::m_width

private

Definition at line 262 of file shape_arc.h.

Referenced by BOOST_AUTO_TEST_CASE(), Collide(), ConstructFromStartEndAngle(), ConvertToPolyline(), GetWidth(), operator==(), Reversed(), SetWidth(), and SHAPE_ARC().

MIN_PRECISION_IU

const int SHAPE::MIN_PRECISION_IU = 4

staticinherited

This is the minimum precision for all the points in a shape.

Definition at line 122 of file shape.h.

Referenced by BOOST_AUTO_TEST_CASE(), DIRECTION_45::BuildInitialTrace(), CompareLength(), CIRCLE::Contains(), EDIT_TOOL::FilletTracks(), and CIRCLE::IntersectLine().

---

The documentation for this class was generated from the following files:

• shape_arc.h
• shape_arc.cpp