SHAPE_POLY_SET Class Reference

Represent a set of closed polygons. More...

#include <shape_poly_set.h>

Inheritance diagram for SHAPE_POLY_SET:

Classes
class	ITERATOR_TEMPLATE
	Base class for iterating over all vertices in a given SHAPE_POLY_SET. More...
class	SEGMENT_ITERATOR_TEMPLATE
	Base class for iterating over all segments in a given SHAPE_POLY_SET. More...
class	TRIANGULATED_POLYGON
struct	VERTEX_INDEX
	Structure to hold the necessary information in order to index a vertex on a SHAPE_POLY_SET object: the polygon index, the contour index relative to the polygon and the vertex index relative the contour. More...

Public Types
enum	POLYGON_MODE { PM_FAST = true, PM_STRICTLY_SIMPLE = false }
	Operations on polygons use a aFastMode param if aFastMode is PM_FAST (true) the result can be a weak polygon if aFastMode is PM_STRICTLY_SIMPLE (false) (default) the result is (theoretically) a strictly simple polygon, but calculations can be really significantly time consuming Most of time PM_FAST is preferable. More...
enum	CORNER_STRATEGY {   ALLOW_ACUTE_CORNERS, CHAMFER_ACUTE_CORNERS, ROUND_ACUTE_CORNERS, CHAMFER_ALL_CORNERS,   ROUND_ALL_CORNERS }
	< define how inflate transform build inflated polygon More...
typedef std::vector< SHAPE_LINE_CHAIN >	POLYGON
	< represents a single polygon outline with holes. More...
typedef ITERATOR_TEMPLATE< VECTOR2I >	ITERATOR
typedef ITERATOR_TEMPLATE< const VECTOR2I >	CONST_ITERATOR
typedef SEGMENT_ITERATOR_TEMPLATE< SEG >	SEGMENT_ITERATOR
typedef SEGMENT_ITERATOR_TEMPLATE< const SEG >	CONST_SEGMENT_ITERATOR

Public Member Functions
	SHAPE_POLY_SET ()
	SHAPE_POLY_SET (const BOX2D &aRect)
	SHAPE_POLY_SET (const SHAPE_LINE_CHAIN &aOutline)
	Construct a SHAPE_POLY_SET with the first outline given by aOutline. More...
	SHAPE_POLY_SET (const SHAPE_POLY_SET &aOther)
	Copy constructor SHAPE_POLY_SET Performs a deep copy of aOther into this. More...
	~SHAPE_POLY_SET ()
SHAPE_POLY_SET &	operator= (const SHAPE_POLY_SET &aOther)
void	CacheTriangulation (bool aPartition=true)
bool	IsTriangulationUpToDate () const
MD5_HASH	GetHash () const
virtual bool	HasIndexableSubshapes () const override
virtual size_t	GetIndexableSubshapeCount () const override
virtual void	GetIndexableSubshapes (std::vector< SHAPE * > &aSubshapes) override
bool	GetRelativeIndices (int aGlobalIdx, VERTEX_INDEX *aRelativeIndices) const
	Convert a global vertex index —i.e., a number that globally identifies a vertex in a concatenated list of all vertices in all contours— and get the index of the vertex relative to the contour relative to the polygon in which it is. More...
bool	GetGlobalIndex (VERTEX_INDEX aRelativeIndices, int &aGlobalIdx) const
	Compute the global index of a vertex from the relative indices of polygon, contour and vertex. More...
SHAPE *	Clone () const override
	Return a dynamically allocated copy of the shape. More...
int	NewOutline ()
	Creates a new hole in a given outline. More...
int	NewHole (int aOutline=-1)
	Adds a new outline to the set and returns its index. More...
int	AddOutline (const SHAPE_LINE_CHAIN &aOutline)
	Adds a new hole to the given outline (default: last) and returns its index. More...
int	AddHole (const SHAPE_LINE_CHAIN &aHole, int aOutline=-1)
	Return the area of this poly set. More...
double	Area ()
	Count the number of arc shapes present. More...
int	ArcCount () const
	Appends all the arcs in this polyset to aArcBuffer. More...
void	GetArcs (std::vector< SHAPE_ARC > &aArcBuffer) const
	Removes all arc references from all the outlines and holes in the polyset. More...
void	ClearArcs ()
	Appends a vertex at the end of the given outline/hole (default: the last outline) More...
int	Append (int x, int y, int aOutline=-1, int aHole=-1, bool aAllowDuplication=false)
	Add a new vertex to the contour indexed by aOutline and aHole (defaults to the outline of the last polygon). More...
void	Append (const SHAPE_POLY_SET &aSet)
	Append a vertex at the end of the given outline/hole (default: the last outline) More...
void	Append (const VECTOR2I &aP, int aOutline=-1, int aHole=-1)
int	Append (SHAPE_ARC &aArc, int aOutline=-1, int aHole=-1)
	Append a new arc to the contour indexed by aOutline and aHole (defaults to the outline of the last polygon). More...
void	InsertVertex (int aGlobalIndex, const VECTOR2I &aNewVertex)
	Adds a vertex in the globally indexed position aGlobalIndex. More...
const VECTOR2I &	CVertex (int aIndex, int aOutline, int aHole) const
	Return the aGlobalIndex-th vertex in the poly set. More...
const VECTOR2I &	CVertex (int aGlobalIndex) const
	Return the index-th vertex in a given hole outline within a given outline. More...
const VECTOR2I &	CVertex (VERTEX_INDEX aIndex) const
bool	GetNeighbourIndexes (int aGlobalIndex, int *aPrevious, int *aNext)
	Return the global indexes of the previous and the next corner of the aGlobalIndex-th corner of a contour in the polygon set. More...
bool	IsPolygonSelfIntersecting (int aPolygonIndex) const
	Check whether the aPolygonIndex-th polygon in the set is self intersecting. More...
bool	IsSelfIntersecting () const
	Check whether any of the polygons in the set is self intersecting. More...
unsigned int	TriangulatedPolyCount () const
	Return the number of outlines in the set. More...
int	OutlineCount () const
	Return the number of vertices in a given outline/hole. More...
int	VertexCount (int aOutline=-1, int aHole=-1) const
	Returns the number of holes in a given outline. More...
int	HoleCount (int aOutline) const
	Return the reference to aIndex-th outline in the set. More...
SHAPE_LINE_CHAIN &	Outline (int aIndex)
const SHAPE_LINE_CHAIN &	Outline (int aIndex) const
SHAPE_POLY_SET	Subset (int aFirstPolygon, int aLastPolygon)
	Return a subset of the polygons in this set, the ones between aFirstPolygon and aLastPolygon. More...
SHAPE_POLY_SET	UnitSet (int aPolygonIndex)
	Return the reference to aHole-th hole in the aIndex-th outline. More...
SHAPE_LINE_CHAIN &	Hole (int aOutline, int aHole)
	Return the aIndex-th subpolygon in the set. More...
POLYGON &	Polygon (int aIndex)
const POLYGON &	Polygon (int aIndex) const
const TRIANGULATED_POLYGON *	TriangulatedPolygon (int aIndex) const
const SHAPE_LINE_CHAIN &	COutline (int aIndex) const
const SHAPE_LINE_CHAIN &	CHole (int aOutline, int aHole) const
const POLYGON &	CPolygon (int aIndex) const
ITERATOR	Iterate (int aFirst, int aLast, bool aIterateHoles=false)
	Return an object to iterate through the points of the polygons between aFirst and aLast. More...
ITERATOR	Iterate (int aOutline)
ITERATOR	IterateWithHoles (int aOutline)
ITERATOR	Iterate ()
ITERATOR	IterateWithHoles ()
CONST_ITERATOR	CIterate (int aFirst, int aLast, bool aIterateHoles=false) const
CONST_ITERATOR	CIterate (int aOutline) const
CONST_ITERATOR	CIterateWithHoles (int aOutline) const
CONST_ITERATOR	CIterate () const
CONST_ITERATOR	CIterateWithHoles () const
ITERATOR	IterateFromVertexWithHoles (int aGlobalIdx)
	Return an iterator object, for iterating between aFirst and aLast outline, with or without holes (default: without) More...
SEGMENT_ITERATOR	IterateSegments (int aFirst, int aLast, bool aIterateHoles=false)
	Return an iterator object, for iterating between aFirst and aLast outline, with or without holes (default: without) More...
CONST_SEGMENT_ITERATOR	CIterateSegments (int aFirst, int aLast, bool aIterateHoles=false) const
	Return an iterator object, for iterating aPolygonIdx-th polygon edges. More...
SEGMENT_ITERATOR	IterateSegments (int aPolygonIdx)
	Return an iterator object, for iterating aPolygonIdx-th polygon edges. More...
CONST_SEGMENT_ITERATOR	CIterateSegments (int aPolygonIdx) const
	Return an iterator object, for all outlines in the set (no holes). More...
SEGMENT_ITERATOR	IterateSegments ()
	Returns an iterator object, for all outlines in the set (no holes) More...
CONST_SEGMENT_ITERATOR	CIterateSegments () const
	Returns an iterator object, for all outlines in the set (with holes) More...
SEGMENT_ITERATOR	IterateSegmentsWithHoles ()
	Return an iterator object, for the aOutline-th outline in the set (with holes). More...
SEGMENT_ITERATOR	IterateSegmentsWithHoles (int aOutline)
	Return an iterator object, for the aOutline-th outline in the set (with holes). More...
CONST_SEGMENT_ITERATOR	CIterateSegmentsWithHoles () const
	Return an iterator object, for the aOutline-th outline in the set (with holes). More...
CONST_SEGMENT_ITERATOR	CIterateSegmentsWithHoles (int aOutline) const
void	BooleanAdd (const SHAPE_POLY_SET &b, POLYGON_MODE aFastMode)
	Perform boolean polyset difference For aFastMode meaning, see function booleanOp. More...
void	BooleanSubtract (const SHAPE_POLY_SET &b, POLYGON_MODE aFastMode)
	Perform boolean polyset intersection For aFastMode meaning, see function booleanOp. More...
void	BooleanIntersection (const SHAPE_POLY_SET &b, POLYGON_MODE aFastMode)
	Perform boolean polyset union between a and b, store the result in it self For aFastMode meaning, see function booleanOp. More...
void	BooleanAdd (const SHAPE_POLY_SET &a, const SHAPE_POLY_SET &b, POLYGON_MODE aFastMode)
	Perform boolean polyset difference between a and b, store the result in it self For aFastMode meaning, see function booleanOp. More...
void	BooleanSubtract (const SHAPE_POLY_SET &a, const SHAPE_POLY_SET &b, POLYGON_MODE aFastMode)
	Perform boolean polyset intersection between a and b, store the result in it self For aFastMode meaning, see function booleanOp. More...
void	BooleanIntersection (const SHAPE_POLY_SET &a, const SHAPE_POLY_SET &b, POLYGON_MODE aFastMode)
void	Inflate (int aAmount, int aCircleSegCount, CORNER_STRATEGY aCornerStrategy=ROUND_ALL_CORNERS)
	Perform outline inflation/deflation. More...
void	Deflate (int aAmount, int aCircleSegmentsCount, CORNER_STRATEGY aCornerStrategy=ROUND_ALL_CORNERS)
void	InflateWithLinkedHoles (int aFactor, int aCircleSegmentsCount, POLYGON_MODE aFastMode)
	Perform outline inflation/deflation, using round corners. More...
void	Fracture (POLYGON_MODE aFastMode)
	Convert a single outline slitted ("fractured") polygon into a set ouf outlines with holes. More...
void	Unfracture (POLYGON_MODE aFastMode)
	Return true if the polygon set has any holes. More...
bool	HasHoles () const
	Return true if the polygon set has any holes that share a vertex. More...
bool	HasTouchingHoles () const
	Simplify the polyset (merges overlapping polys, eliminates degeneracy/self-intersections) For aFastMode meaning, see function booleanOp. More...
void	Simplify (POLYGON_MODE aFastMode)
int	NormalizeAreaOutlines ()
	Convert a self-intersecting polygon to one (or more) non self-intersecting polygon(s). More...
const std::string	Format () const override
bool	Parse (std::stringstream &aStream) override
void	Move (const VECTOR2I &aVector) override
void	Mirror (bool aX=true, bool aY=false, const VECTOR2I &aRef={ 0, 0 })
	Mirror the line points about y or x (or both) More...
void	Rotate (double aAngle, const VECTOR2I &aCenter={ 0, 0 }) override
	Rotate all vertices by a given angle. More...
bool	IsSolid () const override
const BOX2I	BBox (int aClearance=0) const override
	Compute a bounding box of the shape, with a margin of aClearance a collision. More...
bool	PointOnEdge (const VECTOR2I &aP) const
	Check if point aP lies on an edge or vertex of some of the outlines or holes. More...
bool	Collide (const SHAPE *aShape, int aClearance=0, int *aActual=nullptr, VECTOR2I *aLocation=nullptr) const override
	Check if the boundary of shape (this) lies closer to the shape aShape than aClearance, indicating a collision. More...
bool	Collide (const VECTOR2I &aP, int aClearance=0, int *aActual=nullptr, VECTOR2I *aLocation=nullptr) const override
	Check whether the point aP is either inside or on the edge of the polygon set. More...
bool	Collide (const SEG &aSeg, int aClearance=0, int *aActual=nullptr, VECTOR2I *aLocation=nullptr) const override
	Check whether the segment aSeg collides with the polygon set (or its edge). More...
bool	CollideVertex (const VECTOR2I &aPoint, VERTEX_INDEX &aClosestVertex, int aClearance=0) const
	Check whether aPoint collides with any vertex of any of the contours of the polygon. More...
bool	CollideEdge (const VECTOR2I &aPoint, VERTEX_INDEX &aClosestVertex, int aClearance=0) const
	Check whether aPoint collides with any edge of any of the contours of the polygon. More...
void	BuildBBoxCaches () const
	Construct BBoxCaches for Contains(), below. More...
const BOX2I	BBoxFromCaches () const
bool	Contains (const VECTOR2I &aP, int aSubpolyIndex=-1, int aAccuracy=0, bool aUseBBoxCaches=false) const
	Return true if a given subpolygon contains the point aP. More...
bool	IsEmpty () const
void	RemoveVertex (int aGlobalIndex)
	Delete the aGlobalIndex-th vertex. More...
void	RemoveVertex (VERTEX_INDEX aRelativeIndices)
	Delete the vertex indexed by aRelativeIndex (index of polygon, contour and vertex). More...
void	RemoveAllContours ()
void	RemoveContour (int aContourIdx, int aPolygonIdx=-1)
	Delete the aContourIdx-th contour of the aPolygonIdx-th polygon in the set. More...
int	RemoveNullSegments ()
	Look for null segments; ie, segments whose ends are exactly the same and deletes them. More...
void	SetVertex (const VERTEX_INDEX &aIndex, const VECTOR2I &aPos)
	Accessor function to set the position of a specific point. More...
void	SetVertex (int aGlobalIndex, const VECTOR2I &aPos)
	Set the vertex based on the global index. More...
int	TotalVertices () const
	Delete aIdx-th polygon from the set. More...
void	DeletePolygon (int aIdx)
POLYGON	ChamferPolygon (unsigned int aDistance, int aIndex)
	Return a chamfered version of the aIndex-th polygon. More...
POLYGON	FilletPolygon (unsigned int aRadius, int aErrorMax, int aIndex)
	Return a filleted version of the aIndex-th polygon. More...
SHAPE_POLY_SET	Chamfer (int aDistance)
	Return a chamfered version of the polygon set. More...
SHAPE_POLY_SET	Fillet (int aRadius, int aErrorMax)
	Return a filleted version of the polygon set. More...
SEG::ecoord	SquaredDistanceToPolygon (VECTOR2I aPoint, int aIndex, VECTOR2I *aNearest) const
	Compute the minimum distance between the aIndex-th polygon and aPoint. More...
SEG::ecoord	SquaredDistanceToPolygon (const SEG &aSegment, int aIndex, VECTOR2I *aNearest) const
	Compute the minimum distance between the aIndex-th polygon and aSegment with a possible width. More...
SEG::ecoord	SquaredDistance (VECTOR2I aPoint, VECTOR2I *aNearest=nullptr) const
	Compute the minimum distance squared between aPoint and all the polygons in the set. More...
SEG::ecoord	SquaredDistance (const SEG &aSegment, VECTOR2I *aNearest=nullptr) const
	Compute the minimum distance squared between aSegment and all the polygons in the set. More...
bool	IsVertexInHole (int aGlobalIdx)
	Check whether the aGlobalIndex-th vertex belongs to a hole. 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 VECTOR2I	Centre () const
	Compute a center-of-mass of the shape. More...
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...

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 Types
enum	CORNER_MODE { CHAMFERED, FILLETED }
	Operation ChamferPolygon and FilletPolygon are computed under the private chamferFillet method; this enum is defined to make the necessary distinction when calling this method from the public ChamferPolygon and FilletPolygon methods. More...
typedef std::vector< POLYGON >	POLYSET

Private Member Functions
void	fractureSingle (POLYGON &paths)
void	unfractureSingle (POLYGON &path)
void	importTree (ClipperLib::PolyTree *tree, const std::vector< CLIPPER_Z_VALUE > &aZValueBuffer, const std::vector< SHAPE_ARC > &aArcBuffe)
void	booleanOp (ClipperLib::ClipType aType, const SHAPE_POLY_SET &aOtherShape, POLYGON_MODE aFastMode)
	This is the engine to execute all polygon boolean transforms (AND, OR, ... More...
void	booleanOp (ClipperLib::ClipType aType, const SHAPE_POLY_SET &aShape, const SHAPE_POLY_SET &aOtherShape, POLYGON_MODE aFastMode)
bool	containsSingle (const VECTOR2I &aP, int aSubpolyIndex, int aAccuracy, bool aUseBBoxCaches=false) const
	Check whether the point aP is inside the aSubpolyIndex-th polygon of the polyset. More...
POLYGON	chamferFilletPolygon (CORNER_MODE aMode, unsigned int aDistance, int aIndex, int aErrorMax)
	Return the chamfered or filleted version of the aIndex-th polygon in the set, depending on the aMode selected. More...
bool	hasTouchingHoles (const POLYGON &aPoly) const
MD5_HASH	checksum () const

Private Attributes
POLYSET	m_polys
std::vector< std::unique_ptr< TRIANGULATED_POLYGON > >	m_triangulatedPolys
bool	m_triangulationValid = false
MD5_HASH	m_hash

Detailed Description

Represent a set of closed polygons.

Polygons may be nonconvex, self-intersecting and have holes. Provides boolean operations (using Clipper library as the backend).

Let us define the terms used on this class to clarify methods names and comments:

• Polygon: each polygon in the set.
• Outline: first polyline in each polygon; represents its outer contour.
• Hole: second and following polylines in the polygon.
• Contour: each polyline of each polygon in the set, whether or not it is an outline or a hole.
• Vertex (or corner): each one of the points that define a contour.

TODO: add convex partitioning & spatial index

Definition at line 64 of file shape_poly_set.h.

Member Typedef Documentation

CONST_ITERATOR

typedef ITERATOR_TEMPLATE<const VECTOR2I> SHAPE_POLY_SET::CONST_ITERATOR

Definition at line 473 of file shape_poly_set.h.

CONST_SEGMENT_ITERATOR

typedef SEGMENT_ITERATOR_TEMPLATE<const SEG> SHAPE_POLY_SET::CONST_SEGMENT_ITERATOR

Definition at line 477 of file shape_poly_set.h.

ecoord

typedef VECTOR2I::extended_type SHAPE::ecoord

protectedinherited

Definition at line 236 of file shape.h.

ITERATOR

typedef ITERATOR_TEMPLATE<VECTOR2I> SHAPE_POLY_SET::ITERATOR

Definition at line 472 of file shape_poly_set.h.

POLYGON

typedef std::vector<SHAPE_LINE_CHAIN> SHAPE_POLY_SET::POLYGON

< represents a single polygon outline with holes.

The first entry is the outline, the remaining (if any), are the holes N.B. SWIG only supports typedef, so avoid c++ 'using' keyword

Definition at line 70 of file shape_poly_set.h.

POLYSET

typedef std::vector<POLYGON> SHAPE_POLY_SET::POLYSET

private

Definition at line 1424 of file shape_poly_set.h.

SEGMENT_ITERATOR

typedef SEGMENT_ITERATOR_TEMPLATE<SEG> SHAPE_POLY_SET::SEGMENT_ITERATOR

Definition at line 476 of file shape_poly_set.h.

Member Enumeration Documentation

CORNER_MODE

enum SHAPE_POLY_SET::CORNER_MODE

private

Operation ChamferPolygon and FilletPolygon are computed under the private chamferFillet method; this enum is defined to make the necessary distinction when calling this method from the public ChamferPolygon and FilletPolygon methods.

Enumerator
CHAMFERED
FILLETED

Definition at line 1396 of file shape_poly_set.h.

    {
        CHAMFERED,
        FILLETED
    };

CORNER_STRATEGY

enum SHAPE_POLY_SET::CORNER_STRATEGY

< define how inflate transform build inflated polygon

Enumerator
ALLOW_ACUTE_CORNERS	just inflate the polygon. Acute angles create spikes
CHAMFER_ACUTE_CORNERS	Acute angles are chamfered.
ROUND_ACUTE_CORNERS	Acute angles are rounded.
CHAMFER_ALL_CORNERS	All angles are chamfered. The distance between new and old polygon edges is not constant, but do not change a lot
ROUND_ALL_CORNERS	All angles are rounded. The distance between new and old polygon edges is constant

Definition at line 966 of file shape_poly_set.h.

    {
        ALLOW_ACUTE_CORNERS,    
        CHAMFER_ACUTE_CORNERS,  
        ROUND_ACUTE_CORNERS,    
        CHAMFER_ALL_CORNERS,    
        ROUND_ALL_CORNERS       
    };

POLYGON_MODE

enum SHAPE_POLY_SET::POLYGON_MODE

Operations on polygons use a aFastMode param if aFastMode is PM_FAST (true) the result can be a weak polygon if aFastMode is PM_STRICTLY_SIMPLE (false) (default) the result is (theoretically) a strictly simple polygon, but calculations can be really significantly time consuming Most of time PM_FAST is preferable.

PM_STRICTLY_SIMPLE can be used in critical cases (Gerber output for instance)

Enumerator
PM_FAST
PM_STRICTLY_SIMPLE

Definition at line 933 of file shape_poly_set.h.

    {
        PM_FAST = true,
        PM_STRICTLY_SIMPLE = false
    };

Constructor & Destructor Documentation

SHAPE_POLY_SET() [1/4]

SHAPE_POLY_SET::SHAPE_POLY_SET

(

)

Definition at line 61 of file shape_poly_set.cpp.

                               :
    SHAPE( SH_POLY_SET )
{
}

Referenced by Clone().

SHAPE_POLY_SET() [2/4]

SHAPE_POLY_SET::SHAPE_POLY_SET

(

const BOX2D &

aRect

)

Definition at line 67 of file shape_poly_set.cpp.

                                                   :
    SHAPE( SH_POLY_SET )
{
    NewOutline();
    Append( VECTOR2I( aRect.GetLeft(),  aRect.GetTop() ) );
    Append( VECTOR2I( aRect.GetRight(), aRect.GetTop() ) );
    Append( VECTOR2I( aRect.GetRight(), aRect.GetBottom() ) );
    Append( VECTOR2I( aRect.GetLeft(),  aRect.GetBottom() ) );
    Outline( 0 ).SetClosed( true );
}

References Append(), BOX2< Vec >::GetBottom(), BOX2< Vec >::GetLeft(), BOX2< Vec >::GetRight(), BOX2< Vec >::GetTop(), NewOutline(), Outline(), and SHAPE_LINE_CHAIN::SetClosed().

SHAPE_POLY_SET() [3/4]

SHAPE_POLY_SET::SHAPE_POLY_SET

(

const SHAPE_LINE_CHAIN &

aOutline

)

Construct a SHAPE_POLY_SET with the first outline given by aOutline.

Parameters

aOutline

is a closed outline

Definition at line 79 of file shape_poly_set.cpp.

                                                                 :
    SHAPE( SH_POLY_SET )
{
    AddOutline( aOutline );
}

References AddOutline().

SHAPE_POLY_SET() [4/4]

SHAPE_POLY_SET::SHAPE_POLY_SET

(

const SHAPE_POLY_SET &

aOther

)

Copy constructor SHAPE_POLY_SET Performs a deep copy of aOther into this.

Parameters

aOther

is the SHAPE_POLY_SET object that will be copied.

Definition at line 86 of file shape_poly_set.cpp.

                                                             :
    SHAPE( aOther ),
    m_polys( aOther.m_polys )
{
    if( aOther.IsTriangulationUpToDate() )
    {
        for( unsigned i = 0; i < aOther.TriangulatedPolyCount(); i++ )
        {
            const TRIANGULATED_POLYGON* poly = aOther.TriangulatedPolygon( i );
            m_triangulatedPolys.push_back( std::make_unique<TRIANGULATED_POLYGON>( *poly ) );
        }

        m_hash = aOther.GetHash();
        m_triangulationValid = true;
    }
    else
    {
        m_triangulationValid = false;
        m_hash = MD5_HASH();
        m_triangulatedPolys.clear();
    }
}

References GetHash(), IsTriangulationUpToDate(), m_hash, m_triangulatedPolys, m_triangulationValid, TriangulatedPolyCount(), and TriangulatedPolygon().

~SHAPE_POLY_SET()

SHAPE_POLY_SET::~SHAPE_POLY_SET

(

)

Definition at line 110 of file shape_poly_set.cpp.

{
}

Member Function Documentation

AddHole()

int SHAPE_POLY_SET::AddHole	(	const SHAPE_LINE_CHAIN &	aHole,
		int	aOutline = -1
	)

Return the area of this poly set.

Definition at line 472 of file shape_poly_set.cpp.

{
    assert( m_polys.size() );

    if( aOutline < 0 )
        aOutline += m_polys.size();

    assert( aOutline < (int)m_polys.size() );

    POLYGON& poly = m_polys[aOutline];

    assert( poly.size() );

    poly.push_back( aHole );

    return poly.size() - 2;
}

References m_polys.

Referenced by ZONE::AddPolygon(), BuildFootprintPolygonOutlines(), KI_TEST::BuildHollowSquare(), KI_TEST::CommonTestData::CommonTestData(), CADSTAR_PCB_ARCHIVE_LOADER::getPolySetFromCadstarShape(), FABMASTER::loadFootprints(), FABMASTER::loadShapePolySet(), FABMASTER::loadZone(), and ALTIUM_PCB::ParseRegions6Data().

AddOutline()

int SHAPE_POLY_SET::AddOutline

(

const SHAPE_LINE_CHAIN &

aOutline

)

Adds a new hole to the given outline (default: last) and returns its index.

Definition at line 458 of file shape_poly_set.cpp.

{
    assert( aOutline.IsClosed() );

    POLYGON poly;

    poly.push_back( aOutline );

    m_polys.push_back( poly );

    return m_polys.size() - 1;
}

References SHAPE_LINE_CHAIN::IsClosed(), and m_polys.

Referenced by ZONE_FILLER::addHatchFillTypeOnZone(), ZONE::AddPolygon(), BOOST_AUTO_TEST_CASE(), buildBoardBoundingBoxPoly(), KI_TEST::BuildHollowSquare(), KI_TEST::BuildPolyset(), KI_TEST::CommonTestData::CommonTestData(), ZONE_FILLER::computeRawFilledArea(), ConvertPolygonToBlocks(), FOOTPRINT::CoverageRatio(), CONVERT_TOOL::CreateLines(), BOARD_ADAPTER::createPadWithClearance(), KIGFX::GERBVIEW_PAINTER::draw(), GEOM_TEST::FilletPolySet(), FOOTPRINT::GetBoundingHull(), IteratorFixture::IteratorFixture(), DSN::SPECCTRA_DB::makeIMAGE(), CONVERT_TOOL::makePolysFromCircles(), CONVERT_TOOL::makePolysFromRects(), CONVERT_TOOL::makePolysFromSegs(), PAD::MergePrimitivesAsPolygon(), NormalizeAreaOutlines(), EAGLE_PLUGIN::packagePolygon(), ALTIUM_PCB::ParsePolygons6Data(), ALTIUM_PCB::ParseRegions6Data(), ALTIUM_PCB::ParseShapeBasedRegions6Data(), partitionPolyIntoRegularCellGrid(), ZONE_CREATE_HELPER::performZoneCutout(), PGPartitionFixture::PGPartitionFixture(), BRDITEMS_PLOTTER::PlotFootprintGraphicItem(), PlotStandardLayer(), SHAPE_POLY_SET(), TestConcaveSquareFillet(), and TestSquareFillet().

Append() [1/4]

int SHAPE_POLY_SET::Append	(	int	x,
		int	y,
		int	aOutline = -1,
		int	aHole = -1,
		bool	aAllowDuplication = false
	)

Add a new vertex to the contour indexed by aOutline and aHole (defaults to the outline of the last polygon).

Parameters

x	is the x coordinate of the new vertex.
y	is the y coordinate of the new vertex.
aOutline	is the index of the polygon.
aHole	is the index of the hole (-1 for the main outline),
aAllowDuplication	is a flag to indicate whether it is allowed to add this corner even if it is duplicated.

Returns

the number of corners of the selected contour after the addition.Merge polygons from two sets.

Definition at line 229 of file shape_poly_set.cpp.

{
    assert( m_polys.size() );

    if( aOutline < 0 )
        aOutline += m_polys.size();

    int idx;

    if( aHole < 0 )
        idx = 0;
    else
        idx = aHole + 1;

    assert( aOutline < (int) m_polys.size() );
    assert( idx < (int) m_polys[aOutline].size() );

    m_polys[aOutline][idx].Append( x, y, aAllowDuplication );

    return m_polys[aOutline][idx].PointCount();
}

References m_polys.

Referenced by AR_AUTOPLACER::addFpBody(), addHoleToPolygon(), ZONE_FILLER::addKnockout(), AR_AUTOPLACER::addPad(), PAD::AddPrimitivePoly(), Append(), ZONE::AppendCorner(), BuildBoardPolygonOutlines(), ZONE_FILLER::buildCopperItemClearances(), BuildFootprintPolygonOutlines(), ConvertOutlineToPolygon(), GERBER_DRAW_ITEM::ConvertSegmentToPolygon(), D_CODE::ConvertShapeToPolygon(), CornerListToPolygon(), BITMAPCONV_INFO::createOutputData(), BOARD_ADAPTER::createPadWithClearance(), CONVERT_TOOL::CreatePolys(), KIGFX::PCB_PAINTER::draw(), KIGFX::GERBVIEW_PAINTER::drawPolygon(), GERBER_FILE_IMAGE::Execute_DCODE_Command(), GERBER_FILE_IMAGE::Execute_G_Command(), CONVERT_TOOL::extractPolygons(), fillArcPOLY(), PCB_BASE_FRAME::FocusOnItem(), FOOTPRINT::GetBoundingHull(), getRectangleAlongCentreLine(), EDA_SHAPE::hitTest(), InsertVertex(), FABMASTER::loadFootprints(), EAGLE_PLUGIN::loadPolygon(), FABMASTER::loadShapePolySet(), FABMASTER::loadZone(), LEGACY_PLUGIN::loadZONE_CONTAINER(), DSN::SPECCTRA_DB::makeIMAGE(), DXF_PLOTTER::PlotPoly(), PlotStandardLayer(), RENDER_3D_OPENGL::reload(), EDA_SHAPE::rotate(), KIGFX::PREVIEW::POLYGON_ITEM::SetPoints(), EDA_SHAPE::SetPolyPoints(), SHAPE_POLY_SET(), DS_DATA_ITEM_POLYGONS::SyncDrawItems(), TransformArcToPolygon(), EDA_TEXT::TransformBoundingBoxWithClearanceToPolygon(), TransformCircleToPolygon(), TransformOvalToPolygon(), TransformRingToPolygon(), TransformRoundChamferedRectToPolygon(), FP_TEXT::TransformShapeWithClearanceToPolygon(), EDA_SHAPE::TransformShapeWithClearanceToPolygon(), PAD::TransformShapeWithClearanceToPolygon(), ZONE::TransformSmoothedOutlineToPolygon(), ZONE::TransformSolidAreasShapesToPolygon(), TransformTrapezoidToPolygon(), PCB_DIM_ALIGNED::updateGeometry(), PCB_DIM_ORTHOGONAL::updateGeometry(), PCB_DIM_LEADER::updateGeometry(), and EE_POINT_EDITOR::updateParentItem().

Append() [2/4]

void SHAPE_POLY_SET::Append

(

const SHAPE_POLY_SET &

aSet

)

Append a vertex at the end of the given outline/hole (default: the last outline)

Definition at line 1620 of file shape_poly_set.cpp.

{
    m_polys.insert( m_polys.end(), aSet.m_polys.begin(), aSet.m_polys.end() );
}

References m_polys.

Append() [3/4]

void SHAPE_POLY_SET::Append	(	const VECTOR2I &	aP,
		int	aOutline = -1,
		int	aHole = -1
	)

Definition at line 1626 of file shape_poly_set.cpp.

{
    Append( aP.x, aP.y, aOutline, aHole );
}

References Append(), VECTOR2< T >::x, and VECTOR2< T >::y.

Append() [4/4]

int SHAPE_POLY_SET::Append	(	SHAPE_ARC &	aArc,
		int	aOutline = -1,
		int	aHole = -1
	)

Append a new arc to the contour indexed by aOutline and aHole (defaults to the outline of the last polygon).

Parameters

aArc	The arc to be inserted
aOutline	Index of the polygon
aHole	Index of the hole (-1 for the main outline)

Returns

the number of points in the arc (including the interpolated points from the arc)

Definition at line 252 of file shape_poly_set.cpp.

{
    assert( m_polys.size() );

    if( aOutline < 0 )
        aOutline += m_polys.size();

    int idx;

    if( aHole < 0 )
        idx = 0;
    else
        idx = aHole + 1;

    assert( aOutline < (int) m_polys.size() );
    assert( idx < (int) m_polys[aOutline].size() );

    m_polys[aOutline][idx].Append( aArc );

    return m_polys[aOutline][idx].PointCount();
}

References m_polys.

ArcCount()

int SHAPE_POLY_SET::ArcCount

(

)

const

Appends all the arcs in this polyset to aArcBuffer.

Definition at line 507 of file shape_poly_set.cpp.

{
    int retval = 0;

    for( const POLYGON& poly : m_polys )
    {
        for( size_t i = 0; i < poly.size(); i++ )
            retval += poly[i].ArcCount();
    }

    return retval;
}

References m_polys.

Referenced by booleanOp().

Area()

double SHAPE_POLY_SET::Area

(

)

Count the number of arc shapes present.

Definition at line 491 of file shape_poly_set.cpp.

{
    double area = 0.0;

    for( int i = 0; i < OutlineCount(); i++ )
    {
        area += Outline( i ).Area();

        for( int j = 0; j < HoleCount( i ); j++ )
            area -= Hole( i, j ).Area();
    }

    return area;
}

References SHAPE_LINE_CHAIN::Area(), Hole(), HoleCount(), Outline(), and OutlineCount().

Referenced by BOOST_AUTO_TEST_CASE(), CADSTAR_PCB_ARCHIVE_LOADER::calculateZonePriorities(), and polygonArea().

BBox()

const BOX2I SHAPE_POLY_SET::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 1367 of file shape_poly_set.cpp.

{
    BOX2I bb;

    for( unsigned i = 0; i < m_polys.size(); i++ )
    {
        if( i == 0 )
            bb = m_polys[i][0].BBox();
        else
            bb.Merge( m_polys[i][0].BBox() );
    }

    bb.Inflate( aClearance );
    return bb;
}

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

Referenced by ZONE_FILLER::addHatchFillTypeOnZone(), PCB_BASE_FRAME::FocusOnItem(), APERTURE_MACRO::GetApertureMacroShape(), PAD::GetBestAnchorPosition(), ZONE::GetBoundingBox(), DS_DRAW_ITEM_POLYPOLYGONS::GetBoundingBox(), GERBER_DRAW_ITEM::GetBoundingBox(), DIALOG_PAD_PROPERTIES::padValuesOK(), partitionPolyIntoRegularCellGrid(), BOARD::TestZoneIntersection(), KIGFX::PREVIEW::POLYGON_ITEM::ViewBBox(), and KIGFX::PREVIEW::CENTRELINE_RECT_ITEM::ViewBBox().

BBoxFromCaches()

const BOX2I SHAPE_POLY_SET::BBoxFromCaches

(

)

const

Definition at line 1384 of file shape_poly_set.cpp.

{
    BOX2I bb;

    for( unsigned i = 0; i < m_polys.size(); i++ )
    {
        if( i == 0 )
            bb = *m_polys[i][0].GetCachedBBox();
        else
            bb.Merge( *m_polys[i][0].GetCachedBBox() );
    }

    return bb;
}

References m_polys, and BOX2< Vec >::Merge().

Referenced by DRC_TEST_PROVIDER_COURTYARD_CLEARANCE::testCourtyardClearances().

BooleanAdd() [1/2]

void SHAPE_POLY_SET::BooleanAdd	(	const SHAPE_POLY_SET &	b,
		POLYGON_MODE	aFastMode
	)

Perform boolean polyset difference For aFastMode meaning, see function booleanOp.

Definition at line 656 of file shape_poly_set.cpp.

{
    booleanOp( ClipperLib::ctUnion, b, aFastMode );
}

References booleanOp().

Referenced by PAD::addPadPrimitivesToPolygon(), BOOST_AUTO_TEST_CASE(), BOOST_FIXTURE_TEST_CASE(), ZONE::BuildSmoothedPoly(), CADSTAR_PCB_ARCHIVE_LOADER::loadCoppers(), ALTIUM_PCB::ParseRegions6Data(), DXF_PLOTTER::PlotPoly(), PlotSolderMaskLayer(), and ZONE::RemoveCutout().

BooleanAdd() [2/2]

void SHAPE_POLY_SET::BooleanAdd	(	const SHAPE_POLY_SET &	a,
		const SHAPE_POLY_SET &	b,
		POLYGON_MODE	aFastMode
	)

Perform boolean polyset difference between a and b, store the result in it self For aFastMode meaning, see function booleanOp.

Definition at line 674 of file shape_poly_set.cpp.

{
    booleanOp( ClipperLib::ctUnion, a, b, aFastMode );
}

References booleanOp().

BooleanIntersection() [1/2]

void SHAPE_POLY_SET::BooleanIntersection	(	const SHAPE_POLY_SET &	b,
		POLYGON_MODE	aFastMode
	)

Perform boolean polyset union between a and b, store the result in it self For aFastMode meaning, see function booleanOp.

Definition at line 668 of file shape_poly_set.cpp.

{
    booleanOp( ClipperLib::ctIntersection, b, aFastMode );
}

References booleanOp().

Referenced by ZONE_FILLER::addHatchFillTypeOnZone(), BOOST_AUTO_TEST_CASE(), ZONE::BuildSmoothedPoly(), ZONE_FILLER::computeRawFilledArea(), ConvertPolygonToBlocks(), PCB_BASE_FRAME::FocusOnItem(), isCopperOutside(), PAD_TOOL::recombinePad(), RENDER_3D_OPENGL::reload(), and TransformOvalToPolygon().

BooleanIntersection() [2/2]

void SHAPE_POLY_SET::BooleanIntersection	(	const SHAPE_POLY_SET &	a,
		const SHAPE_POLY_SET &	b,
		POLYGON_MODE	aFastMode
	)

Definition at line 688 of file shape_poly_set.cpp.

{
    booleanOp( ClipperLib::ctIntersection, a, b, aFastMode );
}

References booleanOp().

booleanOp() [1/2]

void SHAPE_POLY_SET::booleanOp ( ClipperLib::ClipType  aType, const SHAPE_POLY_SET &  aOtherShape, POLYGON_MODE  aFastMode  )

private

This is the engine to execute all polygon boolean transforms (AND, OR, ...

and polygon simplification (merging overlapping polygons).

Parameters

aType	is the transform type ( see ClipperLib::ClipType )
aOtherShape	is the SHAPE_LINE_CHAIN to combine with me.
aFastMode	is an option to choose if the result can be a weak polygon or a strictly simple polygon. if aFastMode is PM_FAST the result can be a weak polygon if aFastMode is PM_STRICTLY_SIMPLE (default) the result is (theoretically) a strictly simple polygon, but calculations can be really significantly time consuming

Definition at line 544 of file shape_poly_set.cpp.

{
    booleanOp( aType, *this, aOtherShape, aFastMode );
}

Referenced by BooleanAdd(), BooleanIntersection(), BooleanSubtract(), and Simplify().

booleanOp() [2/2]

void SHAPE_POLY_SET::booleanOp ( ClipperLib::ClipType  aType, const SHAPE_POLY_SET &  aShape, const SHAPE_POLY_SET &  aOtherShape, POLYGON_MODE  aFastMode  )

private

Definition at line 551 of file shape_poly_set.cpp.

{
    if( ( aShape.OutlineCount() > 1 || aOtherShape.OutlineCount() > 0 )
        && ( aShape.ArcCount() > 0 || aOtherShape.ArcCount() > 0 ) )
    {
        wxFAIL_MSG( "Boolean ops on curved polygons are not supported. You should call "
                    "ClearArcs() before carrying out the boolean operation." );
    }

    ClipperLib::Clipper c;

    c.StrictlySimple( aFastMode == PM_STRICTLY_SIMPLE );

    std::vector<CLIPPER_Z_VALUE> zValues;
    std::vector<SHAPE_ARC> arcBuffer;
    std::map<VECTOR2I, CLIPPER_Z_VALUE> newIntersectPoints;

    for( const POLYGON& poly : aShape.m_polys )
    {
        for( size_t i = 0; i < poly.size(); i++ )
        {
            c.AddPath( poly[i].convertToClipper( i == 0, zValues, arcBuffer ),
                       ClipperLib::ptSubject, true );
        }
    }

    for( const POLYGON& poly : aOtherShape.m_polys )
    {
        for( size_t i = 0; i < poly.size(); i++ )
        {
            c.AddPath( poly[i].convertToClipper( i == 0, zValues, arcBuffer ),
                       ClipperLib::ptClip, true );
        }
    }

    ClipperLib::PolyTree solution;

    ClipperLib::ZFillCallback callback =
            [&]( ClipperLib::IntPoint & e1bot, ClipperLib::IntPoint & e1top,
                ClipperLib::IntPoint & e2bot, ClipperLib::IntPoint & e2top,
                ClipperLib::IntPoint & pt )
            {
                auto arcIndex =
                    [&]( const ssize_t& aZvalue, const ssize_t& aCompareVal = -1 ) -> ssize_t
                    {
                        ssize_t retval;

                        retval = zValues.at( aZvalue ).m_SecondArcIdx;

                        if( retval == -1 || ( aCompareVal > 0 && retval != aCompareVal ) )
                            retval = zValues.at( aZvalue ).m_FirstArcIdx;

                        return retval;
                    };

                auto arcSegment =
                    [&]( const ssize_t& aBottomZ, const ssize_t aTopZ ) -> ssize_t
                    {
                        ssize_t retval = arcIndex( aBottomZ );

                        if( retval != -1 )
                        {
                            if( retval != arcIndex( aTopZ, retval ) )
                                retval = -1; // Not an arc segment as the two indices do not match
                        }

                        return retval;
                    };

                ssize_t e1ArcSegmentIndex = arcSegment( e1bot.Z, e1top.Z );
                ssize_t e2ArcSegmentIndex = arcSegment( e2bot.Z, e2top.Z );

                CLIPPER_Z_VALUE newZval;

                if( e1ArcSegmentIndex != -1 )
                {
                    newZval.m_FirstArcIdx = e1ArcSegmentIndex;
                    newZval.m_SecondArcIdx = e2ArcSegmentIndex;
                }
                else
                {
                    newZval.m_FirstArcIdx = e2ArcSegmentIndex;
                    newZval.m_SecondArcIdx = -1;
                }

                size_t z_value_ptr = zValues.size();
                zValues.push_back( newZval );

                // Only worry about arc segments for later processing
                if( newZval.m_FirstArcIdx != -1 )
                    newIntersectPoints.insert( { VECTOR2I( pt.X, pt.Y ), newZval } );

                pt.Z = z_value_ptr;
                //@todo amend X,Y values to true intersection between arcs or arc and segment
            };

    c.ZFillFunction( callback ); // register callback

    c.Execute( aType, solution, ClipperLib::pftNonZero, ClipperLib::pftNonZero );

    importTree( &solution, zValues, arcBuffer );
}

References ArcCount(), importTree(), CLIPPER_Z_VALUE::m_FirstArcIdx, m_polys, CLIPPER_Z_VALUE::m_SecondArcIdx, OutlineCount(), and PM_STRICTLY_SIMPLE.

BooleanSubtract() [1/2]

void SHAPE_POLY_SET::BooleanSubtract	(	const SHAPE_POLY_SET &	b,
		POLYGON_MODE	aFastMode
	)

Perform boolean polyset intersection For aFastMode meaning, see function booleanOp.

Definition at line 662 of file shape_poly_set.cpp.

{
    booleanOp( ClipperLib::ctDifference, b, aFastMode );
}

References booleanOp().

Referenced by ZONE_FILLER::addHatchFillTypeOnZone(), addHoleToPolygon(), CADSTAR_PCB_ARCHIVE_LOADER::calculateZonePriorities(), ZONE_FILLER::computeRawFilledArea(), BOARD_ADAPTER::createLayers(), BITMAPCONV_INFO::createOutputData(), TRACKS_CLEANER::deleteTracksInPads(), EXPORTER_PCB_VRML::ExportVrmlSolderMask(), PCB_BASE_FRAME::FocusOnItem(), RENDER_3D_OPENGL::generateViasAndPads(), AR_AUTOPLACER::genModuleOnRoutingMatrix(), APERTURE_MACRO::GetApertureMacroShape(), ZONE_FILLER::knockoutThermalReliefs(), NormalizeAreaOutlines(), DIALOG_PAD_PROPERTIES::padValuesOK(), ZONE_CREATE_HELPER::performZoneCutout(), PlotSolderMaskLayer(), RENDER_3D_RAYTRACE::Reload(), RENDER_3D_OPENGL::reload(), and ZONE_FILLER::subtractHigherPriorityZones().

BooleanSubtract() [2/2]

void SHAPE_POLY_SET::BooleanSubtract	(	const SHAPE_POLY_SET &	a,
		const SHAPE_POLY_SET &	b,
		POLYGON_MODE	aFastMode
	)

Perform boolean polyset intersection between a and b, store the result in it self For aFastMode meaning, see function booleanOp.

Definition at line 681 of file shape_poly_set.cpp.

{
    booleanOp( ClipperLib::ctDifference, a, b, aFastMode );
}

References booleanOp().

BuildBBoxCaches()

void SHAPE_POLY_SET::BuildBBoxCaches

(

)

const

Construct BBoxCaches for Contains(), below.

Note

These caches must be built before a group of calls to Contains(). They are not kept up-to-date by editing actions.

Definition at line 1700 of file shape_poly_set.cpp.

{
    for( int polygonIdx = 0; polygonIdx < OutlineCount(); polygonIdx++ )
    {
        COutline( polygonIdx ).GenerateBBoxCache();

        for( int holeIdx = 0; holeIdx < HoleCount( polygonIdx ); holeIdx++ )
            CHole( polygonIdx, holeIdx ).GenerateBBoxCache();
    }
}

References CHole(), COutline(), SHAPE_LINE_CHAIN::GenerateBBoxCache(), HoleCount(), and OutlineCount().

Referenced by ZONE_FILLER::computeRawFilledArea().

CacheTriangulation()

void SHAPE_POLY_SET::CacheTriangulation

(

bool

aPartition = true

)

Definition at line 2297 of file shape_poly_set.cpp.

{
    bool recalculate = !m_hash.IsValid();
    MD5_HASH hash;

    if( !m_triangulationValid )
        recalculate = true;

    if( !recalculate )
    {
        hash = checksum();

        if( m_hash != hash )
        {
            m_hash = hash;
            recalculate = true;
        }
    }

    if( !recalculate )
        return;

    SHAPE_POLY_SET tmpSet;

    if( aPartition )
    {
        // This partitions into regularly-sized grids (1cm in Pcbnew)
        SHAPE_POLY_SET flattened( *this );
        flattened.ClearArcs();
        partitionPolyIntoRegularCellGrid( flattened, 1e7, tmpSet );
    }
    else
    {
        tmpSet = *this;

        if( tmpSet.HasHoles() )
            tmpSet.Fracture( PM_FAST );
    }

    m_triangulatedPolys.clear();
    m_triangulationValid = false;

    while( tmpSet.OutlineCount() > 0 )
    {

        if( !m_triangulatedPolys.empty() && m_triangulatedPolys.back()->GetTriangleCount() == 0 )
            m_triangulatedPolys.erase( m_triangulatedPolys.end() - 1 );

        m_triangulatedPolys.push_back( std::make_unique<TRIANGULATED_POLYGON>() );
        PolygonTriangulation tess( *m_triangulatedPolys.back() );

        // If the tessellation fails, we re-fracture the polygon, which will
        // first simplify the system before fracturing and removing the holes
        // This may result in multiple, disjoint polygons.
        if( !tess.TesselatePolygon( tmpSet.Polygon( 0 ).front() ) )
        {
            tmpSet.Fracture( PM_FAST );
            m_triangulationValid = false;
            continue;
        }

        tmpSet.DeletePolygon( 0 );
        m_triangulationValid = true;
    }

    if( m_triangulationValid )
        m_hash = checksum();
}

References checksum(), ClearArcs(), DeletePolygon(), Fracture(), HasHoles(), MD5_HASH::IsValid(), m_hash, m_triangulatedPolys, m_triangulationValid, OutlineCount(), partitionPolyIntoRegularCellGrid(), PM_FAST, and Polygon().

Referenced by FOOTPRINT::BuildPolyCourtyards(), ConvertPolygonToTriangles(), KIGFX::GERBVIEW_PAINTER::draw(), KIGFX::PCB_PAINTER::draw(), Mirror(), polygon_triangulation_main(), Rotate(), and PNS_KICAD_IFACE_BASE::syncZone().

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

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

Chamfer()

SHAPE_POLY_SET SHAPE_POLY_SET::Chamfer

(

int

aDistance

)

Return a chamfered version of the polygon set.

Parameters

aDistance

is the chamfering distance.

Returns

A set containing the chamfered version of this set.

Definition at line 1997 of file shape_poly_set.cpp.

{
    SHAPE_POLY_SET chamfered;

    for( unsigned int idx = 0; idx < m_polys.size(); idx++ )
        chamfered.m_polys.push_back( ChamferPolygon( aDistance, idx ) );

    return chamfered;
}

References ChamferPolygon(), and m_polys.

Referenced by ZONE_FILLER::addHatchFillTypeOnZone().

chamferFilletPolygon()

SHAPE_POLY_SET::POLYGON SHAPE_POLY_SET::chamferFilletPolygon ( CORNER_MODE  aMode, unsigned int  aDistance, int  aIndex, int  aErrorMax  )

private

Return the chamfered or filleted version of the aIndex-th polygon in the set, depending on the aMode selected.

Parameters

aMode	represent which action will be taken: CORNER_MODE::CHAMFERED will return a chamfered version of the polygon, CORNER_MODE::FILLETED will return a filleted version of the polygon.
aDistance	is the chamfering distance if aMode = CHAMFERED; if aMode = FILLETED, is the filleting radius.
aIndex	is the index of the polygon that will be chamfered/filleted.
aErrorMax	is the maximum allowable deviation of the polygon from the circle if aMode = FILLETED. If aMode = CHAMFERED, it is unused.

Returns

the chamfered/filleted version of the polygon.Return true if the polygon set has any holes that touch share a vertex.

Definition at line 2019 of file shape_poly_set.cpp.

{
    // Null segments create serious issues in calculations. Remove them:
    RemoveNullSegments();

    SHAPE_POLY_SET::POLYGON currentPoly = Polygon( aIndex );
    SHAPE_POLY_SET::POLYGON newPoly;

    // If the chamfering distance is zero, then the polygon remain intact.
    if( aDistance == 0 )
    {
        return currentPoly;
    }

    // Iterate through all the contours (outline and holes) of the polygon.
    for( SHAPE_LINE_CHAIN& currContour : currentPoly )
    {
        // Generate a new contour in the new polygon
        SHAPE_LINE_CHAIN newContour;

        // Iterate through the vertices of the contour
        for( int currVertex = 0; currVertex < currContour.PointCount(); currVertex++ )
        {
            // Current vertex
            int x1 = currContour.CPoint( currVertex ).x;
            int y1 = currContour.CPoint( currVertex ).y;

            // Indices for previous and next vertices.
            int prevVertex;
            int nextVertex;

            // Previous and next vertices indices computation. Necessary to manage the edge cases.

            // Previous vertex is the last one if the current vertex is the first one
            prevVertex = currVertex == 0 ? currContour.PointCount() - 1 : currVertex - 1;

            // next vertex is the first one if the current vertex is the last one.
            nextVertex = currVertex == currContour.PointCount() - 1 ? 0 : currVertex + 1;

            // Previous vertex computation
            double xa = currContour.CPoint( prevVertex ).x - x1;
            double ya = currContour.CPoint( prevVertex ).y - y1;

            // Next vertex computation
            double xb = currContour.CPoint( nextVertex ).x - x1;
            double yb = currContour.CPoint( nextVertex ).y - y1;

            // Compute the new distances
            double  lena    = hypot( xa, ya );
            double  lenb    = hypot( xb, yb );

            // Make the final computations depending on the mode selected, chamfered or filleted.
            if( aMode == CORNER_MODE::CHAMFERED )
            {
                double distance = aDistance;

                // Chamfer one half of an edge at most
                if( 0.5 * lena < distance )
                    distance = 0.5 * lena;

                if( 0.5 * lenb < distance )
                    distance = 0.5 * lenb;

                int nx1 = KiROUND( distance * xa / lena );
                int ny1 = KiROUND( distance * ya / lena );

                newContour.Append( x1 + nx1, y1 + ny1 );

                int nx2 = KiROUND( distance * xb / lenb );
                int ny2 = KiROUND( distance * yb / lenb );

                newContour.Append( x1 + nx2, y1 + ny2 );
            }
            else    // CORNER_MODE = FILLETED
            {
                double cosine = ( xa * xb + ya * yb ) / ( lena * lenb );

                double  radius  = aDistance;
                double  denom   = sqrt( 2.0 / ( 1 + cosine ) - 1 );

                // Do nothing in case of parallel edges
                if( std::isinf( denom ) )
                    continue;

                // Limit rounding distance to one half of an edge
                if( 0.5 * lena * denom < radius )
                    radius = 0.5 * lena * denom;

                if( 0.5 * lenb * denom < radius )
                    radius = 0.5 * lenb * denom;

                // Calculate fillet arc absolute center point (xc, yx)
                double  k = radius / sqrt( .5 * ( 1 - cosine ) );
                double  lenab = sqrt( ( xa / lena + xb / lenb ) * ( xa / lena + xb / lenb ) +
                        ( ya / lena + yb / lenb ) * ( ya / lena + yb / lenb ) );
                double  xc  = x1 + k * ( xa / lena + xb / lenb ) / lenab;
                double  yc  = y1 + k * ( ya / lena + yb / lenb ) / lenab;

                // Calculate arc start and end vectors
                k = radius / sqrt( 2 / ( 1 + cosine ) - 1 );
                double  xs  = x1 + k * xa / lena - xc;
                double  ys  = y1 + k * ya / lena - yc;
                double  xe  = x1 + k * xb / lenb - xc;
                double  ye  = y1 + k * yb / lenb - yc;

                // Cosine of arc angle
                double argument = ( xs * xe + ys * ye ) / ( radius * radius );

                // Make sure the argument is in [-1,1], interval in which the acos function is
                // defined
                if( argument < -1 )
                    argument = -1;
                else if( argument > 1 )
                    argument = 1;

                double arcAngle = acos( argument );
                double arcAngleDegrees = arcAngle * 180.0 / M_PI;
                int    segments = GetArcToSegmentCount( radius, aErrorMax, arcAngleDegrees );

                double  deltaAngle  = arcAngle / segments;
                double  startAngle  = atan2( -ys, xs );

                // Flip arc for inner corners
                if( xa * yb - ya * xb <= 0 )
                    deltaAngle *= -1;

                double  nx  = xc + xs;
                double  ny  = yc + ys;

                newContour.Append( KiROUND( nx ), KiROUND( ny ) );

                // Store the previous added corner to make a sanity check
                int prevX   = KiROUND( nx );
                int prevY   = KiROUND( ny );

                for( int j = 0; j < segments; j++ )
                {
                    nx = xc + cos( startAngle + ( j + 1 ) * deltaAngle ) * radius;
                    ny = yc - sin( startAngle + ( j + 1 ) * deltaAngle ) * radius;

                    // Sanity check: the rounding can produce repeated corners; do not add them.
                    if( KiROUND( nx ) != prevX || KiROUND( ny ) != prevY )
                    {
                        newContour.Append( KiROUND( nx ), KiROUND( ny ) );
                        prevX   = KiROUND( nx );
                        prevY   = KiROUND( ny );
                    }
                }
            }
        }

        // Close the current contour and add it the new polygon
        newContour.SetClosed( true );
        newPoly.push_back( newContour );
    }

    return newPoly;
}

References SHAPE_LINE_CHAIN::Append(), SHAPE_LINE_CHAIN::CPoint(), distance(), GetArcToSegmentCount(), KiROUND(), Polygon(), RemoveNullSegments(), SHAPE_LINE_CHAIN::SetClosed(), and VECTOR2< T >::x.

Referenced by ChamferPolygon(), and FilletPolygon().

ChamferPolygon()

SHAPE_POLY_SET::POLYGON SHAPE_POLY_SET::ChamferPolygon	(	unsigned int	aDistance,
		int	aIndex
	)

Return a chamfered version of the aIndex-th polygon.

Parameters

aDistance	is the chamfering distance.
aIndex	is the index of the polygon to be chamfered.

Returns

A polygon containing the chamfered version of the aIndex-th polygon.

Definition at line 1848 of file shape_poly_set.cpp.

{
    return chamferFilletPolygon( CHAMFERED, aDistance, aIndex, 0 );
}

References CHAMFERED, and chamferFilletPolygon().

Referenced by Chamfer().

checksum()

MD5_HASH SHAPE_POLY_SET::checksum ( ) const

private

Definition at line 2367 of file shape_poly_set.cpp.

{
    MD5_HASH hash;

    hash.Hash( m_polys.size() );

    for( const POLYGON& outline : m_polys )
    {
        hash.Hash( outline.size() );

        for( const SHAPE_LINE_CHAIN& lc : outline )
        {
            hash.Hash( lc.PointCount() );

            for( int i = 0; i < lc.PointCount(); i++ )
            {
                hash.Hash( lc.CPoint( i ).x );
                hash.Hash( lc.CPoint( i ).y );
            }
        }
    }

    hash.Finalize();

    return hash;
}

References MD5_HASH::Finalize(), MD5_HASH::Hash(), and m_polys.

Referenced by CacheTriangulation(), GetHash(), IsTriangulationUpToDate(), and Move().

CHole()

const SHAPE_LINE_CHAIN& SHAPE_POLY_SET::CHole ( int  aOutline, int  aHole  ) const

inline

Definition at line 718 of file shape_poly_set.h.

    {
        return m_polys[aOutline][aHole + 1];
    }

References m_polys.

Referenced by BOARD_ADAPTER::addSolidAreasShapes(), TRIANGLE_DISPLAY_LIST::AddToMiddleContourns(), BuildBBoxCaches(), containsSingle(), KIGFX::PCB_PAINTER::draw(), CADSTAR_PCB_ARCHIVE_LOADER::getZoneFromCadstarShape(), GEOM_TEST::IsPolySetValid(), PlotLayerOutlines(), and HYPERLYNX_EXPORTER::writeNetObjects().

CIterate() [1/3]

CONST_ITERATOR SHAPE_POLY_SET::CIterate ( int  aFirst, int  aLast, bool  aIterateHoles = false  ) const

inline

Definition at line 791 of file shape_poly_set.h.

    {
        CONST_ITERATOR iter;

        iter.m_poly = const_cast<SHAPE_POLY_SET*>( this );
        iter.m_currentPolygon = aFirst;
        iter.m_lastPolygon = aLast < 0 ? OutlineCount() - 1 : aLast;
        iter.m_currentContour = 0;
        iter.m_currentVertex = 0;
        iter.m_iterateHoles = aIterateHoles;

        return iter;
    }

References SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::m_currentContour, SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::m_currentPolygon, SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::m_currentVertex, SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::m_iterateHoles, SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::m_lastPolygon, SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::m_poly, and OutlineCount().

Referenced by ConvertOutlineToPolygon(), EDA_SHAPE::DupPolyPointsList(), EDA_SHAPE::getBoundingBox(), ZONE::GetInteractingZones(), and PNS_KICAD_IFACE_BASE::syncPad().

CIterate() [2/3]

CONST_ITERATOR SHAPE_POLY_SET::CIterate ( int  aOutline ) const

inline

Definition at line 805 of file shape_poly_set.h.

    {
        return CIterate( aOutline, aOutline );
    }

References CIterate().

CIterate() [3/3]

CONST_ITERATOR SHAPE_POLY_SET::CIterate ( ) const

inline

Definition at line 815 of file shape_poly_set.h.

    {
        return CIterate( 0, OutlineCount() - 1 );
    }

References OutlineCount().

Referenced by CIterate(), and CIterateWithHoles().

CIterateSegments() [1/3]

CONST_SEGMENT_ITERATOR SHAPE_POLY_SET::CIterateSegments ( int  aFirst, int  aLast, bool  aIterateHoles = false  ) const

inline

Return an iterator object, for iterating aPolygonIdx-th polygon edges.

Definition at line 862 of file shape_poly_set.h.

References SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_currentContour, SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_currentPolygon, SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_currentSegment, SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_iterateHoles, SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_lastPolygon, SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_poly, and OutlineCount().

Referenced by BRDITEMS_PLOTTER::PlotPcbShape(), projectPointOnSegment(), and PCB_DIMENSION_BASE::segPolyIntersection().

CIterateSegments() [2/3]

CONST_SEGMENT_ITERATOR SHAPE_POLY_SET::CIterateSegments ( int  aPolygonIdx ) const

inline

Return an iterator object, for all outlines in the set (no holes).

Definition at line 884 of file shape_poly_set.h.

References CIterateSegments().

CIterateSegments() [3/3]

CONST_SEGMENT_ITERATOR SHAPE_POLY_SET::CIterateSegments ( ) const

inline

Returns an iterator object, for all outlines in the set (with holes)

Definition at line 896 of file shape_poly_set.h.

References OutlineCount().

Referenced by CIterateSegments(), and CIterateSegmentsWithHoles().

CIterateSegmentsWithHoles() [1/2]

CONST_SEGMENT_ITERATOR SHAPE_POLY_SET::CIterateSegmentsWithHoles ( ) const

inline

Return an iterator object, for the aOutline-th outline in the set (with holes).

Definition at line 914 of file shape_poly_set.h.

References CIterateSegments(), and OutlineCount().

Referenced by CollideEdge(), IsPolygonSelfIntersecting(), and SquaredDistanceToPolygon().

CIterateSegmentsWithHoles() [2/2]

CONST_SEGMENT_ITERATOR SHAPE_POLY_SET::CIterateSegmentsWithHoles ( int  aOutline ) const

inline

Definition at line 920 of file shape_poly_set.h.

    {
        return CIterateSegments( aOutline, aOutline, true );
    }

References CIterateSegments().

CIterateWithHoles() [1/2]

CONST_ITERATOR SHAPE_POLY_SET::CIterateWithHoles ( int  aOutline ) const

inline

Definition at line 810 of file shape_poly_set.h.

    {
        return CIterate( aOutline, aOutline, true );
    }

References CIterate().

Referenced by PCB_POINT_EDITOR::buildForPolyOutline(), ZONE::CIterateWithHoles(), and PCB_GRID_HELPER::computeAnchors().

CIterateWithHoles() [2/2]

CONST_ITERATOR SHAPE_POLY_SET::CIterateWithHoles ( ) const

inline

Definition at line 820 of file shape_poly_set.h.

    {
        return CIterate( 0, OutlineCount() - 1, true );
    }

References CIterate(), and OutlineCount().

Referenced by CollideVertex().

ClearArcs()

void SHAPE_POLY_SET::ClearArcs

(

)

Appends a vertex at the end of the given outline/hole (default: the last outline)

Definition at line 534 of file shape_poly_set.cpp.

{
    for( POLYGON& poly : m_polys )
    {
        for( size_t i = 0; i < poly.size(); i++ )
            poly[i].ClearArcs();
    }
}

References m_polys.

Referenced by BOOST_AUTO_TEST_CASE(), ZONE::BuildSmoothedPoly(), CacheTriangulation(), CADSTAR_PCB_ARCHIVE_LOADER::getPolySetFromCadstarShape(), and CADSTAR_PCB_ARCHIVE_LOADER::loadCoppers().

Clone()

SHAPE * SHAPE_POLY_SET::Clone ( ) const

overridevirtual

Return a dynamically allocated copy of the shape.

Return values

copy	of the shape Creates a new empty polygon in the set and returns its index

Reimplemented from SHAPE.

Definition at line 115 of file shape_poly_set.cpp.

{
    return new SHAPE_POLY_SET( *this );
}

References SHAPE_POLY_SET().

Collide() [1/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 1024 of file shape_collisions.cpp.

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

References collideShapes().

Collide() [2/4]

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

overridevirtual

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
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 1462 of file shape_poly_set.cpp.

{
    // A couple of simple cases are worth trying before we fall back on triangulation.

    if( aShape->Type() == SH_SEGMENT )
    {
        const SHAPE_SEGMENT* segment = static_cast<const SHAPE_SEGMENT*>( aShape );
        int                  extra = segment->GetWidth() / 2;

        if( Collide( segment->GetSeg(), aClearance + extra, aActual, aLocation ) )
        {
            if( aActual )
                *aActual = std::max( 0, *aActual - extra );

            return true;
        }

        return false;
    }

    if( aShape->Type() == SH_CIRCLE )
    {
        const SHAPE_CIRCLE* circle = static_cast<const SHAPE_CIRCLE*>( aShape );
        int                 extra = circle->GetRadius();

        if( Collide( circle->GetCenter(), aClearance + extra, aActual, aLocation ) )
        {
            if( aActual )
                *aActual = std::max( 0, *aActual - extra );

            return true;
        }

        return false;
    }

    const_cast<SHAPE_POLY_SET*>( this )->CacheTriangulation( true );

    int      actual = INT_MAX;
    VECTOR2I location;

    for( const std::unique_ptr<TRIANGULATED_POLYGON>& tpoly : m_triangulatedPolys )
    {
        for( const TRIANGULATED_POLYGON::TRI& tri : tpoly->Triangles() )
        {
            if( aActual || aLocation )
            {
                int      triActual;
                VECTOR2I triLocation;

                if( aShape->Collide( &tri, aClearance, &triActual, &triLocation ) )
                {
                    if( triActual < actual )
                    {
                        actual = triActual;
                        location = triLocation;
                    }
                }
            }
            else    // A much faster version of above
            {
                if( aShape->Collide( &tri, aClearance ) )
                    return true;
            }
        }
    }

    if( actual < INT_MAX )
    {
        if( aActual )
            *aActual = std::max( 0, actual );

        if( aLocation )
            *aLocation = location;

        return true;
    }

    return false;
}

References SHAPE::Collide(), SHAPE_CIRCLE::GetCenter(), SHAPE_CIRCLE::GetRadius(), SHAPE_SEGMENT::GetSeg(), SHAPE_SEGMENT::GetWidth(), m_triangulatedPolys, SH_CIRCLE, SH_SEGMENT, and SHAPE_BASE::Type().

Referenced by calcIsInsideArea(), calcIsInsideCourtyard(), DS_DRAW_ITEM_POLYPOLYGONS::HitTest(), EDA_SHAPE::hitTest(), FOOTPRINT::HitTestAccurate(), PCB_SELECTION_TOOL::hitTestDistance(), and DRC_TEST_PROVIDER_COURTYARD_CLEARANCE::testCourtyardClearances().

Collide() [3/4]

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

overridevirtual

Check whether the point aP is either inside or on the edge of the polygon set.

Note that prior to Jul 2020 we considered the edge to not be part of the polygon. However, most other shapes (rects, circles, segments, etc.) include their edges and the difference was causing issues when used for DRC.

(FWIW, SHAPE_LINE_CHAIN was a split personality, with Collide() including its edges but PointInside() not. That has also been corrected.)

Parameters

aP	is the VECTOR2I point whose collision with respect to the poly set will be tested.
aClearance	is the security distance; if the point lies closer to the polygon than aClearance distance, then there is a collision.
aActual	an optional pointer to an int to store the actual distance in the event of a collision.

Returns

true if the point aP collides with the polygon; false in any other case.

Reimplemented from SHAPE.

Definition at line 1438 of file shape_poly_set.cpp.

{
    if( IsEmpty() || VertexCount() == 0 )
        return false;

    VECTOR2I nearest;
    ecoord dist_sq = SquaredDistance( aP, aLocation ? &nearest : nullptr );

    if( dist_sq == 0 || dist_sq < SEG::Square( aClearance ) )
    {
        if( aLocation )
            *aLocation = nearest;

        if( aActual )
            *aActual = sqrt( dist_sq );

        return true;
    }

    return false;
}

References IsEmpty(), SEG::Square(), SquaredDistance(), and VertexCount().

Collide() [4/4]

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

overridevirtual

Check whether the segment aSeg collides with the polygon set (or its edge).

Note that prior to Jul 2020 we considered the edge to not be part of the polygon. However, most other shapes (rects, circles, segments, etc.) include their edges and the difference was causing issues when used for DRC.

(FWIW, SHAPE_LINE_CHAIN was a split personality, with Collide() including its edges but PointInside() not. That has also been corrected.)

Parameters

aSeg	is the SEG segment whose collision with respect to the poly set will be tested.
aClearance	is the security distance; if the segment passes closer to the polygon than aClearance distance, then there is a collision.
aActual	an optional pointer to an int to store the actual distance in the event of a collision.

Returns

true if the segment aSeg collides with the polygon, false in any other case.

Implements SHAPE.

Definition at line 1417 of file shape_poly_set.cpp.

{
    VECTOR2I nearest;
    ecoord dist_sq = SquaredDistance( aSeg, aLocation ? &nearest : nullptr );

    if( dist_sq == 0 || dist_sq < SEG::Square( aClearance ) )
    {
        if( aLocation )
            *aLocation = nearest;

        if( aActual )
            *aActual = sqrt( dist_sq );

        return true;
    }

    return false;
}

References SEG::Square(), and SquaredDistance().

CollideEdge()

bool SHAPE_POLY_SET::CollideEdge	(	const VECTOR2I &	aPoint,
		SHAPE_POLY_SET::VERTEX_INDEX &	aClosestVertex,
		int	aClearance = 0
	)		const

Check whether aPoint collides with any edge of any of the contours of the polygon.

Parameters

aPoint	is the VECTOR2I point whose collision with respect to the polygon will be tested.
aClearance	is the security distance; if aPoint lies closer to a vertex than aClearance distance, then there is a collision.
aClosestVertex	is the index of the closes vertex to aPoint.

Returns

bool - true if there is a collision, false in any other case.

Definition at line 1671 of file shape_poly_set.cpp.

{
    // Shows whether there was a collision
    bool collision = false;

    for( CONST_SEGMENT_ITERATOR iterator = CIterateSegmentsWithHoles(); iterator; iterator++ )
    {
        const SEG currentSegment = *iterator;
        int distance = currentSegment.Distance( aPoint );

        // Check for collisions
        if( distance <= aClearance )
        {
            collision = true;

            // Update aClearance to look for closer edges
            aClearance = distance;

            // Store the indices that identify the vertex
            aClosestVertex = iterator.GetIndex();
        }
    }

    return collision;
}

References CIterateSegmentsWithHoles(), SEG::Distance(), and distance().

Referenced by EDA_SHAPE::hitTest(), and ZONE::HitTestForEdge().

CollideVertex()

bool SHAPE_POLY_SET::CollideVertex	(	const VECTOR2I &	aPoint,
		SHAPE_POLY_SET::VERTEX_INDEX &	aClosestVertex,
		int	aClearance = 0
	)		const

Check whether aPoint collides with any vertex of any of the contours of the polygon.

Parameters

aPoint	is the VECTOR2I point whose collision with respect to the polygon will be tested.
aClearance	is the security distance; if aPoint lies closer to a vertex than aClearance distance, then there is a collision.
aClosestVertex	is the index of the closes vertex to aPoint.

Returns

bool - true if there is a collision, false in any other case.

Definition at line 1632 of file shape_poly_set.cpp.

{
    // Shows whether there was a collision
    bool collision = false;

    // Difference vector between each vertex and aPoint.
    VECTOR2D    delta;
    double      distance, clearance;

    // Convert clearance to double for precision when comparing distances
    clearance = aClearance;

    for( CONST_ITERATOR iterator = CIterateWithHoles(); iterator; iterator++ )
    {
        // Get the difference vector between current vertex and aPoint
        delta = *iterator - aPoint;

        // Compute distance
        distance = delta.EuclideanNorm();

        // Check for collisions
        if( distance <= clearance )
        {
            collision = true;

            // Update aClearance to look for closer vertices
            clearance = distance;

            // Store the indices that identify the vertex
            aClosestVertex = iterator.GetIndex();
        }
    }

    return collision;
}

References CIterateWithHoles(), delta, and distance().

Referenced by ZONE::HitTestForCorner().

Contains()

bool SHAPE_POLY_SET::Contains	(	const VECTOR2I &	aP,
		int	aSubpolyIndex = -1,
		int	aAccuracy = 0,
		bool	aUseBBoxCaches = false
	)		const

Return true if a given subpolygon contains the point aP.

Parameters

aP	is the point to check
aSubpolyIndex	is the subpolygon to check, or -1 to check all
aUseBBoxCaches	gives faster performance when multiple calls are made with no editing in between, but the caller MUST cache the bbox caches before calling (via BuildBBoxCaches(), above)

Returns

true if the polygon contains the pointReturn true if the set is empty (no polygons at all)

Definition at line 1712 of file shape_poly_set.cpp.

{
    if( m_polys.empty() )
        return false;

    // If there is a polygon specified, check the condition against that polygon
    if( aSubpolyIndex >= 0 )
        return containsSingle( aP, aSubpolyIndex, aAccuracy, aUseBBoxCaches );

    // In any other case, check it against all polygons in the set
    for( int polygonIdx = 0; polygonIdx < OutlineCount(); polygonIdx++ )
    {
        if( containsSingle( aP, polygonIdx, aAccuracy, aUseBBoxCaches ) )
            return true;
    }

    return false;
}

References containsSingle(), m_polys, and OutlineCount().

Referenced by SHAPE_RECT::Collide(), ZONE_FILLER::computeRawFilledArea(), ZONE_FILLER::Fill(), PAD::GetBestAnchorPosition(), CADSTAR_PCB_ARCHIVE_LOADER::getKiCadPad(), GERBER_DRAW_ITEM::HitTest(), ZONE::HitTestFilledArea(), PCB_DIMENSION_BASE::segPolyIntersection(), BOARD::TestZoneIntersection(), PCB_DIM_ALIGNED::updateGeometry(), and PCB_DIM_ORTHOGONAL::updateGeometry().

containsSingle()

bool SHAPE_POLY_SET::containsSingle ( const VECTOR2I &  aP, int  aSubpolyIndex, int  aAccuracy, bool  aUseBBoxCaches = false  ) const

private

Check whether the point aP is inside the aSubpolyIndex-th polygon of the polyset.

If the points lies on an edge, the polygon is considered to contain it.

Parameters

aP	is the VECTOR2I point whose position with respect to the inside of the aSubpolyIndex-th polygon will be tested.
aSubpolyIndex	is an integer specifying which polygon in the set has to be checked.
aAccuracy	accuracy in internal units
aUseBBoxCaches	gives faster performance when multiple calls are made with no editing in between, but the caller MUST cache the bbox caches before calling (via BuildBBoxCaches(), above)

Returns

true if aP is inside aSubpolyIndex-th polygon; false in any other case.

Definition at line 1768 of file shape_poly_set.cpp.

{
    // Check that the point is inside the outline
    if( m_polys[aSubpolyIndex][0].PointInside( aP, aAccuracy ) )
    {
        // Check that the point is not in any of the holes
        for( int holeIdx = 0; holeIdx < HoleCount( aSubpolyIndex ); holeIdx++ )
        {
            const SHAPE_LINE_CHAIN& hole = CHole( aSubpolyIndex, holeIdx );

            // If the point is inside a hole it is outside of the polygon.  Do not use aAccuracy
            // here as it's meaning would be inverted.
            if( hole.PointInside( aP, 1, aUseBBoxCaches ) )
                return false;
        }

        return true;
    }

    return false;
}

References CHole(), HoleCount(), m_polys, and SHAPE_LINE_CHAIN_BASE::PointInside().

Referenced by Contains(), and SquaredDistanceToPolygon().

COutline()

const SHAPE_LINE_CHAIN& SHAPE_POLY_SET::COutline ( int  aIndex ) const

inline

Definition at line 713 of file shape_poly_set.h.

    {
        return m_polys[aIndex][0];
    }

References m_polys.

Referenced by CN_LIST::Add(), BOARD_ADAPTER::addSolidAreasShapes(), TRIANGLE_DISPLAY_LIST::AddToMiddleContourns(), CN_ZONE_LAYER::AnchorCount(), BuildBBoxCaches(), BuildConvexHull(), PAD::BuildEffectiveShapes(), CN_VISITOR::checkZoneZoneConnection(), CN_ZONE_LAYER::CN_ZONE_LAYER(), ConvertPolygonToBlocks(), CONVERT_TOOL::CreatePolys(), KIGFX::GERBVIEW_PAINTER::draw(), KIGFX::PCB_PAINTER::Draw(), KIGFX::PCB_PAINTER::draw(), KIGFX::GERBVIEW_PAINTER::drawApertureMacro(), KIGFX::CAIRO_GAL_BASE::DrawPolygon(), KIGFX::OPENGL_GAL::DrawPolygon(), KIGFX::GERBVIEW_PAINTER::drawPolygon(), KIGFX::PREVIEW::POLYGON_ITEM::drawPreviewShape(), EDA_SHAPE::DupPolyPointsList(), EXPORTER_PCB_VRML::ExportVrmlBoard(), EXPORTER_PCB_VRML::ExportVrmlPolygonSet(), PCB_IO::format(), CN_ZONE_LAYER::GetAnchor(), PAD::GetBestAnchorPosition(), FOOTPRINT::GetBoundingHull(), EDA_SHAPE::GetLength(), CADSTAR_PCB_ARCHIVE_LOADER::getZoneFromCadstarShape(), DS_DRAW_ITEM_POLYPOLYGONS::HitTest(), FABMASTER::loadGraphics(), EAGLE_PLUGIN::loadPolygon(), FABMASTER::loadPolygon(), EDA_SHAPE::MakeEffectiveShapes(), DSN::SPECCTRA_DB::makePADSTACK(), PlotLayerOutlines(), DXF_PLOTTER::PlotPoly(), PlotSolderMaskLayer(), DXF_PLOTTER::ThickSegment(), HYPERLYNX_EXPORTER::writeBoardInfo(), and HYPERLYNX_EXPORTER::writeNetObjects().

CPolygon()

const POLYGON& SHAPE_POLY_SET::CPolygon ( int  aIndex ) const

inline

Definition at line 723 of file shape_poly_set.h.

    {
        return m_polys[aIndex];
    }

References m_polys.

Referenced by SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::Advance(), SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::Advance(), GetRelativeIndices(), HasTouchingHoles(), SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::IsAdjacent(), SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::IsEndContour(), SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::operator bool(), and PlotStandardLayer().

CVertex() [1/3]

const VECTOR2I & SHAPE_POLY_SET::CVertex	(	int	aIndex,
		int	aOutline,
		int	aHole
	)		const

Return the aGlobalIndex-th vertex in the poly set.

Definition at line 335 of file shape_poly_set.cpp.

{
    if( aOutline < 0 )
        aOutline += m_polys.size();

    int idx;

    if( aHole < 0 )
        idx = 0;
    else
        idx = aHole + 1;

    assert( aOutline < (int) m_polys.size() );
    assert( idx < (int) m_polys[aOutline].size() );

    return m_polys[aOutline][idx].CPoint( aIndex );
}

References m_polys.

Referenced by PCB_POINT_EDITOR::addCorner(), EDA_SHAPE::Compare(), CVertex(), D_CODE::DrawFlashedPolygon(), GERBER_FILE_IMAGE::Execute_DCODE_Command(), GERBER_FILE_IMAGE::Execute_G_Command(), findVertex(), ZONE::GetCornerPosition(), EDA_SHAPE::getPosition(), ZONE::HatchBorder(), ZONE::HitTest(), ZONE::MoveEdge(), ZONE::SetCornerPosition(), PCB_POINT_EDITOR::updateItem(), and PCB_POINT_EDITOR::updatePoints().

CVertex() [2/3]

const VECTOR2I & SHAPE_POLY_SET::CVertex

(

int

aGlobalIndex

)

const

Return the index-th vertex in a given hole outline within a given outline.

Definition at line 354 of file shape_poly_set.cpp.

{
    SHAPE_POLY_SET::VERTEX_INDEX index;

    // Assure the passed index references a legal position; abort otherwise
    if( !GetRelativeIndices( aGlobalIndex, &index ) )
        throw( std::out_of_range( "aGlobalIndex-th vertex does not exist" ) );

    return m_polys[index.m_polygon][index.m_contour].CPoint( index.m_vertex );
}

References GetRelativeIndices(), SHAPE_POLY_SET::VERTEX_INDEX::m_contour, SHAPE_POLY_SET::VERTEX_INDEX::m_polygon, m_polys, and SHAPE_POLY_SET::VERTEX_INDEX::m_vertex.

CVertex() [3/3]

const VECTOR2I & SHAPE_POLY_SET::CVertex

(

SHAPE_POLY_SET::VERTEX_INDEX

index

)

const

Definition at line 366 of file shape_poly_set.cpp.

{
    return CVertex( index.m_vertex, index.m_polygon, index.m_contour - 1 );
}

References CVertex(), SHAPE_POLY_SET::VERTEX_INDEX::m_contour, SHAPE_POLY_SET::VERTEX_INDEX::m_polygon, and SHAPE_POLY_SET::VERTEX_INDEX::m_vertex.

Deflate()

void SHAPE_POLY_SET::Deflate ( int  aAmount, int  aCircleSegmentsCount, CORNER_STRATEGY  aCornerStrategy = ROUND_ALL_CORNERS  )

inline

Definition at line 995 of file shape_poly_set.h.

    {
        Inflate( -aAmount, aCircleSegmentsCount, aCornerStrategy );
    }

References Inflate().

Referenced by ZONE_FILLER::addHatchFillTypeOnZone(), calcIsInsideArea(), ZONE_FILLER::computeRawFilledArea(), KIGFX::PCB_PAINTER::draw(), ZONE_FILLER::fillSingleZone(), PCB_BASE_FRAME::FocusOnItem(), ALTIUM_PCB::ParseRegions6Data(), and PlotSolderMaskLayer().

DeletePolygon()

void SHAPE_POLY_SET::DeletePolygon

(

int

aIdx

)

Definition at line 1614 of file shape_poly_set.cpp.

{
    m_polys.erase( m_polys.begin() + aIdx );
}

References m_polys.

Referenced by ZONE_FILLER::addHatchFillTypeOnZone(), CacheTriangulation(), ZONE_FILLER::Fill(), and PlotStandardLayer().

Fillet()

SHAPE_POLY_SET SHAPE_POLY_SET::Fillet	(	int	aRadius,
		int	aErrorMax
	)

Return a filleted version of the polygon set.

Parameters

aRadius	is the fillet radius.
aErrorMax	is the maximum allowable deviation of the polygon from the circle

Returns

A set containing the filleted version of this set.

Definition at line 2008 of file shape_poly_set.cpp.

{
    SHAPE_POLY_SET filleted;

    for( size_t idx = 0; idx < m_polys.size(); idx++ )
        filleted.m_polys.push_back( FilletPolygon( aRadius, aErrorMax, idx ) );

    return filleted;
}

References FilletPolygon(), and m_polys.

Referenced by ZONE_FILLER::addHatchFillTypeOnZone().

FilletPolygon()

SHAPE_POLY_SET::POLYGON SHAPE_POLY_SET::FilletPolygon	(	unsigned int	aRadius,
		int	aErrorMax,
		int	aIndex
	)

Return a filleted version of the aIndex-th polygon.

Parameters

aRadius	is the fillet radius.
aErrorMax	is the maximum allowable deviation of the polygon from the circle
aIndex	is the index of the polygon to be filleted

Returns

A polygon containing the filleted version of the aIndex-th polygon.

Definition at line 1854 of file shape_poly_set.cpp.

{
    return chamferFilletPolygon( FILLETED, aRadius, aIndex, aErrorMax );
}

References chamferFilletPolygon(), and FILLETED.

Referenced by Fillet(), and GEOM_TEST::FilletPolySet().

Format()

const std::string SHAPE_POLY_SET::Format ( ) const

overridevirtual

Reimplemented from SHAPE.

Definition at line 1277 of file shape_poly_set.cpp.

{
    std::stringstream ss;

    ss << "SHAPE_LINE_CHAIN poly; \n";

    for( unsigned i = 0; i < m_polys.size(); i++ )
    {
        for( unsigned j = 0; j < m_polys[i].size(); j++ )
        {

            ss << "{ auto tmp = " << m_polys[i][j].Format() << ";\n";

            SHAPE_POLY_SET poly;

            if( j == 0 )
            {
                ss << " poly.AddOutline(tmp); } \n";
            }
            else
            {
                ss << " poly.AddHole(tmp); } \n";
            }

        }
    }

    return ss.str();
}

References m_polys.

Fracture()

void SHAPE_POLY_SET::Fracture

(

POLYGON_MODE

aFastMode

)

Convert a single outline slitted ("fractured") polygon into a set ouf outlines with holes.

Definition at line 1041 of file shape_poly_set.cpp.

{
    Simplify( aFastMode );    // remove overlapping holes/degeneracy

    for( POLYGON& paths : m_polys )
        fractureSingle( paths );
}

References fractureSingle(), m_polys, and Simplify().

Referenced by addHoleToPolygon(), PAD::addPadPrimitivesToPolygon(), PAD::AddPrimitivePoly(), CacheTriangulation(), ZONE_FILLER::computeRawFilledArea(), BITMAPCONV_INFO::createOutputData(), CADSTAR_PCB_ARCHIVE_LOADER::drawCadstarShape(), AR_AUTOPLACER::drawPlacementRoutingMatrix(), EXPORTER_PCB_VRML::ExportStandardLayers(), EXPORTER_PCB_VRML::ExportVrmlSolderMask(), AR_AUTOPLACER::fillMatrix(), ZONE_FILLER::fillSingleZone(), APERTURE_MACRO::GetApertureMacroShape(), InflateWithLinkedHoles(), CADSTAR_PCB_ARCHIVE_LOADER::loadCoppers(), FABMASTER::loadFootprints(), EAGLE_PLUGIN::loadPolygon(), FABMASTER::loadShapePolySet(), ALTIUM_PCB::ParseRegions6Data(), BRDITEMS_PLOTTER::PlotFootprintGraphicItem(), BRDITEMS_PLOTTER::PlotPcbShape(), DXF_PLOTTER::PlotPoly(), PlotSolderMaskLayer(), RENDER_3D_RAYTRACE::Reload(), TransformRingToPolygon(), PAD::TransformShapeWithClearanceToPolygon(), ZONE::TransformSmoothedOutlineToPolygon(), and GBR_TO_PCB_EXPORTER::writePcbPolygon().

fractureSingle()

void SHAPE_POLY_SET::fractureSingle ( POLYGON &  paths )

private

Definition at line 925 of file shape_poly_set.cpp.

{
    FractureEdgeSet edges;
    FractureEdgeSet border_edges;
    FractureEdge*   root = nullptr;

    bool first = true;

    if( paths.size() == 1 )
        return;

    int num_unconnected = 0;

    for( const SHAPE_LINE_CHAIN& path : paths )
    {
        const std::vector<VECTOR2I>& points = path.CPoints();
        int pointCount = points.size();

        FractureEdge* prev = nullptr, * first_edge = nullptr;

        int x_min = std::numeric_limits<int>::max();

        for( int i = 0; i < pointCount; i++ )
        {
            if( points[i].x < x_min )
                x_min = points[i].x;

            // Do not use path.CPoint() here; open-coding it using the local variables "points"
            // and "pointCount" gives a non-trivial performance boost to zone fill times.
            FractureEdge* fe = new FractureEdge( first, points[ i ],
                                                 points[ i+1 == pointCount ? 0 : i+1 ] );

            if( !root )
                root = fe;

            if( !first_edge )
                first_edge = fe;

            if( prev )
                prev->m_next = fe;

            if( i == pointCount - 1 )
                fe->m_next = first_edge;

            prev = fe;
            edges.push_back( fe );

            if( !first )
            {
                if( fe->m_p1.x == x_min )
                    border_edges.push_back( fe );
            }

            if( !fe->m_connected )
                num_unconnected++;
        }

        first = false;    // first path is always the outline
    }

    // keep connecting holes to the main outline, until there's no holes left...
    while( num_unconnected > 0 )
    {
        int x_min = std::numeric_limits<int>::max();
        auto it = border_edges.begin();

        FractureEdge* smallestX = nullptr;

        // find the left-most hole edge and merge with the outline
        for( ; it != border_edges.end(); ++it )
        {
            FractureEdge* border_edge = *it;
            int xt = border_edge->m_p1.x;

            if( ( xt <= x_min ) && !border_edge->m_connected )
            {
                x_min = xt;
                smallestX = border_edge;
            }
        }

        int num_processed = processEdge( edges, smallestX );

        // If we can't handle the edge, the zone is broken (maybe)
        if( !num_processed )
        {
            wxLogWarning( "Broken polygon, dropping path" );

            for( FractureEdge* edge : edges )
                delete edge;

            return;
        }

        num_unconnected -= num_processed;
    }

    paths.clear();
    SHAPE_LINE_CHAIN newPath;

    newPath.SetClosed( true );

    FractureEdge* e;

    for( e = root; e->m_next != root; e = e->m_next )
        newPath.Append( e->m_p1 );

    newPath.Append( e->m_p1 );

    for( FractureEdge* edge : edges )
        delete edge;

    paths.push_back( std::move( newPath ) );
}

References SHAPE_LINE_CHAIN::Append(), FractureEdge::m_connected, FractureEdge::m_next, FractureEdge::m_p1, path, processEdge(), SHAPE_LINE_CHAIN::SetClosed(), and VECTOR2< T >::x.

Referenced by Fracture().

GetArcs()

void SHAPE_POLY_SET::GetArcs

(

std::vector< SHAPE_ARC > &

aArcBuffer

)

const

Removes all arc references from all the outlines and holes in the polyset.

Definition at line 521 of file shape_poly_set.cpp.

{
    for( const POLYGON& poly : m_polys )
    {
        for( size_t i = 0; i < poly.size(); i++ )
        {
            for( SHAPE_ARC arc : poly[i].m_arcs )
                aArcBuffer.push_back( arc );
        }
    }
}

References m_polys.

Referenced by BOOST_AUTO_TEST_CASE().

GetGlobalIndex()

bool SHAPE_POLY_SET::GetGlobalIndex	(	SHAPE_POLY_SET::VERTEX_INDEX	aRelativeIndices,
		int &	aGlobalIdx
	)		const

Compute the global index of a vertex from the relative indices of polygon, contour and vertex.

Parameters

aRelativeIndices	is the set of relative indices.
aGlobalIdx	[out] is the computed global index.

Returns

true if the relative indices are correct; false otherwise. The computed global index is returned in the aGlobalIdx reference.

Definition at line 161 of file shape_poly_set.cpp.

{
    int          selectedVertex = aRelativeIndices.m_vertex;
    unsigned int selectedContour = aRelativeIndices.m_contour;
    unsigned int selectedPolygon = aRelativeIndices.m_polygon;

    // Check whether the vertex indices make sense in this poly set
    if( selectedPolygon < m_polys.size() && selectedContour < m_polys[selectedPolygon].size()
        && selectedVertex < m_polys[selectedPolygon][selectedContour].PointCount() )
    {
        POLYGON currentPolygon;

        aGlobalIdx = 0;

        for( unsigned int polygonIdx = 0; polygonIdx < selectedPolygon; polygonIdx++ )
        {
            currentPolygon = Polygon( polygonIdx );

            for( unsigned int contourIdx = 0; contourIdx < currentPolygon.size(); contourIdx++ )
                aGlobalIdx += currentPolygon[contourIdx].PointCount();
        }

        currentPolygon = Polygon( selectedPolygon );

        for( unsigned int contourIdx = 0; contourIdx < selectedContour; contourIdx++ )
            aGlobalIdx += currentPolygon[contourIdx].PointCount();

        aGlobalIdx += selectedVertex;

        return true;
    }
    else
    {
        return false;
    }
}

References SHAPE_POLY_SET::VERTEX_INDEX::m_contour, SHAPE_POLY_SET::VERTEX_INDEX::m_polygon, m_polys, SHAPE_POLY_SET::VERTEX_INDEX::m_vertex, and Polygon().

Referenced by GetNeighbourIndexes(), and ZONE::GetSelectedCorner().

GetHash()

MD5_HASH SHAPE_POLY_SET::GetHash

(

)

const

Definition at line 2204 of file shape_poly_set.cpp.

{
    if( !m_hash.IsValid() )
        return checksum();

    return m_hash;
}

References checksum(), MD5_HASH::IsValid(), and m_hash.

Referenced by ZONE::BuildHashValue(), ZONE::GetHashValue(), DSN::SPECCTRA_DB::makePADSTACK(), operator=(), and SHAPE_POLY_SET().

GetIndexableSubshapeCount()

size_t SHAPE_POLY_SET::GetIndexableSubshapeCount ( ) const

overridevirtual

Reimplemented from SHAPE_BASE.

Definition at line 2434 of file shape_poly_set.cpp.

{
    size_t n = 0;

    for( const std::unique_ptr<TRIANGULATED_POLYGON>& t : m_triangulatedPolys )
        n += t->GetTriangleCount();

    return n;
}

References m_triangulatedPolys.

Referenced by GetIndexableSubshapes().

GetIndexableSubshapes()

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

overridevirtual

Reimplemented from SHAPE_BASE.

Definition at line 2445 of file shape_poly_set.cpp.

{
    aSubshapes.reserve( GetIndexableSubshapeCount() );

    for( const std::unique_ptr<TRIANGULATED_POLYGON>& tpoly : m_triangulatedPolys )
    {
        for( TRIANGULATED_POLYGON::TRI& tri : tpoly->Triangles() )
            aSubshapes.push_back( &tri );
    }
}

References GetIndexableSubshapeCount(), and m_triangulatedPolys.

GetNeighbourIndexes()

bool SHAPE_POLY_SET::GetNeighbourIndexes	(	int	aGlobalIndex,
		int *	aPrevious,
		int *	aNext
	)

Return the global indexes of the previous and the next corner of the aGlobalIndex-th corner of a contour in the polygon set.

They are often aGlobalIndex-1 and aGlobalIndex+1, but not for the first and last corner of the contour.

Parameters

aGlobalIndex	is index of the corner, globally indexed between all edges in all contours
aPrevious	is the globalIndex of the previous corner of the same contour.
aNext	is the globalIndex of the next corner of the same contour.

Returns

true if OK, false if aGlobalIndex is out of range

Definition at line 372 of file shape_poly_set.cpp.

{
    SHAPE_POLY_SET::VERTEX_INDEX index;

    // If the edge does not exist, throw an exception, it is an illegal access memory error
    if( !GetRelativeIndices( aGlobalIndex, &index ) )
        return false;

    // Calculate the previous and next index of aGlobalIndex, corresponding to
    // the same contour;
    VERTEX_INDEX inext = index;
    int lastpoint = m_polys[index.m_polygon][index.m_contour].SegmentCount();

    if( index.m_vertex == 0 )
    {
        index.m_vertex  = lastpoint;
        inext.m_vertex  = 1;
    }
    else if( index.m_vertex == lastpoint )
    {
        index.m_vertex--;
        inext.m_vertex = 0;
    }
    else
    {
        inext.m_vertex++;
        index.m_vertex--;
    }

    if( aPrevious )
    {
        int previous;
        GetGlobalIndex( index, previous );
        *aPrevious = previous;
    }

    if( aNext )
    {
        int next;
        GetGlobalIndex( inext, next );
        *aNext = next;
    }

    return true;
}

References GetGlobalIndex(), GetRelativeIndices(), SHAPE_POLY_SET::VERTEX_INDEX::m_contour, SHAPE_POLY_SET::VERTEX_INDEX::m_polygon, m_polys, SHAPE_POLY_SET::VERTEX_INDEX::m_vertex, and next().

Referenced by ZONE::MoveEdge().

GetRelativeIndices()

bool SHAPE_POLY_SET::GetRelativeIndices	(	int	aGlobalIdx,
		SHAPE_POLY_SET::VERTEX_INDEX *	aRelativeIndices
	)		const

Convert a global vertex index —i.e., a number that globally identifies a vertex in a concatenated list of all vertices in all contours— and get the index of the vertex relative to the contour relative to the polygon in which it is.

Parameters

aGlobalIdx	is the global index of the corner whose structured index wants to be found
aRelativeIndices	is a pointer to the set of relative indices to store.

Returns

true if the global index is correct and the information in aRelativeIndices is valid; false otherwise.

Definition at line 121 of file shape_poly_set.cpp.

{
    int polygonIdx = 0;
    unsigned int contourIdx = 0;
    int vertexIdx = 0;

    int currentGlobalIdx = 0;

    for( polygonIdx = 0; polygonIdx < OutlineCount(); polygonIdx++ )
    {
        const POLYGON& currentPolygon = CPolygon( polygonIdx );

        for( contourIdx = 0; contourIdx < currentPolygon.size(); contourIdx++ )
        {
            const SHAPE_LINE_CHAIN& currentContour = currentPolygon[contourIdx];
            int totalPoints = currentContour.PointCount();

            for( vertexIdx = 0; vertexIdx < totalPoints; vertexIdx++ )
            {
                // Check if the current vertex is the globally indexed as aGlobalIdx
                if( currentGlobalIdx == aGlobalIdx )
                {
                    aRelativeIndices->m_polygon = polygonIdx;
                    aRelativeIndices->m_contour = contourIdx;
                    aRelativeIndices->m_vertex  = vertexIdx;

                    return true;
                }

                // Advance
                currentGlobalIdx++;
            }
        }
    }

    return false;
}

References CPolygon(), SHAPE_POLY_SET::VERTEX_INDEX::m_contour, SHAPE_POLY_SET::VERTEX_INDEX::m_polygon, SHAPE_POLY_SET::VERTEX_INDEX::m_vertex, OutlineCount(), and SHAPE_LINE_CHAIN::PointCount().

Referenced by CVertex(), ZONE::GetCornerPosition(), GetNeighbourIndexes(), InsertVertex(), IsVertexInHole(), IterateFromVertexWithHoles(), RemoveVertex(), ZONE::SetCornerPosition(), ZONE::SetSelectedCorner(), and SetVertex().

HasHoles()

bool SHAPE_POLY_SET::HasHoles

(

)

const

Return true if the polygon set has any holes that share a vertex.

Definition at line 1212 of file shape_poly_set.cpp.

{
    // Iterate through all the polygons on the set
    for( const POLYGON& paths : m_polys )
    {
        // If any of them has more than one contour, it is a hole.
        if( paths.size() > 1 )
            return true;
    }

    // Return false if and only if every polygon has just one outline, without holes.
    return false;
}

References m_polys.

Referenced by CacheTriangulation().

HasIndexableSubshapes()

bool SHAPE_POLY_SET::HasIndexableSubshapes ( ) const

overridevirtual

Reimplemented from SHAPE_BASE.

Definition at line 2428 of file shape_poly_set.cpp.

{
    return IsTriangulationUpToDate();
}

References IsTriangulationUpToDate().

HasTouchingHoles()

bool SHAPE_POLY_SET::HasTouchingHoles

(

)

const

Simplify the polyset (merges overlapping polys, eliminates degeneracy/self-intersections) For aFastMode meaning, see function booleanOp.

Definition at line 2395 of file shape_poly_set.cpp.

{
    for( int i = 0; i < OutlineCount(); i++ )
    {
        if( hasTouchingHoles( CPolygon( i ) ) )
            return true;
    }

    return false;
}

References CPolygon(), hasTouchingHoles(), and OutlineCount().

hasTouchingHoles()

bool SHAPE_POLY_SET::hasTouchingHoles ( const POLYGON &  aPoly ) const

private

Definition at line 2407 of file shape_poly_set.cpp.

{
    std::set<long long> ptHashes;

    for( const SHAPE_LINE_CHAIN& lc : aPoly )
    {
        for( const VECTOR2I& pt : lc.CPoints() )
        {
            const long long ptHash = (long long) pt.x << 32 | pt.y;

            if( ptHashes.count( ptHash ) > 0 )
                return true;

            ptHashes.insert( ptHash );
        }
    }

    return false;
}

Referenced by HasTouchingHoles().

Hole()

SHAPE_LINE_CHAIN& SHAPE_POLY_SET::Hole ( int  aOutline, int  aHole  )

inline

Return the aIndex-th subpolygon in the set.

Definition at line 692 of file shape_poly_set.h.

References m_polys.

Referenced by Area(), BuildFootprintPolygonOutlines(), ZONE::CalculateFilledArea(), ConvertPolygonToBlocks(), EXPORTER_PCB_VRML::ExportVrmlBoard(), DSN::SPECCTRA_DB::fillBOUNDARY(), DIALOG_BOARD_STATISTICS::getDataFromPCB(), CADSTAR_PCB_ARCHIVE_LOADER::getPolySetFromCadstarShape(), ZONE::HitTestCutout(), FABMASTER::loadFootprints(), FABMASTER::loadShapePolySet(), FABMASTER::loadZone(), polygonArea(), ZONE::RemoveCutout(), and TransformRingToPolygon().

HoleCount()

int SHAPE_POLY_SET::HoleCount ( int  aOutline ) const

inline

Return the reference to aIndex-th outline in the set.

Definition at line 653 of file shape_poly_set.h.

References m_polys.

Referenced by BOARD_ADAPTER::addSolidAreasShapes(), TRIANGLE_DISPLAY_LIST::AddToMiddleContourns(), ZONE::AppendCorner(), Area(), BOOST_AUTO_TEST_CASE(), BuildBBoxCaches(), BuildFootprintPolygonOutlines(), ZONE::CalculateFilledArea(), containsSingle(), ConvertPolygonToBlocks(), KIGFX::PCB_PAINTER::draw(), EXPORTER_PCB_VRML::ExportVrmlBoard(), DSN::SPECCTRA_DB::fillBOUNDARY(), DIALOG_BOARD_STATISTICS::getDataFromPCB(), CADSTAR_PCB_ARCHIVE_LOADER::getPolySetFromCadstarShape(), CADSTAR_PCB_ARCHIVE_LOADER::getZoneFromCadstarShape(), ZONE::HitTestCutout(), GEOM_TEST::IsPolySetValid(), PlotLayerOutlines(), polygonArea(), ZONE::RemoveCutout(), and HYPERLYNX_EXPORTER::writeNetObjects().

importTree()

void SHAPE_POLY_SET::importTree ( ClipperLib::PolyTree *  tree, const std::vector< CLIPPER_Z_VALUE > &  aZValueBuffer, const std::vector< SHAPE_ARC > &  aArcBuffe  )

private

Definition at line 795 of file shape_poly_set.cpp.

{
    m_polys.clear();

    for( ClipperLib::PolyNode* n = tree->GetFirst(); n; n = n->GetNext() )
    {
        if( !n->IsHole() )
        {
            POLYGON paths;
            paths.reserve( n->Childs.size() + 1 );

            paths.emplace_back( n->Contour, aZValueBuffer, aArcBuffer );

            for( unsigned int i = 0; i < n->Childs.size(); i++ )
                paths.emplace_back( n->Childs[i]->Contour, aZValueBuffer, aArcBuffer );

            m_polys.push_back( paths );
        }
    }
}

References m_polys.

Referenced by booleanOp(), and Inflate().

Inflate()

void SHAPE_POLY_SET::Inflate	(	int	aAmount,
		int	aCircleSegCount,
		CORNER_STRATEGY	aCornerStrategy = ROUND_ALL_CORNERS
	)

Perform outline inflation/deflation.

Polygons can have holes, but not linked holes with main outlines, if aFactor < 0. For those use InflateWithLinkedHoles() to avoid odd corners where the link segments meet the outline.

Parameters

aAmount	is the number of units to offset edges.
aCircleSegCount	is the number of segments per 360 degrees to use in curve approx
aCornerStrategy	ALLOW_ACUTE_CORNERS to preserve all angles, CHAMFER_ACUTE_CORNERS to chop angles less than 90°, ROUND_ACUTE_CORNERS to round off angles less than 90°, ROUND_ALL_CORNERS to round regardless of angles

Definition at line 704 of file shape_poly_set.cpp.

{
    using namespace ClipperLib;
    // A static table to avoid repetitive calculations of the coefficient
    // 1.0 - cos( M_PI / aCircleSegCount )
    // aCircleSegCount is most of time <= 64 and usually 8, 12, 16, 32
    #define SEG_CNT_MAX 64
    static double arc_tolerance_factor[SEG_CNT_MAX + 1];

    ClipperOffset c;

    // N.B. see the Clipper documentation for jtSquare/jtMiter/jtRound.  They are poorly named
    // and are not what you'd think they are.
    // http://www.angusj.com/delphi/clipper/documentation/Docs/Units/ClipperLib/Types/JoinType.htm
    JoinType joinType = jtRound;    // The way corners are offsetted
    double   miterLimit = 2.0;      // Smaller value when using jtMiter for joinType
    JoinType miterFallback = jtSquare;

    switch( aCornerStrategy )
    {
    case ALLOW_ACUTE_CORNERS:
        joinType = jtMiter;
        miterLimit = 10;        // Allows large spikes
        miterFallback = jtSquare;
        break;

    case CHAMFER_ACUTE_CORNERS: // Acute angles are chamfered
        joinType = jtMiter;
        miterFallback = jtRound;
        break;

    case ROUND_ACUTE_CORNERS:   // Acute angles are rounded
        joinType = jtMiter;
        miterFallback = jtSquare;
        break;

    case CHAMFER_ALL_CORNERS:   // All angles are chamfered.
        joinType = jtSquare;
        miterFallback = jtSquare;
        break;

    case ROUND_ALL_CORNERS:     // All angles are rounded.
        joinType = jtRound;
        miterFallback = jtSquare;
        break;
    }

    std::vector<CLIPPER_Z_VALUE> zValues;
    std::vector<SHAPE_ARC>       arcBuffer;

    for( const POLYGON& poly : m_polys )
    {
        for( size_t i = 0; i < poly.size(); i++ )
        {
            c.AddPath( poly[i].convertToClipper( i == 0, zValues, arcBuffer ),
                       joinType, etClosedPolygon );
        }
    }

    PolyTree solution;

    // Calculate the arc tolerance (arc error) from the seg count by circle. The seg count is
    // nn = M_PI / acos(1.0 - c.ArcTolerance / abs(aAmount))
    // http://www.angusj.com/delphi/clipper/documentation/Docs/Units/ClipperLib/Classes/ClipperOffset/Properties/ArcTolerance.htm

    if( aCircleSegCount < 6 ) // avoid incorrect aCircleSegCount values
        aCircleSegCount = 6;

    double coeff;

    if( aCircleSegCount > SEG_CNT_MAX || arc_tolerance_factor[aCircleSegCount] == 0 )
    {
        coeff = 1.0 - cos( M_PI / aCircleSegCount );

        if( aCircleSegCount <= SEG_CNT_MAX )
            arc_tolerance_factor[aCircleSegCount] = coeff;
    }
    else
    {
        coeff = arc_tolerance_factor[aCircleSegCount];
    }

    c.ArcTolerance = std::abs( aAmount ) * coeff;
    c.MiterLimit = miterLimit;
    c.MiterFallback = miterFallback;
    c.Execute( solution, aAmount );

    importTree( &solution, zValues, arcBuffer );
}

References ALLOW_ACUTE_CORNERS, CHAMFER_ACUTE_CORNERS, CHAMFER_ALL_CORNERS, importTree(), m_polys, ROUND_ACUTE_CORNERS, ROUND_ALL_CORNERS, and SEG_CNT_MAX.

Referenced by FOOTPRINT::BuildPolyCourtyards(), ZONE::BuildSmoothedPoly(), CADSTAR_PCB_ARCHIVE_LOADER::calculateZonePriorities(), ZONE_FILLER::computeRawFilledArea(), BOARD_ADAPTER::createPadWithClearance(), Deflate(), ZONE_FILLER::fillSingleZone(), GERBER_PLOTTER::FlashPadCustom(), GERBER_PLOTTER::FlashPadRoundRect(), CADSTAR_PCB_ARCHIVE_LOADER::getPolySetFromCadstarShape(), InflateWithLinkedHoles(), CADSTAR_PCB_ARCHIVE_LOADER::loadCoppers(), EAGLE_PLUGIN::loadPolygon(), EAGLE_PLUGIN::packagePolygon(), PlotSolderMaskLayer(), PAD::TransformShapeWithClearanceToPolygon(), ZONE::TransformShapeWithClearanceToPolygon(), and ZONE::TransformSmoothedOutlineToPolygon().

InflateWithLinkedHoles()

void SHAPE_POLY_SET::InflateWithLinkedHoles	(	int	aFactor,
		int	aCircleSegmentsCount,
		POLYGON_MODE	aFastMode
	)

Perform outline inflation/deflation, using round corners.

Polygons can have holes and/or linked holes with main outlines. The resulting polygons are also polygons with linked holes to main outlines. For aFastMode meaning, see function booleanOp .Convert a set of polygons with holes to a single outline with "slits"/"fractures" connecting the outer ring to the inner holes For aFastMode meaning, see function booleanOp

Definition at line 695 of file shape_poly_set.cpp.

{
    Simplify( aFastMode );
    Inflate( aFactor, aCircleSegmentsCount );
    Fracture( aFastMode );
}

References Fracture(), Inflate(), and Simplify().

Referenced by PlotStandardLayer(), and ZONE::TransformSolidAreasShapesToPolygon().

InsertVertex()

void SHAPE_POLY_SET::InsertVertex	(	int	aGlobalIndex,
		const VECTOR2I &	aNewVertex
	)

Adds a vertex in the globally indexed position aGlobalIndex.

Parameters

aGlobalIndex	is the global index of the position in which the new vertex will be inserted.
aNewVertex	is the new inserted vertex.Return the index-th vertex in a given hole outline within a given outline

Definition at line 275 of file shape_poly_set.cpp.

{
    VERTEX_INDEX index;

    if( aGlobalIndex < 0 )
        aGlobalIndex = 0;

    if( aGlobalIndex >= TotalVertices() )
    {
        Append( aNewVertex );
    }
    else
    {
        // Assure the position to be inserted exists; throw an exception otherwise
        if( GetRelativeIndices( aGlobalIndex, &index ) )
            m_polys[index.m_polygon][index.m_contour].Insert( index.m_vertex, aNewVertex );
        else
            throw( std::out_of_range( "aGlobalIndex-th vertex does not exist" ) );
    }
}

References Append(), GetRelativeIndices(), SHAPE_POLY_SET::VERTEX_INDEX::m_contour, SHAPE_POLY_SET::VERTEX_INDEX::m_polygon, m_polys, SHAPE_POLY_SET::VERTEX_INDEX::m_vertex, and TotalVertices().

Referenced by PCB_POINT_EDITOR::addCorner().

IsEmpty()

bool SHAPE_POLY_SET::IsEmpty ( ) const

inline

Definition at line 1189 of file shape_poly_set.h.

    {
        return m_polys.empty();
    }

References m_polys.

Referenced by LIB_SHAPE::AddPoint(), BOARD_ADAPTER::addShapeWithClearance(), Collide(), BOARD_ADAPTER::createPadWithClearance(), CONVERT_TOOL::CreatePolys(), TRACKS_CLEANER::deleteTracksInPads(), DIALOG_PAD_PRIMITIVE_POLY_PROPS::DIALOG_PAD_PRIMITIVE_POLY_PROPS(), DRC_ENGINE::EvalRules(), CN_CONNECTIVITY_ALGO::FindIsolatedCopperIslands(), PCB_BASE_FRAME::FocusOnItem(), EDA_SHAPE::getBoundingBox(), ZONE::HatchBorder(), ALTIUM_PCB::HelperShapeSetLocalCoord(), BOARD_INSPECTION_TOOL::InspectClearance(), PCB_PARSER::parseZONE(), BRDITEMS_PLOTTER::PlotFilledAreas(), PlotStandardLayer(), and PAD_TOOL::recombinePad().

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.

IsPolygonSelfIntersecting()

bool SHAPE_POLY_SET::IsPolygonSelfIntersecting

(

int

aPolygonIndex

)

const

Check whether the aPolygonIndex-th polygon in the set is self intersecting.

Parameters

aPolygonIndex

is the index of the polygon that wants to be checked.

Returns

true if the aPolygonIndex-th polygon is self intersecting, false otherwise.

Definition at line 419 of file shape_poly_set.cpp.

{
    CONST_SEGMENT_ITERATOR iterator = CIterateSegmentsWithHoles( aPolygonIndex );
    CONST_SEGMENT_ITERATOR innerIterator;

    for( iterator = CIterateSegmentsWithHoles( aPolygonIndex ); iterator; iterator++ )
    {
        SEG firstSegment = *iterator;

        // Iterate through all remaining segments.
        innerIterator = iterator;

        // Start in the next segment, we don't want to check collision between a segment and itself
        for( innerIterator++; innerIterator; innerIterator++ )
        {
            SEG secondSegment = *innerIterator;

            // Check whether the two segments built collide, only when they are not adjacent.
            if( !iterator.IsAdjacent( innerIterator ) && firstSegment.Collide( secondSegment, 0 ) )
                return true;
        }
    }

    return false;
}

References CIterateSegmentsWithHoles(), SEG::Collide(), and SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::IsAdjacent().

Referenced by IsSelfIntersecting().

IsSelfIntersecting()

bool SHAPE_POLY_SET::IsSelfIntersecting

(

)

const

Check whether any of the polygons in the set is self intersecting.

Returns

true if any of the polygons is self intersecting, false otherwise.Return the number of triangulated polygons

Definition at line 446 of file shape_poly_set.cpp.

{
    for( unsigned int polygon = 0; polygon < m_polys.size(); polygon++ )
    {
        if( IsPolygonSelfIntersecting( polygon ) )
            return true;
    }

    return false;
}

References IsPolygonSelfIntersecting(), and m_polys.

Referenced by BOARD::NormalizeAreaPolygon(), and PCB_POINT_EDITOR::validatePolygon().

IsSolid()

bool SHAPE_POLY_SET::IsSolid ( ) const

inlineoverridevirtual

Implements SHAPE.

Definition at line 1067 of file shape_poly_set.h.

    {
        return true;
    }

IsTriangulationUpToDate()

bool SHAPE_POLY_SET::IsTriangulationUpToDate

(

)

const

Definition at line 2213 of file shape_poly_set.cpp.

{
    if( !m_triangulationValid )
        return false;

    if( !m_hash.IsValid() )
        return false;

    MD5_HASH hash = checksum();

    return hash == m_hash;
}

References checksum(), MD5_HASH::IsValid(), m_hash, and m_triangulationValid.

Referenced by KIGFX::GERBVIEW_PAINTER::draw(), KIGFX::PCB_PAINTER::draw(), KIGFX::OPENGL_GAL::DrawPolygon(), HasIndexableSubshapes(), operator=(), SHAPE_POLY_SET(), and PNS_KICAD_IFACE_BASE::syncZone().

IsVertexInHole()

bool SHAPE_POLY_SET::IsVertexInHole

(

int

aGlobalIdx

)

Check whether the aGlobalIndex-th vertex belongs to a hole.

Parameters

aGlobalIdx

is the index of the vertex.

Returns

true if the globally indexed aGlobalIdx-th vertex belongs to a hole.

Definition at line 1984 of file shape_poly_set.cpp.

{
    VERTEX_INDEX index;

    // Get the polygon and contour where the vertex is. If the vertex does not exist, return false
    if( !GetRelativeIndices( aGlobalIdx, &index ) )
        return false;

    // The contour is a hole if its index is greater than zero
    return index.m_contour > 0;
}

References GetRelativeIndices(), and SHAPE_POLY_SET::VERTEX_INDEX::m_contour.

Iterate() [1/3]

ITERATOR SHAPE_POLY_SET::Iterate ( int  aFirst, int  aLast, bool  aIterateHoles = false  )

inline

Return an object to iterate through the points of the polygons between aFirst and aLast.

Parameters

aFirst	is the first polygon whose points will be iterated.
aLast	is the last polygon whose points will be iterated.
aIterateHoles	is a flag to indicate whether the points of the holes should be iterated.

Returns

ITERATOR - the iterator object.

Definition at line 738 of file shape_poly_set.h.

    {
        ITERATOR iter;

        iter.m_poly = this;
        iter.m_currentPolygon = aFirst;
        iter.m_lastPolygon = aLast < 0 ? OutlineCount() - 1 : aLast;
        iter.m_currentContour = 0;
        iter.m_currentVertex = 0;
        iter.m_iterateHoles = aIterateHoles;

        return iter;
    }

References SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::m_currentContour, SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::m_currentPolygon, SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::m_currentVertex, SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::m_iterateHoles, SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::m_lastPolygon, SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::m_poly, and OutlineCount().

Referenced by PCB_POINT_EDITOR::addCorner(), and ZONE::Iterate().

Iterate() [2/3]

ITERATOR SHAPE_POLY_SET::Iterate ( int  aOutline )

inline

Parameters

aOutline

is the index of the polygon to be iterated.

Returns

an iterator object to visit all points in the main outline of the aOutline-th polygon, without visiting the points in the holes.

Definition at line 757 of file shape_poly_set.h.

    {
        return Iterate( aOutline, aOutline );
    }

References Iterate().

Iterate() [3/3]

ITERATOR SHAPE_POLY_SET::Iterate ( )

inline

Returns

an iterator object to visit all points in all outlines of the set, without visiting the points in the holes.

Definition at line 776 of file shape_poly_set.h.

    {
        return Iterate( 0, OutlineCount() - 1 );
    }

References OutlineCount().

Referenced by Iterate(), and IterateWithHoles().

IterateFromVertexWithHoles()

ITERATOR SHAPE_POLY_SET::IterateFromVertexWithHoles ( int  aGlobalIdx )

inline

Return an iterator object, for iterating between aFirst and aLast outline, with or without holes (default: without)

Definition at line 825 of file shape_poly_set.h.

References GetRelativeIndices(), IterateWithHoles(), SHAPE_POLY_SET::VERTEX_INDEX::m_contour, SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::m_currentContour, SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::m_currentPolygon, SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::m_currentVertex, SHAPE_POLY_SET::VERTEX_INDEX::m_polygon, and SHAPE_POLY_SET::VERTEX_INDEX::m_vertex.

IterateSegments() [1/3]

SEGMENT_ITERATOR SHAPE_POLY_SET::IterateSegments ( int  aFirst, int  aLast, bool  aIterateHoles = false  )

inline

Return an iterator object, for iterating between aFirst and aLast outline, with or without holes (default: without)

Definition at line 846 of file shape_poly_set.h.

References SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_currentContour, SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_currentPolygon, SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_currentSegment, SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_iterateHoles, SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_lastPolygon, SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::m_poly, and OutlineCount().

Referenced by TestConcaveSquareFillet(), TestSquareFillet(), and PCB_DIM_LEADER::updateGeometry().

IterateSegments() [2/3]

SEGMENT_ITERATOR SHAPE_POLY_SET::IterateSegments ( int  aPolygonIdx )

inline

Return an iterator object, for iterating aPolygonIdx-th polygon edges.

Definition at line 878 of file shape_poly_set.h.

References IterateSegments().

IterateSegments() [3/3]

SEGMENT_ITERATOR SHAPE_POLY_SET::IterateSegments ( )

inline

Returns an iterator object, for all outlines in the set (no holes)

Definition at line 890 of file shape_poly_set.h.

References OutlineCount().

Referenced by IterateSegments(), and IterateSegmentsWithHoles().

IterateSegmentsWithHoles() [1/2]

SEGMENT_ITERATOR SHAPE_POLY_SET::IterateSegmentsWithHoles ( )

inline

Return an iterator object, for the aOutline-th outline in the set (with holes).

Definition at line 902 of file shape_poly_set.h.

References IterateSegments(), and OutlineCount().

Referenced by ConvertOutlineToPolygon(), ZONE::HatchBorder(), and BOARD::TestZoneIntersection().

IterateSegmentsWithHoles() [2/2]

SEGMENT_ITERATOR SHAPE_POLY_SET::IterateSegmentsWithHoles ( int  aOutline )

inline

Return an iterator object, for the aOutline-th outline in the set (with holes).

Definition at line 908 of file shape_poly_set.h.

References IterateSegments().

IterateWithHoles() [1/2]

ITERATOR SHAPE_POLY_SET::IterateWithHoles ( int  aOutline )

inline

Parameters

aOutline

the index of the polygon to be iterated.

Returns

an iterator object to visit all points in the main outline of the aOutline-th polygon, visiting also the points in the holes.

Definition at line 767 of file shape_poly_set.h.

    {
        return Iterate( aOutline, aOutline, true );
    }

References Iterate().

Referenced by findVertex(), ZONE::HatchBorder(), ZONE::IterateWithHoles(), and BOARD::TestZoneIntersection().

IterateWithHoles() [2/2]

ITERATOR SHAPE_POLY_SET::IterateWithHoles ( )

inline

Returns

an iterator object to visit all points in all outlines of the set, visiting also the points in the holes.

Definition at line 785 of file shape_poly_set.h.

    {
        return Iterate( 0, OutlineCount() - 1, true );
    }

References Iterate(), and OutlineCount().

Referenced by IterateFromVertexWithHoles(), and RemoveNullSegments().

Mirror()

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

Mirror the line points about y or x (or both)

Parameters

aX	If true, mirror about the y axis (flip x coordinate)
aY	If true, mirror about the x axis
aRef	sets the reference point about which to mirror

Definition at line 1807 of file shape_poly_set.cpp.

{
    for( POLYGON& poly : m_polys )
    {
        for( SHAPE_LINE_CHAIN& path : poly )
            path.Mirror( aX, aY, aRef );
    }

    if( m_triangulationValid )
        CacheTriangulation();
}

References CacheTriangulation(), m_polys, m_triangulationValid, and path.

Referenced by GERBER_DRAW_ITEM::ConvertSegmentToPolygon(), FP_SHAPE::Flip(), FOOTPRINT::Flip(), EDA_SHAPE::flip(), FABMASTER::loadFootprints(), FP_SHAPE::Mirror(), and ZONE::Mirror().

Move()

void SHAPE_POLY_SET::Move ( const VECTOR2I &  aVector )

overridevirtual

Implements SHAPE.

Definition at line 1792 of file shape_poly_set.cpp.

{
    for( POLYGON& poly : m_polys )
    {
        for( SHAPE_LINE_CHAIN& path : poly )
            path.Move( aVector );
    }

    for( std::unique_ptr<TRIANGULATED_POLYGON>& tri : m_triangulatedPolys )
        tri->Move( aVector );

    m_hash = checksum();
}

References checksum(), m_hash, m_polys, m_triangulatedPolys, and path.

Referenced by ZONE_FILLER::addHatchFillTypeOnZone(), GERBER_DRAW_ITEM::ConvertSegmentToPolygon(), ALTIUM_PCB::HelperShapeSetLocalCoord(), GERBER_DRAW_ITEM::HitTest(), FABMASTER::loadFootprints(), CADSTAR_PCB_ARCHIVE_LOADER::loadLibraryCoppers(), FP_SHAPE::Move(), EDA_SHAPE::move(), ZONE::Move(), GERBER_DRAW_ITEM::MoveAB(), FOOTPRINT::MoveAnchorPosition(), GERBER_DRAW_ITEM::MoveXY(), DS_DRAW_ITEM_POLYPOLYGONS::SetPosition(), FOOTPRINT::SetPosition(), TransformOvalToPolygon(), TransformRoundChamferedRectToPolygon(), PAD::TransformShapeWithClearanceToPolygon(), and TransformTrapezoidToPolygon().

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

NewHole()

int SHAPE_POLY_SET::NewHole

(

int

aOutline = -1

)

Adds a new outline to the set and returns its index.

Definition at line 212 of file shape_poly_set.cpp.

{
    SHAPE_LINE_CHAIN empty_path;

    empty_path.SetClosed( true );

    // Default outline is the last one
    if( aOutline < 0 )
        aOutline += m_polys.size();

    // Add hole to the selected outline
    m_polys[aOutline].push_back( empty_path );

    return m_polys.back().size() - 2;
}

References m_polys, and SHAPE_LINE_CHAIN::SetClosed().

Referenced by ConvertOutlineToPolygon(), ZONE::NewHole(), and TransformRingToPolygon().

NewOutline()

int SHAPE_POLY_SET::NewOutline

(

)

Creates a new hole in a given outline.

Definition at line 200 of file shape_poly_set.cpp.

{
    SHAPE_LINE_CHAIN empty_path;
    POLYGON poly;

    empty_path.SetClosed( true );
    poly.push_back( empty_path );
    m_polys.push_back( poly );
    return m_polys.size() - 1;
}

References m_polys, and SHAPE_LINE_CHAIN::SetClosed().

Referenced by AR_AUTOPLACER::addFpBody(), addHoleToPolygon(), ZONE_FILLER::addKnockout(), AR_AUTOPLACER::addPad(), LIB_SHAPE::AddPoint(), ZONE::AppendCorner(), EDA_SHAPE::beginEdit(), BuildBoardPolygonOutlines(), BuildFootprintPolygonOutlines(), KI_TEST::CommonTestData::CommonTestData(), ConvertOutlineToPolygon(), GERBER_DRAW_ITEM::ConvertSegmentToPolygon(), D_CODE::ConvertShapeToPolygon(), CornerListToPolygon(), BITMAPCONV_INFO::createOutputData(), BOARD_ADAPTER::createPadWithClearance(), KIGFX::PCB_PAINTER::draw(), KIGFX::GERBVIEW_PAINTER::drawPolygon(), GERBER_FILE_IMAGE::Execute_DCODE_Command(), fillArcPOLY(), PCB_BASE_FRAME::FocusOnItem(), FOOTPRINT::GetBoundingHull(), getRectangleAlongCentreLine(), EDA_SHAPE::hitTest(), FABMASTER::loadFootprints(), EAGLE_PLUGIN::loadPolygon(), FABMASTER::loadShapePolySet(), FABMASTER::loadZone(), LEGACY_PLUGIN::loadZONE_CONTAINER(), PCB_PARSER::parseZONE(), DXF_PLOTTER::PlotPoly(), PlotStandardLayer(), RENDER_3D_OPENGL::reload(), EDA_SHAPE::rotate(), KIGFX::PREVIEW::POLYGON_ITEM::SetPoints(), EDA_SHAPE::SetPolyPoints(), SHAPE_POLY_SET(), DS_DATA_ITEM_POLYGONS::SyncDrawItems(), TransformArcToPolygon(), EDA_TEXT::TransformBoundingBoxWithClearanceToPolygon(), TransformCircleToPolygon(), TransformOvalToPolygon(), EDA_SHAPE::TransformShapeWithClearanceToPolygon(), PCB_DIM_ALIGNED::updateGeometry(), PCB_DIM_ORTHOGONAL::updateGeometry(), PCB_DIM_LEADER::updateGeometry(), and EE_POINT_EDITOR::updateParentItem().

NormalizeAreaOutlines()

int SHAPE_POLY_SET::NormalizeAreaOutlines

(

)

Convert a self-intersecting polygon to one (or more) non self-intersecting polygon(s).

Removes null segments.

Returns

the polygon count (always >= 1, because there is at least one polygon) There are new polygons only if the polygon count is > 1.

Definition at line 1244 of file shape_poly_set.cpp.

{
    // We are expecting only one main outline, but this main outline can have holes
    // if holes: combine holes and remove them from the main outline.
    // Note also we are using SHAPE_POLY_SET::PM_STRICTLY_SIMPLE in polygon
    // calculations, but it is not mandatory. It is used mainly
    // because there is usually only very few vertices in area outlines
    SHAPE_POLY_SET::POLYGON& outline = Polygon( 0 );
    SHAPE_POLY_SET holesBuffer;

    // Move holes stored in outline to holesBuffer:
    // The first SHAPE_LINE_CHAIN is the main outline, others are holes
    while( outline.size() > 1 )
    {
        holesBuffer.AddOutline( outline.back() );
        outline.pop_back();
    }

    Simplify( SHAPE_POLY_SET::PM_STRICTLY_SIMPLE );

    // If any hole, subtract it to main outline
    if( holesBuffer.OutlineCount() )
    {
        holesBuffer.Simplify( SHAPE_POLY_SET::PM_FAST );
        BooleanSubtract( holesBuffer, SHAPE_POLY_SET::PM_STRICTLY_SIMPLE );
    }

    RemoveNullSegments();

    return OutlineCount();
}

References AddOutline(), BooleanSubtract(), OutlineCount(), PM_FAST, PM_STRICTLY_SIMPLE, Polygon(), RemoveNullSegments(), and Simplify().

Referenced by BITMAPCONV_INFO::createOutputData(), and BOARD::NormalizeAreaPolygon().

operator=()

SHAPE_POLY_SET & SHAPE_POLY_SET::operator=

(

const SHAPE_POLY_SET &

aOther

)

Definition at line 2181 of file shape_poly_set.cpp.

{
    static_cast<SHAPE&>(*this) = aOther;
    m_polys = aOther.m_polys;
    m_triangulatedPolys.clear();
    m_triangulationValid = false;

    if( aOther.IsTriangulationUpToDate() )
    {
        for( unsigned i = 0; i < aOther.TriangulatedPolyCount(); i++ )
        {
            const TRIANGULATED_POLYGON* poly = aOther.TriangulatedPolygon( i );
            m_triangulatedPolys.push_back( std::make_unique<TRIANGULATED_POLYGON>( *poly ) );
        }

        m_hash = aOther.GetHash();
        m_triangulationValid = true;
    }

    return *this;
}

References GetHash(), IsTriangulationUpToDate(), m_hash, m_polys, m_triangulatedPolys, m_triangulationValid, TriangulatedPolyCount(), and TriangulatedPolygon().

Outline() [1/2]

SHAPE_LINE_CHAIN& SHAPE_POLY_SET::Outline ( int  aIndex )

inline

Definition at line 665 of file shape_poly_set.h.

    {
        return m_polys[aIndex][0];
    }

References m_polys.

Referenced by EE_POINT_EDITOR::addCorner(), ZONE_FILLER::addHatchFillTypeOnZone(), LIB_SHAPE::AddPoint(), Area(), EDA_SHAPE::beginEdit(), BOOST_AUTO_TEST_CASE(), BuildFootprintPolygonOutlines(), ZONE::BuildSmoothedPoly(), EDA_SHAPE::calcEdit(), calcIsInsideArea(), ZONE::CalculateFilledArea(), PCB_GRID_HELPER::computeAnchors(), EDA_SHAPE::continueEdit(), ConvertPolygonToBlocks(), FOOTPRINT::CoverageRatio(), CONVERT_TOOL::CreateLines(), BITMAPCONV_INFO::createOutputData(), PLACEFILE_GERBER_WRITER::CreatePlaceFile(), DIALOG_PAD_PRIMITIVE_POLY_PROPS::DIALOG_PAD_PRIMITIVE_POLY_PROPS(), KIGFX::DS_PAINTER::draw(), KIGFX::SCH_PAINTER::draw(), KIGFX::PCB_PAINTER::draw(), APERTURE_MACRO::DrawApertureMacroShape(), EDA_SHAPE::endEdit(), DSN::SPECCTRA_DB::fillBOUNDARY(), AR_AUTOPLACER::fillMatrix(), CADSTAR_SCH_ARCHIVE_LOADER::fixUpLibraryPins(), GERBER_PLOTTER::FlashPadChamferRoundRect(), PSLIKE_PLOTTER::FlashPadCustom(), GERBER_PLOTTER::FlashPadCustom(), HPGL_PLOTTER::FlashPadCustom(), DXF_PLOTTER::FlashPadCustom(), PSLIKE_PLOTTER::FlashPadRoundRect(), GERBER_PLOTTER::FlashPadRoundRect(), HPGL_PLOTTER::FlashPadRoundRect(), DXF_PLOTTER::FlashPadRoundRect(), PCB_IO::format(), formatPoly(), DIALOG_BOARD_STATISTICS::getDataFromPCB(), PCB_SHAPE::GetFocusPosition(), CADSTAR_PCB_ARCHIVE_LOADER::getPolySetFromCadstarShape(), CADSTAR_SCH_ARCHIVE_LOADER::getScaledLibPart(), LIB_SHAPE::GetSelectMenuText(), EDA_SHAPE::hitTest(), GEOM_TEST::IsPolySetValid(), FABMASTER::loadFootprints(), FABMASTER::loadZone(), EDIT_POINTS_FACTORY::Make(), DSN::SPECCTRA_DB::makeIMAGE(), DSN::SPECCTRA_DB::makePADSTACK(), BOARD::NormalizeAreaPolygon(), PCB_PARSER::parseZONE(), LIB_SHAPE::Plot(), PlotDrawingSheet(), BRDITEMS_PLOTTER::PlotFilledAreas(), BRDITEMS_PLOTTER::PlotFootprintGraphicItem(), polygonArea(), LIB_SHAPE::print(), GERBER_DRAW_ITEM::PrintGerberPoly(), DS_DRAW_ITEM_POLYPOLYGONS::PrintWsItem(), RENDER_3D_OPENGL::reload(), EE_POINT_EDITOR::removeCorner(), EE_POINT_EDITOR::removeCornerCondition(), PCB_POINT_EDITOR::removeCornerCondition(), DRC_TEST_PROVIDER_EDGE_CLEARANCE::Run(), EDA_SHAPE::scale(), SHAPE_POLY_SET(), TransformArcToPolygon(), EE_POINT_EDITOR::updatePoints(), GBR_TO_PCB_EXPORTER::writePcbPolygon(), and GBR_TO_PCB_EXPORTER::writePcbZoneItem().

Outline() [2/2]

const SHAPE_LINE_CHAIN& SHAPE_POLY_SET::Outline ( int  aIndex ) const

inline

Definition at line 670 of file shape_poly_set.h.

    {
        return m_polys[aIndex][0];
    }

References m_polys.

OutlineCount()

int SHAPE_POLY_SET::OutlineCount ( ) const

inline

Return the number of vertices in a given outline/hole.

Definition at line 647 of file shape_poly_set.h.

References m_polys.

Referenced by PCB_POINT_EDITOR::addCorner(), ZONE_FILLER::addHatchFillTypeOnZone(), PAD::addPadPrimitivesToPolygon(), ZONE::AddPolygon(), BOARD_ADAPTER::addSolidAreasShapes(), TRIANGLE_DISPLAY_LIST::AddToMiddleContourns(), ZONE::AppendCorner(), Area(), booleanOp(), BOOST_AUTO_TEST_CASE(), BOOST_FIXTURE_TEST_CASE(), BuildBBoxCaches(), BuildBoardPolygonOutlines(), BuildConvexHull(), BuildFootprintPolygonOutlines(), CacheTriangulation(), calcIsInsideArea(), ZONE::CalculateFilledArea(), CIterate(), CIterateSegments(), CIterateSegmentsWithHoles(), CIterateWithHoles(), Contains(), ConvertPolygonToBlocks(), RENDER_3D_OPENGL::createBoard(), BITMAPCONV_INFO::createOutputData(), PLACEFILE_GERBER_WRITER::CreatePlaceFile(), CONVERT_TOOL::CreatePolys(), KIGFX::DS_PAINTER::draw(), KIGFX::GERBVIEW_PAINTER::draw(), KIGFX::PCB_PAINTER::draw(), KIGFX::GERBVIEW_PAINTER::drawApertureMacro(), APERTURE_MACRO::DrawApertureMacroShape(), D_CODE::DrawFlashedPolygon(), D_CODE::DrawFlashedShape(), KIGFX::GERBVIEW_PAINTER::drawFlashedShape(), AR_AUTOPLACER::drawPlacementRoutingMatrix(), KIGFX::CAIRO_GAL_BASE::DrawPolygon(), KIGFX::OPENGL_GAL::DrawPolygon(), KIGFX::GERBVIEW_PAINTER::drawPolygon(), KIGFX::PREVIEW::POLYGON_ITEM::drawPreviewShape(), KIGFX::OPENGL_GAL::drawTriangulatedPolyset(), EDA_SHAPE::DupPolyPointsList(), GERBER_FILE_IMAGE::Execute_DCODE_Command(), EXPORTER_PCB_VRML::ExportVrmlBoard(), EXPORTER_PCB_VRML::ExportVrmlPolygonSet(), ZONE_FILLER::Fill(), fillArcPOLY(), DSN::SPECCTRA_DB::fillBOUNDARY(), GEOM_TEST::FilletPolySet(), PSLIKE_PLOTTER::FlashPadCustom(), GERBER_PLOTTER::FlashPadCustom(), HPGL_PLOTTER::FlashPadCustom(), DXF_PLOTTER::FlashPadCustom(), PCB_IO::format(), RENDER_3D_OPENGL::generateHoles(), RENDER_3D_OPENGL::generateLayerList(), RENDER_3D_OPENGL::generateViasAndPads(), APERTURE_MACRO::GetApertureMacroShape(), PAD::GetBestAnchorPosition(), GERBER_DRAW_ITEM::GetBoundingBox(), FOOTPRINT::GetBoundingHull(), DIALOG_BOARD_STATISTICS::getDataFromPCB(), CADSTAR_PCB_ARCHIVE_LOADER::getPolySetFromCadstarShape(), GetRelativeIndices(), HasTouchingHoles(), DS_DRAW_ITEM_POLYPOLYGONS::HitTest(), ZONE::HitTestCutout(), isCopperOutside(), GEOM_TEST::IsPolySetValid(), Iterate(), IterateSegments(), IterateSegmentsWithHoles(), IterateWithHoles(), FABMASTER::loadFootprints(), FABMASTER::loadGraphics(), FABMASTER::loadPolygon(), NormalizeAreaOutlines(), SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::operator bool(), DIALOG_PAD_PROPERTIES::padValuesOK(), partitionPolyIntoRegularCellGrid(), PlotDrawingSheet(), BRDITEMS_PLOTTER::PlotFilledAreas(), BRDITEMS_PLOTTER::PlotFootprintGraphicItem(), PlotLayerOutlines(), DXF_PLOTTER::PlotPoly(), PlotSolderMaskLayer(), PlotStandardLayer(), polygon_triangulation_main(), polygonArea(), GERBER_DRAW_ITEM::Print(), DS_DRAW_ITEM_POLYPOLYGONS::PrintWsItem(), RENDER_3D_RAYTRACE::Reload(), ZONE::RemoveCutout(), Subset(), PNS_KICAD_IFACE_BASE::syncZone(), TestConcaveSquareFillet(), DRC_TEST_PROVIDER_COURTYARD_CLEARANCE::testCourtyardClearances(), TestSquareFillet(), HYPERLYNX_EXPORTER::writeBoardInfo(), HYPERLYNX_EXPORTER::writeNetObjects(), GBR_TO_PCB_EXPORTER::writePcbPolygon(), and GBR_TO_PCB_EXPORTER::writePcbZoneItem().

Parse()

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

overridevirtual

Reimplemented from SHAPE.

Definition at line 1308 of file shape_poly_set.cpp.

{
    std::string tmp;

    aStream >> tmp;

    if( tmp != "polyset" )
        return false;

    aStream >> tmp;

    int n_polys = atoi( tmp.c_str() );

    if( n_polys < 0 )
        return false;

    for( int i = 0; i < n_polys; i++ )
    {
        POLYGON paths;

        aStream >> tmp;

        if( tmp != "poly" )
            return false;

        aStream >> tmp;
        int n_outlines = atoi( tmp.c_str() );

        if( n_outlines < 0 )
            return false;

        for( int j = 0; j < n_outlines; j++ )
        {
            SHAPE_LINE_CHAIN outline;

            outline.SetClosed( true );

            aStream >> tmp;
            int n_vertices = atoi( tmp.c_str() );

            for( int v = 0; v < n_vertices; v++ )
            {
                VECTOR2I p;

                aStream >> tmp; p.x = atoi( tmp.c_str() );
                aStream >> tmp; p.y = atoi( tmp.c_str() );
                outline.Append( p );
            }

            paths.push_back( outline );
        }

        m_polys.push_back( paths );
    }

    return true;
}

References SHAPE_LINE_CHAIN::Append(), m_polys, SHAPE_LINE_CHAIN::SetClosed(), VECTOR2< T >::x, and VECTOR2< T >::y.

PointOnEdge()

bool SHAPE_POLY_SET::PointOnEdge

(

const VECTOR2I &

aP

)

const

Check if point aP lies on an edge or vertex of some of the outlines or holes.

Parameters

aP	is the point to check.

Returns

true if the point lies on the edge of any polygon.

Definition at line 1400 of file shape_poly_set.cpp.

{
    // Iterate through all the polygons in the set
    for( const POLYGON& polygon : m_polys )
    {
        // Iterate through all the line chains in the polygon
        for( const SHAPE_LINE_CHAIN& lineChain : polygon )
        {
            if( lineChain.PointOnEdge( aP ) )
                return true;
        }
    }

    return false;
}

References m_polys.

Polygon() [1/2]

POLYGON& SHAPE_POLY_SET::Polygon ( int  aIndex )

inline

Definition at line 698 of file shape_poly_set.h.

    {
        return m_polys[aIndex];
    }

References m_polys.

Referenced by CacheTriangulation(), chamferFilletPolygon(), KIGFX::OPENGL_GAL::drawTriangulatedPolyset(), ZONE_FILLER::Fill(), PCB_IO::format(), SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::Get(), SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::Get(), GetGlobalIndex(), FABMASTER::loadFootprints(), NormalizeAreaOutlines(), polygon_triangulation_main(), PCB_POINT_EDITOR::removeCorner(), PCB_POINT_EDITOR::removeCornerCondition(), and Subset().

Polygon() [2/2]

const POLYGON& SHAPE_POLY_SET::Polygon ( int  aIndex ) const

inline

Definition at line 703 of file shape_poly_set.h.

    {
        return m_polys[aIndex];
    }

References m_polys.

RemoveAllContours()

void SHAPE_POLY_SET::RemoveAllContours

(

)

Definition at line 1545 of file shape_poly_set.cpp.

{
    m_polys.clear();
}

References m_polys.

Referenced by buildBoardBoundingBoxPoly(), BuildBoardPolygonOutlines(), AR_AUTOPLACER::buildFpAreas(), FOOTPRINT::BuildPolyCourtyards(), D_CODE::Clear_D_CODE_Data(), GERBER_DRAW_ITEM::ConvertSegmentToPolygon(), D_CODE::ConvertShapeToPolygon(), BOARD_ADAPTER::createBoardPolygon(), BITMAPCONV_INFO::createOutputData(), BOARD_ADAPTER::destroyLayers(), EXPORTER_PCB_VRML::ExportStandardLayers(), EXPORTER_PCB_VRML::ExportVrmlSolderMask(), ZONE_FILLER::Fill(), RENDER_3D_OPENGL::generateViasAndPads(), APERTURE_MACRO::GetApertureMacroShape(), FOOTPRINT::GetBoundingHull(), PAD::MergePrimitivesAsPolygon(), PlotLayerOutlines(), RENDER_3D_OPENGL::reload(), ZONE::RemoveAllContours(), EDA_SHAPE::rotate(), KIGFX::PREVIEW::POLYGON_ITEM::SetPoints(), EDA_SHAPE::SetPolyPoints(), and EE_POINT_EDITOR::updateParentItem().

RemoveContour()

void SHAPE_POLY_SET::RemoveContour	(	int	aContourIdx,
		int	aPolygonIdx = -1
	)

Delete the aContourIdx-th contour of the aPolygonIdx-th polygon in the set.

Parameters

aContourIdx	is the index of the contour in the aPolygonIdx-th polygon to be removed.
aPolygonIdx	is the index of the polygon in which the to-be-removed contour is. Defaults to the last polygon in the set.

Definition at line 1551 of file shape_poly_set.cpp.

{
    // Default polygon is the last one
    if( aPolygonIdx < 0 )
        aPolygonIdx += m_polys.size();

    m_polys[aPolygonIdx].erase( m_polys[aPolygonIdx].begin() + aContourIdx );
}

References m_polys.

Referenced by PCB_POINT_EDITOR::removeCorner().

RemoveNullSegments()

int SHAPE_POLY_SET::RemoveNullSegments

(

)

Look for null segments; ie, segments whose ends are exactly the same and deletes them.

Returns

the number of deleted segments.

Definition at line 1561 of file shape_poly_set.cpp.

{
    int removed = 0;

    ITERATOR iterator = IterateWithHoles();

    VECTOR2I    contourStart = *iterator;
    VECTOR2I    segmentStart, segmentEnd;

    VERTEX_INDEX indexStart;

    while( iterator )
    {
        // Obtain first point and its index
        segmentStart = *iterator;
        indexStart = iterator.GetIndex();

        // Obtain last point
        if( iterator.IsEndContour() )
        {
            segmentEnd = contourStart;

            // Advance
            iterator++;

            if( iterator )
                contourStart = *iterator;
        }
        else
        {
            // Advance
            iterator++;

            if( iterator )
                segmentEnd = *iterator;
        }

        // Remove segment start if both points are equal
        if( segmentStart == segmentEnd )
        {
            RemoveVertex( indexStart );
            removed++;

            // Advance the iterator one position, as there is one vertex less.
            if( iterator )
                iterator++;
        }
    }

    return removed;
}

References SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::GetIndex(), SHAPE_POLY_SET::ITERATOR_TEMPLATE< T >::IsEndContour(), IterateWithHoles(), and RemoveVertex().

Referenced by chamferFilletPolygon(), and NormalizeAreaOutlines().

RemoveVertex() [1/2]

void SHAPE_POLY_SET::RemoveVertex

(

int

aGlobalIndex

)

Delete the aGlobalIndex-th vertex.

Parameters

aGlobalIndex

is the global index of the to-be-removed vertex.

Definition at line 1733 of file shape_poly_set.cpp.

{
    VERTEX_INDEX index;

    // Assure the to be removed vertex exists, abort otherwise
    if( GetRelativeIndices( aGlobalIndex, &index ) )
        RemoveVertex( index );
    else
        throw( std::out_of_range( "aGlobalIndex-th vertex does not exist" ) );
}

References GetRelativeIndices().

Referenced by PCB_POINT_EDITOR::removeCorner(), and RemoveNullSegments().

RemoveVertex() [2/2]

void SHAPE_POLY_SET::RemoveVertex

(

VERTEX_INDEX

aRelativeIndices

)

Delete the vertex indexed by aRelativeIndex (index of polygon, contour and vertex).

Parameters

aRelativeIndices

is the set of relative indices of the to-be-removed vertex.Remove all outlines & holes (clears) the polygon set.

Definition at line 1745 of file shape_poly_set.cpp.

{
    m_polys[aIndex.m_polygon][aIndex.m_contour].Remove( aIndex.m_vertex );
}

References SHAPE_POLY_SET::VERTEX_INDEX::m_contour, SHAPE_POLY_SET::VERTEX_INDEX::m_polygon, m_polys, and SHAPE_POLY_SET::VERTEX_INDEX::m_vertex.

Rotate()

void SHAPE_POLY_SET::Rotate ( double  aAngle, const VECTOR2I &  aCenter = { 0, 0 }  )

overridevirtual

Rotate all vertices by a given angle.

Parameters

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

Implements SHAPE.

Definition at line 1820 of file shape_poly_set.cpp.

{
    for( POLYGON& poly : m_polys )
    {
        for( SHAPE_LINE_CHAIN& path : poly )
            path.Rotate( aAngle, aCenter );
    }

    // Don't re-cache if the triangulation is already invalid
    if( m_triangulationValid )
        CacheTriangulation();
}

References CacheTriangulation(), m_polys, m_triangulationValid, and path.

Referenced by ZONE_FILLER::addHatchFillTypeOnZone(), D_CODE::ConvertShapeToPolygon(), ALTIUM_PCB::HelperShapeSetLocalCoord(), FABMASTER::loadFootprints(), EDA_SHAPE::rotate(), ZONE::Rotate(), FOOTPRINT::SetOrientation(), TransformOvalToPolygon(), TransformRoundChamferedRectToPolygon(), FP_TEXT::TransformShapeWithClearanceToPolygon(), PAD::TransformShapeWithClearanceToPolygon(), TransformTrapezoidToPolygon(), PCB_DIM_ALIGNED::updateGeometry(), PCB_DIM_ORTHOGONAL::updateGeometry(), and PCB_DIM_LEADER::updateGeometry().

SetVertex() [1/2]

void SHAPE_POLY_SET::SetVertex	(	const VERTEX_INDEX &	aIndex,
		const VECTOR2I &	aPos
	)

Accessor function to set the position of a specific point.

Parameters

aIndex	#VERTEX_INDEX of the point to move.
aPos	destination position of the specified point.

Definition at line 1762 of file shape_poly_set.cpp.

{
    m_polys[aIndex.m_polygon][aIndex.m_contour].SetPoint( aIndex.m_vertex, aPos );
}

References SHAPE_POLY_SET::VERTEX_INDEX::m_contour, SHAPE_POLY_SET::VERTEX_INDEX::m_polygon, m_polys, and SHAPE_POLY_SET::VERTEX_INDEX::m_vertex.

Referenced by ZONE::MoveEdge(), ZONE::SetCornerPosition(), SetVertex(), and PCB_POINT_EDITOR::updateItem().

SetVertex() [2/2]

void SHAPE_POLY_SET::SetVertex	(	int	aGlobalIndex,
		const VECTOR2I &	aPos
	)

Set the vertex based on the global index.

Throws if the index doesn't exist.

Parameters

aGlobalIndex	global index of the to-be-moved vertex
aPos	New position on the vertexReturn total number of vertices stored in the set.

Definition at line 1751 of file shape_poly_set.cpp.

{
    VERTEX_INDEX index;

    if( GetRelativeIndices( aGlobalIndex, &index ) )
        SetVertex( index, aPos );
    else
        throw( std::out_of_range( "aGlobalIndex-th vertex does not exist" ) );
}

References GetRelativeIndices(), and SetVertex().

Simplify()

void SHAPE_POLY_SET::Simplify

(

POLYGON_MODE

aFastMode

)

Definition at line 1236 of file shape_poly_set.cpp.

{
    SHAPE_POLY_SET empty;

    booleanOp( ClipperLib::ctUnion, empty, aFastMode );
}

References booleanOp(), and empty().

Referenced by PAD::addPadPrimitivesToPolygon(), BOARD_ADAPTER::addShapeWithClearance(), BOOST_AUTO_TEST_CASE(), ZONE_FILLER::buildCopperItemClearances(), BOARD_ADAPTER::createBoardPolygon(), BOARD_ADAPTER::createLayers(), BITMAPCONV_INFO::createOutputData(), Fracture(), APERTURE_MACRO::GetApertureMacroShape(), BOARD::GetBoardPolygonOutlines(), InflateWithLinkedHoles(), DSN::SPECCTRA_DB::makeIMAGE(), NormalizeAreaOutlines(), ALTIUM_PCB::ParseArcs6Data(), PlotLayerOutlines(), PlotSolderMaskLayer(), TransformArcToPolygon(), PAD::TransformShapeWithClearanceToPolygon(), ZONE::TransformShapeWithClearanceToPolygon(), Unfracture(), HYPERLYNX_EXPORTER::writeNetObjects(), GBR_TO_PCB_EXPORTER::writePcbPolygon(), and GBR_TO_PCB_EXPORTER::writePcbZoneItem().

SquaredDistance() [1/2]

SEG::ecoord SHAPE_POLY_SET::SquaredDistance	(	VECTOR2I	aPoint,
		VECTOR2I *	aNearest = nullptr
	)		const

Compute the minimum distance squared between aPoint and all the polygons in the set.

Squared distances are used because they avoid the cost of doing square-roots.

Parameters

aPoint	is the point whose distance to the set has to be measured.
aNearest	[out] an optional pointer to be filled in with the point on the polyset which is closest to aPoint.

Returns

The minimum distance squared between aPoint and all the polygons in the set. If the point is contained in any of the polygons, the distance is zero.

Definition at line 1934 of file shape_poly_set.cpp.

{
    SEG::ecoord currentDistance_sq;
    SEG::ecoord minDistance_sq = VECTOR2I::ECOORD_MAX;
    VECTOR2I    nearest;

    // Iterate through all the polygons and get the minimum distance.
    for( unsigned int polygonIdx = 0; polygonIdx < m_polys.size(); polygonIdx++ )
    {
        currentDistance_sq = SquaredDistanceToPolygon( aPoint, polygonIdx,
                                                       aNearest ? &nearest : nullptr );

        if( currentDistance_sq < minDistance_sq )
        {
            if( aNearest )
                *aNearest = nearest;

            minDistance_sq = currentDistance_sq;
        }
    }

    return minDistance_sq;
}

References VECTOR2< T >::ECOORD_MAX, m_polys, and SquaredDistanceToPolygon().

Referenced by BOOST_AUTO_TEST_CASE(), and Collide().

SquaredDistance() [2/2]

SEG::ecoord SHAPE_POLY_SET::SquaredDistance	(	const SEG &	aSegment,
		VECTOR2I *	aNearest = nullptr
	)		const

Compute the minimum distance squared between aSegment and all the polygons in the set.

Squared distances are used because they avoid the cost of doing square-roots.

Parameters

aSegment	is the segment whose distance to the polygon set has to be measured.
aSegmentWidth	is the width of the segment; defaults to zero.
aNearest	[out] an optional pointer to be filled in with the point on the polyset which is closest to aSegment.

Returns

The minimum distance squared between aSegment and all the polygons in the set. If the point is contained in the polygon, the distance is zero.

Definition at line 1959 of file shape_poly_set.cpp.

{
    SEG::ecoord currentDistance_sq;
    SEG::ecoord minDistance_sq = VECTOR2I::ECOORD_MAX;
    VECTOR2I    nearest;

    // Iterate through all the polygons and get the minimum distance.
    for( unsigned int polygonIdx = 0; polygonIdx < m_polys.size(); polygonIdx++ )
    {
        currentDistance_sq = SquaredDistanceToPolygon( aSegment, polygonIdx,
                                                       aNearest ? &nearest : nullptr );

        if( currentDistance_sq < minDistance_sq )
        {
            if( aNearest )
                *aNearest = nearest;

            minDistance_sq = currentDistance_sq;
        }
    }

    return minDistance_sq;
}

References VECTOR2< T >::ECOORD_MAX, m_polys, and SquaredDistanceToPolygon().

SquaredDistanceToPolygon() [1/2]

SEG::ecoord SHAPE_POLY_SET::SquaredDistanceToPolygon	(	VECTOR2I	aPoint,
		int	aIndex,
		VECTOR2I *	aNearest
	)		const

Compute the minimum distance between the aIndex-th polygon and aPoint.

Parameters

aPoint	is the point whose distance to the aIndex-th polygon has to be measured.
aIndex	is the index of the polygon whose distance to aPoint has to be measured.
aNearest	[out] an optional pointer to be filled in with the point on the polyset which is closest to aPoint.

Returns

The minimum distance between aPoint and all the segments of the aIndex-th polygon. If the point is contained in the polygon, the distance is zero.

Definition at line 1861 of file shape_poly_set.cpp.

{
    // We calculate the min dist between the segment and each outline segment.  However, if the
    // segment to test is inside the outline, and does not cross any edge, it can be seen outside
    // the polygon.  Therefore test if a segment end is inside (testing only one end is enough).
    // Use an accuracy of "1" to say that we don't care if it's exactly on the edge or not.
    if( containsSingle( aPoint, aPolygonIndex, 1 ) )
    {
        if( aNearest )
            *aNearest = aPoint;

        return 0;
    }

    CONST_SEGMENT_ITERATOR iterator = CIterateSegmentsWithHoles( aPolygonIndex );

    SEG::ecoord minDistance = (*iterator).SquaredDistance( aPoint );

    for( iterator++; iterator && minDistance > 0; iterator++ )
    {
        SEG::ecoord currentDistance = (*iterator).SquaredDistance( aPoint );

        if( currentDistance < minDistance )
        {
            if( aNearest )
                *aNearest = (*iterator).NearestPoint( aPoint );

            minDistance = currentDistance;
        }
    }

    return minDistance;
}

References CIterateSegmentsWithHoles(), and containsSingle().

Referenced by SquaredDistance().

SquaredDistanceToPolygon() [2/2]

SEG::ecoord SHAPE_POLY_SET::SquaredDistanceToPolygon	(	const SEG &	aSegment,
		int	aIndex,
		VECTOR2I *	aNearest
	)		const

Compute the minimum distance between the aIndex-th polygon and aSegment with a possible width.

Parameters

aSegment	is the segment whose distance to the aIndex-th polygon has to be measured.
aIndex	is the index of the polygon whose distance to aPoint has to be measured.
aNearest	[out] an optional pointer to be filled in with the point on the polyset which is closest to aSegment.

Returns

The minimum distance between aSegment and all the segments of the aIndex-th polygon. If the point is contained in the polygon, the distance is zero.

Definition at line 1897 of file shape_poly_set.cpp.

{
    // Check if the segment is fully-contained.  If so, its midpoint is a good-enough nearest point.
    if( containsSingle( aSegment.A, aPolygonIndex, 1 ) &&
        containsSingle( aSegment.B, aPolygonIndex, 1 ) )
    {
        if( aNearest )
            *aNearest = ( aSegment.A + aSegment.B ) / 2;

        return 0;
    }

    CONST_SEGMENT_ITERATOR iterator = CIterateSegmentsWithHoles( aPolygonIndex );
    SEG::ecoord            minDistance = (*iterator).SquaredDistance( aSegment );

    if( aNearest && minDistance == 0 )
        *aNearest = ( *iterator ).NearestPoint( aSegment );

    for( iterator++; iterator && minDistance > 0; iterator++ )
    {
        SEG::ecoord currentDistance = (*iterator).SquaredDistance( aSegment );

        if( currentDistance < minDistance )
        {
            if( aNearest )
                *aNearest = (*iterator).NearestPoint( aSegment );

            minDistance = currentDistance;
        }
    }

    // Return the maximum of minDistance and zero
    return minDistance < 0 ? 0 : minDistance;
}

References SEG::A, SEG::B, CIterateSegmentsWithHoles(), and containsSingle().

Subset()

SHAPE_POLY_SET SHAPE_POLY_SET::Subset	(	int	aFirstPolygon,
		int	aLastPolygon
	)

Return a subset of the polygons in this set, the ones between aFirstPolygon and aLastPolygon.

Parameters

aFirstPolygon	is the first polygon to be included in the returned set.
aLastPolygon	is the last polygon to be excluded of the returned set.

Returns

a set containing the polygons between aFirstPolygon (included) and aLastPolygon (excluded).

Definition at line 322 of file shape_poly_set.cpp.

{
    assert( aFirstPolygon >= 0 && aLastPolygon <= OutlineCount() );

    SHAPE_POLY_SET newPolySet;

    for( int index = aFirstPolygon; index < aLastPolygon; index++ )
        newPolySet.m_polys.push_back( Polygon( index ) );

    return newPolySet;
}

References m_polys, OutlineCount(), and Polygon().

Referenced by UnitSet().

TotalVertices()

int SHAPE_POLY_SET::TotalVertices

(

)

const

Delete aIdx-th polygon from the set.

Definition at line 1834 of file shape_poly_set.cpp.

{
    int c = 0;

    for( const POLYGON& poly : m_polys )
    {
        for( const SHAPE_LINE_CHAIN& path : poly )
            c += path.PointCount();
    }

    return c;
}

References m_polys, and path.

Referenced by PCB_POINT_EDITOR::buildForPolyOutline(), EDA_SHAPE::Compare(), ZONE::GetNumCorners(), ZONE::HitTest(), InsertVertex(), PCB_POINT_EDITOR::updateItem(), and PCB_POINT_EDITOR::updatePoints().

TriangulatedPolyCount()

unsigned int SHAPE_POLY_SET::TriangulatedPolyCount ( ) const

inline

Return the number of outlines in the set.

Definition at line 644 of file shape_poly_set.h.

References m_triangulatedPolys.

Referenced by ConvertPolygonToTriangles(), KIGFX::OPENGL_GAL::drawTriangulatedPolyset(), operator=(), and SHAPE_POLY_SET().

TriangulatedPolygon()

const TRIANGULATED_POLYGON* SHAPE_POLY_SET::TriangulatedPolygon ( int  aIndex ) const

inline

Definition at line 708 of file shape_poly_set.h.

    {
        return m_triangulatedPolys[aIndex].get();
    }

References m_triangulatedPolys.

Referenced by ConvertPolygonToTriangles(), KIGFX::OPENGL_GAL::drawTriangulatedPolyset(), operator=(), SHAPE_POLY_SET(), and PNS_KICAD_IFACE_BASE::syncZone().

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(), Collide(), collideShapes(), collideSingleShapes(), PNS::OPTIMIZER::computeBreakouts(), ROUTER_PREVIEW_ITEM::drawShape(), PNS::SOLID::HoleHull(), PNS::SOLID::Hull(), and SHAPE_FILE_IO::Write().

Unfracture()

void SHAPE_POLY_SET::Unfracture

(

POLYGON_MODE

aFastMode

)

Return true if the polygon set has any holes.

Definition at line 1227 of file shape_poly_set.cpp.

{
    for( POLYGON& path : m_polys )
        unfractureSingle( path );

    Simplify( aFastMode );    // remove overlapping holes/degeneracy
}

References m_polys, path, Simplify(), and unfractureSingle().

Referenced by PGPartitionFixture::PGPartitionFixture(), and polygon_triangulation_main().

unfractureSingle()

void SHAPE_POLY_SET::unfractureSingle ( SHAPE_POLY_SET::POLYGON &  aPoly )

private

Definition at line 1050 of file shape_poly_set.cpp.

{
    assert( aPoly.size() == 1 );

    struct EDGE
    {
        int m_index = 0;
        SHAPE_LINE_CHAIN* m_poly = nullptr;
        bool m_duplicate = false;

        EDGE( SHAPE_LINE_CHAIN* aPolygon, int aIndex ) :
            m_index( aIndex ),
            m_poly( aPolygon )
        {}

        bool compareSegs( const SEG& s1, const SEG& s2 ) const
        {
            return (s1.A == s2.B && s1.B == s2.A);
        }

        bool operator==( const EDGE& aOther ) const
        {
            return compareSegs( m_poly->CSegment( m_index ),
                                aOther.m_poly->CSegment( aOther.m_index ) );
        }

        bool operator!=( const EDGE& aOther ) const
        {
            return !compareSegs( m_poly->CSegment( m_index ),
                                 aOther.m_poly->CSegment( aOther.m_index ) );
        }

        struct HASH
        {
            std::size_t operator()(  const EDGE& aEdge ) const
            {
                const SEG& a = aEdge.m_poly->CSegment( aEdge.m_index );

                return (std::size_t) ( a.A.x + a.B.x + a.A.y + a.B.y );
            }
        };
    };

    struct EDGE_LIST_ENTRY
    {
        int              index;
        EDGE_LIST_ENTRY* next;
    };

    std::unordered_set<EDGE, EDGE::HASH> uniqueEdges;

    SHAPE_LINE_CHAIN lc = aPoly[0];
    lc.Simplify();

    auto edgeList = std::make_unique<EDGE_LIST_ENTRY[]>( lc.SegmentCount() );

    for( int i = 0; i < lc.SegmentCount(); i++ )
    {
        edgeList[i].index   = i;
        edgeList[i].next    = &edgeList[ (i != lc.SegmentCount() - 1) ? i + 1 : 0 ];
    }

    std::unordered_set<EDGE_LIST_ENTRY*> queue;

    for( int i = 0; i < lc.SegmentCount(); i++ )
    {
        EDGE e( &lc, i );
        uniqueEdges.insert( e );
    }

    for( int i = 0; i < lc.SegmentCount(); i++ )
    {
        EDGE    e( &lc, i );
        auto    it = uniqueEdges.find( e );

        if( it != uniqueEdges.end() && it->m_index != i )
        {
            int e1  = it->m_index;
            int e2  = i;

            if( e1 > e2 )
                std::swap( e1, e2 );

            int e1_prev = e1 - 1;

            if( e1_prev < 0 )
                e1_prev = lc.SegmentCount() - 1;

            int e2_prev = e2 - 1;

            if( e2_prev < 0 )
                e2_prev = lc.SegmentCount() - 1;

            int e1_next = e1 + 1;

            if( e1_next == lc.SegmentCount() )
                e1_next = 0;

            int e2_next = e2 + 1;

            if( e2_next == lc.SegmentCount() )
                e2_next = 0;

            edgeList[e1_prev].next  = &edgeList[ e2_next ];
            edgeList[e2_prev].next  = &edgeList[ e1_next ];
            edgeList[i].next = nullptr;
            edgeList[it->m_index].next = nullptr;
        }
    }

    for( int i = 0; i < lc.SegmentCount(); i++ )
    {
        if( edgeList[i].next )
            queue.insert( &edgeList[i] );
    }

    auto edgeBuf = std::make_unique<EDGE_LIST_ENTRY* []>( lc.SegmentCount() );

    int n = 0;
    int outline = -1;

    POLYGON result;

    while( queue.size() )
    {
        EDGE_LIST_ENTRY* e_first = *queue.begin();
        EDGE_LIST_ENTRY* e = e_first;
        int              cnt = 0;

        do
        {
            edgeBuf[cnt++] = e;
            e = e->next;
        } while( e && e != e_first );

        SHAPE_LINE_CHAIN outl;

        for( int i = 0; i < cnt; i++ )
        {
            VECTOR2I p = lc.CPoint( edgeBuf[i]->index );
            outl.Append( p );
            queue.erase( edgeBuf[i] );
        }

        outl.SetClosed( true );

        bool cw = outl.Area() > 0.0;

        if( cw )
            outline = n;

        result.push_back( outl );
        n++;
    }

    if( outline > 0 )
        std::swap( result[0], result[outline] );

    aPoly = result;
}

References SEG::A, SHAPE_LINE_CHAIN::Append(), SHAPE_LINE_CHAIN::Area(), SEG::B, SHAPE_LINE_CHAIN::CPoint(), SHAPE_LINE_CHAIN::CSegment(), next(), operator!=(), operator==(), SHAPE_LINE_CHAIN::SegmentCount(), SHAPE_LINE_CHAIN::SetClosed(), SHAPE_LINE_CHAIN::Simplify(), VECTOR2< T >::x, and VECTOR2< T >::y.

Referenced by Unfracture().

UnitSet()

SHAPE_POLY_SET SHAPE_POLY_SET::UnitSet ( int  aPolygonIndex )

inline

Return the reference to aHole-th hole in the aIndex-th outline.

Definition at line 686 of file shape_poly_set.h.

References Subset().

Referenced by BOARD::NormalizeAreaPolygon().

VertexCount()

int SHAPE_POLY_SET::VertexCount	(	int	aOutline = -1,
		int	aHole = -1
	)		const

Returns the number of holes in a given outline.

Definition at line 297 of file shape_poly_set.cpp.

{
    if( m_polys.size() == 0 ) // Empty poly set
        return 0;

    if( aOutline < 0 ) // Use last outline
        aOutline += m_polys.size();

    int idx;

    if( aHole < 0 )
        idx = 0;
    else
        idx = aHole + 1;

    if( aOutline >= (int) m_polys.size() ) // not existing outline
        return 0;

    if( idx >= (int) m_polys[aOutline].size() ) // not existing hole
        return 0;

    return m_polys[aOutline][idx].PointCount();
}

References m_polys.

Referenced by Collide(), D_CODE::DrawFlashedPolygon(), GERBER_FILE_IMAGE::Execute_G_Command(), EDA_SHAPE::GetPointCount(), FABMASTER::loadFootprints(), FABMASTER::loadShapePolySet(), and FABMASTER::loadZone().

Member Data Documentation

m_hash

MD5_HASH SHAPE_POLY_SET::m_hash

private

Definition at line 1431 of file shape_poly_set.h.

Referenced by CacheTriangulation(), GetHash(), IsTriangulationUpToDate(), Move(), operator=(), and SHAPE_POLY_SET().

m_polys

POLYSET SHAPE_POLY_SET::m_polys

private

Definition at line 1426 of file shape_poly_set.h.

Referenced by AddHole(), AddOutline(), Append(), ArcCount(), BBox(), BBoxFromCaches(), booleanOp(), Chamfer(), checksum(), CHole(), ClearArcs(), Contains(), containsSingle(), COutline(), CPolygon(), CVertex(), DeletePolygon(), Fillet(), Format(), Fracture(), GetArcs(), GetGlobalIndex(), GetNeighbourIndexes(), HasHoles(), Hole(), HoleCount(), importTree(), Inflate(), InsertVertex(), IsEmpty(), IsSelfIntersecting(), Mirror(), Move(), NewHole(), NewOutline(), operator=(), Outline(), OutlineCount(), Parse(), PointOnEdge(), Polygon(), RemoveAllContours(), RemoveContour(), RemoveVertex(), Rotate(), SetVertex(), SquaredDistance(), Subset(), TotalVertices(), Unfracture(), and VertexCount().

m_triangulatedPolys

std::vector<std::unique_ptr<TRIANGULATED_POLYGON> > SHAPE_POLY_SET::m_triangulatedPolys

private

Definition at line 1428 of file shape_poly_set.h.

Referenced by CacheTriangulation(), Collide(), GetIndexableSubshapeCount(), GetIndexableSubshapes(), Move(), operator=(), SHAPE_POLY_SET(), TriangulatedPolyCount(), and TriangulatedPolygon().

m_triangulationValid

bool SHAPE_POLY_SET::m_triangulationValid = false

private

Definition at line 1430 of file shape_poly_set.h.

Referenced by CacheTriangulation(), IsTriangulationUpToDate(), Mirror(), operator=(), Rotate(), and SHAPE_POLY_SET().

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

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_poly_set.h
• shape_poly_set.cpp