shape_arc.h

Go to the documentation of this file.

/*
 * This program source code file is part of KiCad, a free EDA CAD application.
 *
 * Copyright (C) 2018 CERN
 * Copyright (C) 2019-2022 KiCad Developers, see AUTHORS.txt for contributors.
 * @author Tomasz Wlostowski <[email protected]>
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, you may find one here:
 * http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
 * or you may search the http://www.gnu.org website for the version 2 license,
 * or you may write to the Free Software Foundation, Inc.,
 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
 */
 
#ifndef __SHAPE_ARC_H
#define __SHAPE_ARC_H
 
#include <geometry/shape.h>
#include <base_units.h>
#include <math/vector2d.h> // for VECTOR2I
#include <geometry/eda_angle.h>
 
class SHAPE_LINE_CHAIN;
 
class SHAPE_ARC : public SHAPE
{
public:
 
 SHAPE_ARC() :
 SHAPE( SH_ARC ),
 m_width( 0 )
 {};
 
 SHAPE_ARC( const VECTOR2I& aArcCenter, const VECTOR2I& aArcStartPoint,
 const EDA_ANGLE& aCenterAngle, int aWidth = 0 );
 
 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 );
 
 SHAPE_ARC( const SHAPE_ARC& aOther );
 
 virtual ~SHAPE_ARC() {}
 
 SHAPE* Clone() const override
 {
 return new SHAPE_ARC( *this );
 }
 
 SHAPE_ARC& ConstructFromStartEndAngle( const VECTOR2I& aStart, const VECTOR2I& aEnd,
 const EDA_ANGLE& aAngle, double aWidth = 0 );
 
 SHAPE_ARC& ConstructFromStartEndCenter( const VECTOR2I& aStart, const VECTOR2I& aEnd,
 const VECTOR2I& aCenter, bool aClockwise = false,
 double aWidth = 0 );
 
 const VECTOR2I& GetP0() const { return m_start; }
 const VECTOR2I& GetP1() const { return m_end; }
 const VECTOR2I& GetArcMid() const { return m_mid; }
 VECTOR2I GetCenter() const;
 
 const BOX2I BBox( int aClearance = 0 ) const override;
 
 VECTOR2I NearestPoint( const VECTOR2I& aP ) const;
 
 bool Collide( const SEG& aSeg, int aClearance = 0, int* aActual = nullptr,
 VECTOR2I* aLocation = nullptr ) const override;
 bool Collide( const VECTOR2I& aP, int aClearance = 0, int* aActual = nullptr,
 VECTOR2I* aLocation = nullptr ) const override;
 
 
 bool Collide( const SHAPE* aShape, int aClearance = 0, int* aActual = nullptr,
 VECTOR2I* aLocation = nullptr ) const override
 {
 return SHAPE::Collide( aShape, aClearance, aActual, aLocation );
 }
 
 int IntersectLine( const SEG& aSeg, std::vector<VECTOR2I>* aIpsBuffer ) const;
 
 int Intersect( const SHAPE_ARC& aArc, std::vector<VECTOR2I>* aIpsBuffer ) const;
 
 bool IsClockwise() const;
 
 void SetWidth( int aWidth )
 {
 m_width = aWidth;
 }
 
 int GetWidth() const
 {
 return m_width;
 }
 
 bool IsSolid() const override
 {
 return true;
 }
 
 void Move( const VECTOR2I& aVector ) override;
 
 void Rotate( const EDA_ANGLE& aAngle, const VECTOR2I& aCenter ) override;
 
 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
 {
 return SEG( m_start, m_end );
 }
 
 EDA_ANGLE GetCentralAngle() const;
 
 EDA_ANGLE GetStartAngle() const;
 
 EDA_ANGLE GetEndAngle() const;
 
 double GetLength() const;
 
 static double DefaultAccuracyForPCB(){ return 0.005 * PCB_IU_PER_MM; }
 
 const SHAPE_LINE_CHAIN ConvertToPolyline( double aAccuracy = DefaultAccuracyForPCB(),
 double* aEffectiveAccuracy = nullptr ) const;
 
 bool operator==( SHAPE_ARC const& aArc ) const
 {
 return ( aArc.m_start == m_start ) && ( aArc.m_end == m_end ) && ( aArc.m_mid == m_mid )
 && ( aArc.m_width == m_width );
 }
 
 void TransformToPolygon( SHAPE_POLY_SET& aBuffer, int aError,
 ERROR_LOC aErrorLoc ) const override;
 
private:
 bool ccw( const VECTOR2I& aA, const VECTOR2I& aB, const VECTOR2I& aC ) const
 {
 return ( ecoord{ aC.y } - aA.y ) * ( ecoord{ aB.x } - aA.x ) >
 ( ecoord{ aB.y } - aA.y ) * ( ecoord{ aC.x } - aA.x );
 }
 
 void update_bbox();
 
 bool sliceContainsPoint( const VECTOR2I& p ) const;
 
private:
 VECTOR2I m_start;
 VECTOR2I m_mid;
 VECTOR2I m_end;
 
 int m_width;
 BOX2I m_bbox;
};
 
// Required for Boost Test BOOST_CHECK_EQUAL:
std::ostream& operator<<( std::ostream& aStream, const SHAPE_ARC& aArc );
 
#endif