#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)
	SHAPE_ARC ctor using center, start, angle. More...

	SHAPE_ARC (const VECTOR2I &aArcStart, const VECTOR2I &aArcMid, const VECTOR2I &aArcEnd, int aWidth)
	SHAPE_ARC ctor. More...

	SHAPE_ARC (const SEG &aSegmentA, const SEG &aSegmentB, int aRadius, int aWidth=0)
	SHAPE_ARC ctor. 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)
	Constructs this arc from the given start, end and angle. 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...

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
	Function Rotate rotates 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

const SHAPE_LINE_CHAIN	ConvertToPolyline (double aAccuracy=0.005 *PCB_IU_PER_MM) const
	Constructs a SHAPE_LINE_CHAIN of segments from a given arc. More...

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 bool	Collide (const SHAPE aShape, int aClearance=0, int aActual=nullptr, VECTOR2I *aLocation=nullptr) const

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 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 ()

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`
	)

SHAPE_ARC ctor 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 33 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
	)

SHAPE_ARC ctor.

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 48 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`
	)

SHAPE_ARC ctor.

Builds 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 57 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, betweeen 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 162 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 77 of file shape_arc.h.

77 {}

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 305 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 CheckArcGeom(), Collide(), and GERBER_DRAW_ITEM::GetBoundingBox().

◆ CalcShape()

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

inherited

Definition at line 713 of file wrlfacet.cpp.

 {
     if( facets.empty() || !facets.front()->HasMinPoints() )
         return NULL;
 
     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 NULL;
 
     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 NULL;
 
     IFSG_SHAPE shapeNode( false );
 
     if( !isVRML2 )
     {
         shapeNode.NewNode( aParent );
 
         if( aColor )
         {
             if( NULL == 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_SHAPE::NewNode(), IFSG_FACESET::NewNode(), NULL, IFSG_COLORS::SetColorList(), IFSG_COORDS::SetCoordsList(), IFSG_NORMALS::SetNormalList(), SGPOINT::x, SGPOINT::y, and SGPOINT::z.

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

◆ ccw()

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

inlineprivate

Definition at line 164 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 79 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 191 of file shape_arc.cpp.

 {
     if( aSeg.A == aSeg.B )
         return Collide( aSeg.A, aClearance, aActual, aLocation );
 
     int minDist = aClearance + m_width / 2;
     VECTOR2I center = GetCenter();
     ecoord dist_sq;
     ecoord closest_dist_sq = VECTOR2I::ECOORD_MAX;
     VECTOR2I nearest;
 
     VECTOR2I ab = ( aSeg.B - aSeg.A );
     VECTOR2I ac = ( center - aSeg.A );
 
     ecoord lenAbSq = ab.SquaredEuclideanNorm();
     double lambda = (double) ac.Dot( ab ) / (double) lenAbSq;
 
     if( lambda >= 0.0 && lambda <= 1.0 )
     {
         VECTOR2I p;
 
         p.x = (double) aSeg.A.x * lambda + (double) aSeg.B.x * (1.0 - lambda);
         p.y = (double) aSeg.A.y * lambda + (double) aSeg.B.y * (1.0 - lambda);
 
         dist_sq = ( m_start - p ).SquaredEuclideanNorm();
 
         if( dist_sq < closest_dist_sq )
         {
             closest_dist_sq = dist_sq;
             nearest = p;
         }
 
         dist_sq = ( m_end - p ).SquaredEuclideanNorm();
 
         if( dist_sq < closest_dist_sq )
         {
             closest_dist_sq = dist_sq;
             nearest = p;
         }
     }
 
     dist_sq = aSeg.SquaredDistance( m_start );
 
     if( dist_sq < closest_dist_sq )
     {
         closest_dist_sq = dist_sq;
         nearest = m_start;
     }
 
     dist_sq = aSeg.SquaredDistance( m_end );
 
     if( dist_sq < closest_dist_sq )
     {
         closest_dist_sq = dist_sq;
         nearest = m_end;
     }
 
     if( closest_dist_sq == 0 || closest_dist_sq < SEG::Square( minDist ) )
     {
         if( aLocation )
             *aLocation = nearest;
 
         if( aActual )
             *aActual = std::max( 0, (int) sqrt( closest_dist_sq ) - m_width / 2 );
 
         return true;
     }
 
     return false;
 }

References SEG::A, SEG::B, VECTOR2< T >::Dot(), VECTOR2< T >::ECOORD_MAX, GetCenter(), m_end, m_start, m_width, SEG::Square(), SEG::SquaredDistance(), VECTOR2< T >::SquaredEuclideanNorm(), VECTOR2< T >::x, and VECTOR2< T >::y.

Referenced by BOOST_AUTO_TEST_CASE().

◆ 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 316 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::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 881 of file shape_collisions.cpp.

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

References collideShapes().

◆ Collide() [4/4]

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

virtualinherited

Reimplemented in SHAPE_POLY_SET, SHAPE_RECT, SHAPE_SEGMENT, and SHAPE_COMPOUND.

Definition at line 887 of file shape_collisions.cpp.

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

References collideShapes().

◆ ConstructFromStartEndAngle()

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

Constructs 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

Definition at line 173 of file shape_arc.cpp.

 {
     m_start = aStart;
     m_mid   = aStart;
     m_end   = aEnd;
     m_width = aWidth;
 
     VECTOR2I center( GetArcCenter( aStart, aEnd, aAngle ) );
 
     RotatePoint( m_mid, center, -aAngle * 10.0 / 2.0 );
 
     update_bbox();
 
     return *this;
 }

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

Referenced by DIRECTION_45::BuildInitialTrace().

◆ ConvertToPolyline()

const SHAPE_LINE_CHAIN SHAPE_ARC::ConvertToPolyline ( double aAccuracy = 0.005 * PCB_IU_PER_MM ) const

Constructs a SHAPE_LINE_CHAIN of segments from a given arc.

Parameters

aAccuracy maximum divergence from true arc given in internal units ** Note that 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 SHAPE_LINE_CHAIN

Definition at line 408 of file shape_arc.cpp.

 {
     SHAPE_LINE_CHAIN rv;
     double r = GetRadius();
     double sa = GetStartAngle();
     auto   c = GetCenter();
     double ca = GetCentralAngle();
 
     int n;
 
     if( r < aAccuracy )
         n = 0;
     else
         n = GetArcToSegmentCount( r, aAccuracy, ca );
 
     // 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 += aAccuracy / 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 );
 
     return rv;
 }

References SHAPE_LINE_CHAIN::Append(), GetArcToSegmentCount(), GetCenter(), GetCentralAngle(), GetRadius(), GetStartAngle(), KiROUND(), m_end, and m_start.

Referenced by SHAPE_LINE_CHAIN::Append(), PNS::ArcHull(), Collide(), BOARD_ADAPTER::createPadWithClearance(), SHAPE_LINE_CHAIN::Insert(), CADSTAR_SCH_ARCHIVE_LOADER::loadShapeVertices(), PCB_SHAPE::MakeEffectiveShapes(), SHAPE_LINE_CHAIN::SHAPE_LINE_CHAIN(), 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 97 of file shape_arc.h.

97 { return m_mid; }

SHAPE_ARC::m_mid

VECTOR2I m_mid

Definition: shape_arc.h:174

References m_mid.

Referenced by ARC::ARC(), PCB_GRID_HELPER::computeAnchors(), and PNS_KICAD_IFACE::UpdateItem().

◆ GetCenter()

VECTOR2I SHAPE_ARC::GetCenter ( ) const

Definition at line 383 of file shape_arc.cpp.

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

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

Referenced by CheckArcGeom(), Collide(), ConvertToPolyline(), ROUTER_PREVIEW_ITEM::drawLineChain(), ROUTER_PREVIEW_ITEM::drawShape(), GetCentralAngle(), GetEndAngle(), GetRadius(), GetStartAngle(), and update_bbox().

◆ GetCentralAngle()

double SHAPE_ARC::GetCentralAngle ( ) const

Definition at line 389 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 CheckArcGeom(), Collide(), ConvertToPolyline(), ROUTER_PREVIEW_ITEM::drawLineChain(), ROUTER_PREVIEW_ITEM::drawShape(), FABMASTER::loadFootprints(), FABMASTER::loadGraphics(), FABMASTER::loadOutline(), and update_bbox().

◆ GetChord()

SEG SHAPE_ARC::GetChord ( ) const

inline

Definition at line 142 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

Definition at line 373 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 CheckArcGeom(), and Collide().

◆ 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.

104 { 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.

106 { }

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

◆ GetP0()

const VECTOR2I& SHAPE_ARC::GetP0 ( ) const

inline

Definition at line 95 of file shape_arc.h.

95 { return m_start; }

SHAPE_ARC::m_start

VECTOR2I m_start

Definition: shape_arc.h:173

References m_start.

Referenced by PCB_GRID_HELPER::AlignToArc(), PNS::ARC::Anchor(), ARC::ARC(), DIRECTION_45::BuildInitialTrace(), PCB_GRID_HELPER::computeAnchors(), DIRECTION_45::DIRECTION_45(), EDIT_TOOL::FilletTracks(), PNS::LINE_PLACER::handlePullback(), and PNS_KICAD_IFACE::UpdateItem().

◆ GetP1()

const VECTOR2I& SHAPE_ARC::GetP1 ( ) const

inline

Definition at line 96 of file shape_arc.h.

96 { return m_end; }

SHAPE_ARC::m_end

VECTOR2I m_end

Definition: shape_arc.h:175

References m_end.

Referenced by PCB_GRID_HELPER::AlignToArc(), PNS::ARC::Anchor(), ARC::ARC(), DIRECTION_45::BuildInitialTrace(), CheckArcGeom(), PCB_GRID_HELPER::computeAnchors(), DIRECTION_45::DIRECTION_45(), EDIT_TOOL::FilletTracks(), and PNS_KICAD_IFACE::UpdateItem().

◆ GetRadius()

double SHAPE_ARC::GetRadius ( ) const

Definition at line 402 of file shape_arc.cpp.

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

References GetCenter(), and m_start.

Referenced by CheckArcGeom(), Collide(), ConvertToPolyline(), ROUTER_PREVIEW_ITEM::drawLineChain(), ROUTER_PREVIEW_ITEM::drawShape(), and update_bbox().

◆ GetStartAngle()

double SHAPE_ARC::GetStartAngle ( ) const

Definition at line 363 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 CheckArcGeom(), Collide(), ConvertToPolyline(), ROUTER_PREVIEW_ITEM::drawLineChain(), ROUTER_PREVIEW_ITEM::drawShape(), and update_bbox().

◆ GetWidth()

int SHAPE_ARC::GetWidth ( ) const

inline

Definition at line 112 of file shape_arc.h.

     {
         return m_width;
     }

References m_width.

Referenced by PNS::ArcHull(), Collide(), BOARD_ADAPTER::createPadWithClearance(), ROUTER_PREVIEW_ITEM::drawShape(), 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().

◆ 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 117 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 477 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 497 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 450 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().

◆ NewFacet()

FACET * SHAPE::NewFacet ( )

inherited

Definition at line 705 of file wrlfacet.cpp.

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

References SHAPE::facets.

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

◆ 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 507 of file shape_arc.cpp.

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

References m_end, and m_start.

Referenced by SHAPE_LINE_CHAIN::Reverse().

◆ Reversed()

SHAPE_ARC SHAPE_ARC::Reversed ( ) const

Definition at line 513 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().

◆ Rotate()

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

overridevirtual

Function Rotate rotates 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 459 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 107 of file shape_arc.h.

     {
         m_width = aWidth;
     }

References m_width.

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

◆ 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 263 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(), Mirror(), Move(), Rotate(), and SHAPE_ARC().

Member Data Documentation

◆ m_bbox

BOX2I SHAPE_ARC::m_bbox

private

Definition at line 178 of file shape_arc.h.

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

◆ m_end

VECTOR2I SHAPE_ARC::m_end

private

Definition at line 175 of file shape_arc.h.

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

◆ m_mid

VECTOR2I SHAPE_ARC::m_mid

private

Definition at line 174 of file shape_arc.h.

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

◆ m_start

VECTOR2I SHAPE_ARC::m_start

private

Definition at line 173 of file shape_arc.h.

Referenced by Collide(), ConstructFromStartEndAngle(), ConvertToPolyline(), GetCenter(), GetCentralAngle(), GetChord(), GetP0(), GetRadius(), GetStartAngle(), Mirror(), Move(), 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 177 of file shape_arc.h.

Referenced by BOOST_AUTO_TEST_CASE(), Collide(), ConstructFromStartEndAngle(), GetWidth(), 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(), EDIT_TOOL::FilletTracks(), and CIRCLE::IntersectLine().

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

Public Member Functions

Static Public Attributes

Protected Types

Protected Attributes

Private Member Functions

Private Attributes

Detailed Description

Member Typedef Documentation

◆ ecoord

Constructor & Destructor Documentation

◆ SHAPE_ARC() [1/5]

◆ SHAPE_ARC() [2/5]

◆ SHAPE_ARC() [3/5]

◆ SHAPE_ARC() [4/5]

◆ SHAPE_ARC() [5/5]

◆ ~SHAPE_ARC()

Member Function Documentation

◆ BBox()

◆ CalcShape()

◆ ccw()

◆ Centre()

◆ Clone()

◆ Collide() [1/4]

◆ Collide() [2/4]

◆ Collide() [3/4]

◆ Collide() [4/4]

◆ ConstructFromStartEndAngle()

◆ ConvertToPolyline()

◆ Format()

◆ GetArcMid()

◆ GetCenter()

◆ GetCentralAngle()

◆ GetChord()

◆ GetEndAngle()

◆ GetIndexableSubshapeCount()

◆ GetIndexableSubshapes()

◆ GetP0()

◆ GetP1()

◆ GetRadius()

◆ GetStartAngle()

◆ GetWidth()

◆ HasIndexableSubshapes()

◆ IsNull()

◆ IsSolid()

◆ Mirror() [1/2]

◆ Mirror() [2/2]

◆ Move()

◆ NewFacet()

◆ Parse()

◆ Reverse()

◆ Reversed()

◆ Rotate()

◆ SetWidth()

◆ Type()

◆ update_bbox()

Member Data Documentation

◆ m_bbox

◆ m_end

◆ m_mid

◆ m_start

◆ m_type

◆ m_width

◆ MIN_PRECISION_IU