KiCad PCB EDA Suite
SHAPE_POLY_SET Class Reference

Class SHAPE_POLY_SET. More...

#include <shape_poly_set.h>

Inheritance diagram for SHAPE_POLY_SET:
SHAPE

Classes

class  ITERATOR_TEMPLATE
 Class ITERATOR_TEMPLATE. More...
 
class  SEGMENT_ITERATOR_TEMPLATE
 Class SEGMENT_ITERATOR_TEMPLATE. More...
 
class  TRIANGULATED_POLYGON
 
struct  VERTEX_INDEX
 Struct VERTEX_INDEX. 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 (theorically) a strictly simple polygon, but calculations can be really significantly time consuming Most of time PM_FAST is preferable. More...
 
typedef std::vector< SHAPE_LINE_CHAINPOLYGON
 

represents a single polygon outline with holes.

More...
 
typedef struct SHAPE_POLY_SET::VERTEX_INDEX VERTEX_INDEX
 Struct VERTEX_INDEX. More...
 
typedef ITERATOR_TEMPLATE< VECTOR2IITERATOR
 
typedef ITERATOR_TEMPLATE< const VECTOR2ICONST_ITERATOR
 
typedef SEGMENT_ITERATOR_TEMPLATE< SEGSEGMENT_ITERATOR
 
typedef SEGMENT_ITERATOR_TEMPLATE< const SEGCONST_SEGMENT_ITERATOR
 

Public Member Functions

 SHAPE_POLY_SET ()
 
 SHAPE_POLY_SET (const SHAPE_POLY_SET &aOther, bool aDeepCopy=false)
 Copy constructor SHAPE_POLY_SET Performs a deep copy of aOther into this. More...
 
 ~SHAPE_POLY_SET ()
 
bool GetRelativeIndices (int aGlobalIdx, VERTEX_INDEX *aRelativeIndices) const
 Function GetRelativeIndices. More...
 
bool GetGlobalIndex (VERTEX_INDEX aRelativeIndices, int &aGlobalIdx)
 Function GetGlobalIndex computes the global index of a vertex from the relative indices of polygon, contour and vertex. More...
 
SHAPEClone () const override
 Function Clone() More...
 
int NewOutline ()
 

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

More...
 
int NewHole (int aOutline=-1)
 

Creates a new hole in a given outline

More...
 
int AddOutline (const SHAPE_LINE_CHAIN &aOutline)
 

Adds a new outline to the set and returns its index

More...
 
int AddHole (const SHAPE_LINE_CHAIN &aHole, int aOutline=-1)
 

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

More...
 
int Append (int x, int y, int aOutline=-1, int aHole=-1, bool aAllowDuplication=false)
 

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

More...
 
void Append (const SHAPE_POLY_SET &aSet)
 

Merges polygons from two sets.

More...
 
void Append (const VECTOR2I &aP, int aOutline=-1, int aHole=-1)
 

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

More...
 
void InsertVertex (int aGlobalIndex, VECTOR2I aNewVertex)
 Function InsertVertex Adds a vertex in the globally indexed position aGlobalIndex. More...
 
VECTOR2IVertex (int aIndex, int aOutline, int aHole)
 

Returns the index-th vertex in a given hole outline within a given outline

More...
 
const VECTOR2ICVertex (int aIndex, int aOutline, int aHole) const
 

Returns the index-th vertex in a given hole outline within a given outline

More...
 
VECTOR2IVertex (int aGlobalIndex)
 

Returns the aGlobalIndex-th vertex in the poly set

More...
 
const VECTOR2ICVertex (int aGlobalIndex) const
 

Returns the aGlobalIndex-th vertex in the poly set

More...
 
VECTOR2IVertex (VERTEX_INDEX aIndex)
 

Returns the index-th vertex in a given hole outline within a given outline

More...
 
const VECTOR2ICVertex (VERTEX_INDEX aIndex) const
 

Returns the index-th vertex in a given hole outline within a given outline

More...
 
bool GetNeighbourIndexes (int aGlobalIndex, int *aPrevious, int *aNext)
 Returns 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)
 Function IsPolygonSelfIntersecting. More...
 
bool IsSelfIntersecting ()
 Function IsSelfIntersecting Checks whether any of the polygons in the set is self intersecting. More...
 
unsigned int TriangulatedPolyCount () const
 

Returns the number of triangulated polygons

More...
 
int OutlineCount () const
 

Returns the number of outlines in the set

More...
 
int VertexCount (int aOutline=-1, int aHole=-1) const
 

Returns the number of vertices in a given outline/hole

More...
 
int HoleCount (int aOutline) const
 

Returns the number of holes in a given outline

More...
 
SHAPE_LINE_CHAINOutline (int aIndex)
 

Returns the reference to aIndex-th outline in the set

More...
 
SHAPE_POLY_SET Subset (int aFirstPolygon, int aLastPolygon)
 Function Subset returns a subset of the polygons in this set, the ones between aFirstPolygon and aLastPolygon. More...
 
SHAPE_POLY_SET UnitSet (int aPolygonIndex)
 
SHAPE_LINE_CHAINHole (int aOutline, int aHole)
 

Returns the reference to aHole-th hole in the aIndex-th outline

More...
 
POLYGONPolygon (int aIndex)
 

Returns the aIndex-th subpolygon in the set

More...
 
const POLYGONPolygon (int aIndex) const
 
const TRIANGULATED_POLYGONTriangulatedPolygon (int aIndex) const
 
const SHAPE_LINE_CHAINCOutline (int aIndex) const
 
const SHAPE_LINE_CHAINCHole (int aOutline, int aHole) const
 
const POLYGONCPolygon (int aIndex) const
 
ITERATOR Iterate (int aFirst, int aLast, bool aIterateHoles=false)
 Function Iterate returns an object to iterate through the points of the polygons between aFirst and aLast. More...
 
ITERATOR Iterate (int aOutline)
 Function Iterate. More...
 
ITERATOR IterateWithHoles (int aOutline)
 Function IterateWithHoles. More...
 
ITERATOR Iterate ()
 Function Iterate. More...
 
ITERATOR IterateWithHoles ()
 Function IterateWithHoles. More...
 
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)
 
SEGMENT_ITERATOR IterateSegments (int aFirst, int aLast, bool aIterateHoles=false)
 

Returns an iterator object, for iterating between aFirst and aLast outline, with or

without holes (default: without) More...

 
SEGMENT_ITERATOR IterateSegments (int aPolygonIdx)
 

Returns an iterator object, for iterating aPolygonIdx-th polygon edges

More...
 
SEGMENT_ITERATOR IterateSegments ()
 

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

More...
 
SEGMENT_ITERATOR IterateSegmentsWithHoles ()
 

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

More...
 
SEGMENT_ITERATOR IterateSegmentsWithHoles (int aOutline)
 

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

More...
 
void BooleanAdd (const SHAPE_POLY_SET &b, POLYGON_MODE aFastMode)
 

Performs boolean polyset union For aFastMode meaning, see function booleanOp

More...
 
void BooleanSubtract (const SHAPE_POLY_SET &b, POLYGON_MODE aFastMode)
 

Performs boolean polyset difference For aFastMode meaning, see function booleanOp

More...
 
void BooleanIntersection (const SHAPE_POLY_SET &b, POLYGON_MODE aFastMode)
 

Performs boolean polyset intersection For aFastMode meaning, see function booleanOp

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

Performs boolean polyset union 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)
 

Performs boolean polyset difference 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)
 

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

More...
 
void Inflate (int aFactor, int aCircleSegmentsCount)
 

Performs outline inflation/deflation, using round corners.

More...
 
void Fracture (POLYGON_MODE aFastMode)
 

Converts a set of polygons with holes to a singe outline with "slits"/"fractures" connecting the outer ring to the inner holes For aFastMode meaning, see function booleanOp

More...
 
void Unfracture (POLYGON_MODE aFastMode)
 

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

More...
 
bool HasHoles () const
 

Returns true if the polygon set has any holes.

More...
 
bool HasTouchingHoles () const
 

Returns true if the polygon set has any holes tha share a vertex.

More...
 
void Simplify (POLYGON_MODE aFastMode)
 

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

More...
 
int NormalizeAreaOutlines ()
 Function NormalizeAreaOutlines Convert a self-intersecting polygon to one (or more) non self-intersecting polygon(s) Removes null segments. More...
 
const std::string Format () const override
 
bool Parse (std::stringstream &aStream) override
 
void Move (const VECTOR2I &aVector) override
 
void Rotate (double aAngle, const VECTOR2I &aCenter)
 Function Rotate rotates all vertices by a given angle. More...
 
bool IsSolid () const override
 
const BOX2I BBox (int aClearance=0) const override
 Function BBox() More...
 
bool PointOnEdge (const VECTOR2I &aP) const
 Function PointOnEdge() More...
 
bool Collide (const VECTOR2I &aP, int aClearance=0) const override
 Function Collide Checks whether the point aP collides with the inside of the polygon set; if the point lies on an edge or on a corner of any of the polygons, there is no collision: the edges does not belong to the polygon itself. More...
 
bool Collide (const SEG &aSeg, int aClearance=0) const override
 Function Collide Checks whether the segment aSeg collides with the inside of the polygon set; if the segment touches an edge or a corner of any of the polygons, there is no collision: the edges do not belong to the polygon itself. More...
 
bool CollideVertex (const VECTOR2I &aPoint, VERTEX_INDEX &aClosestVertex, int aClearance=0)
 Function CollideVertex Checks 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)
 Function CollideEdge Checks whether aPoint collides with any edge of any of the contours of the polygon. More...
 
bool Contains (const VECTOR2I &aP, int aSubpolyIndex=-1, bool aIgnoreHoles=false) const
 Returns true if a given subpolygon contains the point aP. More...
 
bool IsEmpty () const
 

Returns true if the set is empty (no polygons at all)

More...
 
void RemoveVertex (int aGlobalIndex)
 Function RemoveVertex deletes the aGlobalIndex-th vertex. More...
 
void RemoveVertex (VERTEX_INDEX aRelativeIndices)
 Function RemoveVertex deletes the vertex indexed by aIndex (index of polygon, contour and vertex). More...
 
void RemoveAllContours ()
 

Removes all outlines & holes (clears) the polygon set.

More...
 
void RemoveContour (int aContourIdx, int aPolygonIdx=-1)
 Function RemoveContour deletes the aContourIdx-th contour of the aPolygonIdx-th polygon in the set. More...
 
int RemoveNullSegments ()
 Function RemoveNullSegments looks for null segments; ie, segments whose ends are exactly the same and deletes them. More...
 
int TotalVertices () const
 

Returns total number of vertices stored in the set.

More...
 
void DeletePolygon (int aIdx)
 

Deletes aIdx-th polygon from the set

More...
 
POLYGON ChamferPolygon (unsigned int aDistance, int aIndex=0)
 Function Chamfer returns a chamfered version of the aIndex-th polygon. More...
 
POLYGON FilletPolygon (unsigned int aRadius, int aErrorMax, int aIndex=0)
 Function Fillet returns a filleted version of the aIndex-th polygon. More...
 
SHAPE_POLY_SET Chamfer (int aDistance)
 Function Chamfer returns a chamfered version of the polygon set. More...
 
SHAPE_POLY_SET Fillet (int aRadius, int aErrorMax)
 Function Fillet returns a filleted version of the polygon set. More...
 
int DistanceToPolygon (VECTOR2I aPoint, int aIndex)
 Function DistanceToPolygon computes the minimum distance between the aIndex-th polygon and aPoint. More...
 
int DistanceToPolygon (SEG aSegment, int aIndex, int aSegmentWidth=0)
 Function DistanceToPolygon computes the minimum distance between the aIndex-th polygon and aSegment with a possible width. More...
 
int Distance (VECTOR2I aPoint)
 Function DistanceToPolygon computes the minimum distance between aPoint and all the polygons in the set. More...
 
int Distance (const SEG &aSegment, int aSegmentWidth=0)
 Function DistanceToPolygon computes the minimum distance between aSegment and all the polygons in the set. More...
 
bool IsVertexInHole (int aGlobalIdx)
 Function IsVertexInHole. More...
 
SHAPE_POLY_SEToperator= (const SHAPE_POLY_SET &)
 
void CacheTriangulation ()
 
bool IsTriangulationUpToDate () const
 
MD5_HASH GetHash () const
 
SHAPE_TYPE Type () const
 Function Type() More...
 
virtual bool Collide (const SHAPE *aShape, int aClearance, VECTOR2I &aMTV) const
 Function Collide() More...
 
virtual bool Collide (const SHAPE *aShape, int aClearance=0) const
 
virtual VECTOR2I Centre () const
 Function Centre() 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 }
 Operations 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< POLYGONPOLYSET
 

Private Member Functions

SHAPE_LINE_CHAINgetContourForCorner (int aCornerId, int &aIndexWithinContour)
 
VECTOR2Ivertex (int aCornerId)
 
const VECTOR2Icvertex (int aCornerId) const
 
void fractureSingle (POLYGON &paths)
 
void unfractureSingle (POLYGON &path)
 
void importTree (ClipperLib::PolyTree *tree)
 
void booleanOp (ClipperLib::ClipType aType, const SHAPE_POLY_SET &aOtherShape, POLYGON_MODE aFastMode)
 Function booleanOp 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 pointInPolygon (const VECTOR2I &aP, const SHAPE_LINE_CHAIN &aPath) const
 
bool containsSingle (const VECTOR2I &aP, int aSubpolyIndex, bool aIgnoreHoles=false) const
 containsSingle function Checks 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=-1)
 Function chamferFilletPolygon Returns the camfered or filleted version of the aIndex-th polygon in the set, depending on the aMode selected. More...
 
bool hasTouchingHoles (const POLYGON &aPoly) const
 

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

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

Class SHAPE_POLY_SET.

Represents 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 56 of file shape_poly_set.h.

Member Typedef Documentation

typedef VECTOR2I::extended_type SHAPE::ecoord
protectedinherited

Definition at line 61 of file shape.h.

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 62 of file shape_poly_set.h.

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

Definition at line 1171 of file shape_poly_set.h.

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.

Member Enumeration Documentation

Operations 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 1143 of file shape_poly_set.h.

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 (theorically) 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 798 of file shape_poly_set.h.

Constructor & Destructor Documentation

SHAPE_POLY_SET::SHAPE_POLY_SET ( )

Definition at line 51 of file shape_poly_set.cpp.

Referenced by Clone(), and Collide().

51  :
53 {
54 }
SHAPE(SHAPE_TYPE aType)
Constructor.
Definition: shape.h:70
simple polygon
Definition: shape.h:48
SHAPE_POLY_SET::SHAPE_POLY_SET ( const SHAPE_POLY_SET aOther,
bool  aDeepCopy = false 
)

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

Parameters
aOtheris the SHAPE_POLY_SET object that will be copied.
aDeepCopyif true, make new copies of the triangulated unique_ptr vector

Definition at line 57 of file shape_poly_set.cpp.

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

57  :
58  SHAPE( SH_POLY_SET ), m_polys( aOther.m_polys )
59 {
60  if( aOther.IsTriangulationUpToDate() )
61  {
62  for( unsigned i = 0; i < aOther.TriangulatedPolyCount(); i++ )
63  m_triangulatedPolys.push_back(
64  std::make_unique<TRIANGULATED_POLYGON>( *aOther.TriangulatedPolygon( i ) ) );
65 
66  m_hash = aOther.GetHash();
67  m_triangulationValid = true;
68  }
69 }
SHAPE(SHAPE_TYPE aType)
Constructor.
Definition: shape.h:70
MD5_HASH GetHash() const
bool IsTriangulationUpToDate() const
std::vector< std::unique_ptr< TRIANGULATED_POLYGON > > m_triangulatedPolys
const TRIANGULATED_POLYGON * TriangulatedPolygon(int aIndex) const
simple polygon
Definition: shape.h:48
unsigned int TriangulatedPolyCount() const
Returns the number of triangulated polygons
size_t i
Definition: json11.cpp:597
SHAPE_POLY_SET::~SHAPE_POLY_SET ( )

Definition at line 72 of file shape_poly_set.cpp.

73 {
74 }

Member Function Documentation

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

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

Definition at line 452 of file shape_poly_set.cpp.

References m_polys.

Referenced by ZONE_CONTAINER::AddPolygon(), and PCB_EDIT_FRAME::End_Zone().

453 {
454  assert( m_polys.size() );
455 
456  if( aOutline < 0 )
457  aOutline += m_polys.size();
458 
459  POLYGON& poly = m_polys[aOutline];
460 
461  assert( poly.size() );
462 
463  poly.push_back( aHole );
464 
465  return poly.size() - 1;
466 }
std::vector< SHAPE_LINE_CHAIN > POLYGON
represents a single polygon outline with holes.
int SHAPE_POLY_SET::AddOutline ( const SHAPE_LINE_CHAIN aOutline)

Adds a new outline to the set and returns its index

Definition at line 438 of file shape_poly_set.cpp.

References SHAPE_LINE_CHAIN::IsClosed(), and m_polys.

Referenced by ZONE_CONTAINER::AddPolygon(), CINFO3D_VISU::buildPadShapePolygon(), Convert_path_polygon_to_polygon_blocks_and_dummy_blocks(), D_PAD::MergePrimitivesAsPolygon(), CPolyLine::NormalizeAreaOutlines(), NormalizeAreaOutlines(), and ZONE_CREATE_HELPER::performZoneCutout().

439 {
440  assert( aOutline.IsClosed() );
441 
442  POLYGON poly;
443 
444  poly.push_back( aOutline );
445 
446  m_polys.push_back( poly );
447 
448  return m_polys.size() - 1;
449 }
std::vector< SHAPE_LINE_CHAIN > POLYGON
represents a single polygon outline with holes.
bool IsClosed() const
Function IsClosed()
int SHAPE_POLY_SET::Append ( int  x,
int  y,
int  aOutline = -1,
int  aHole = -1,
bool  aAllowDuplication = false 
)

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

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

Parameters
xis the x coordinate of the new vertex.
yis the y coordinate of the new vertex.
aOutlineis the index of the polygon.
aHoleis the index of the hole (-1 for the main outline),
aAllowDuplicationis a flag to indicate whether it is allowed to add this corner even if it is duplicated.
Returns
int - the number of corners of the selected contour after the addition.

Definition at line 195 of file shape_poly_set.cpp.

References m_polys.

Referenced by addHoleToPolygon(), D_PAD::AddPrimitive(), addRect(), Append(), ZONE_CONTAINER::AppendCorner(), BuildBoardPolygonOutlines(), D_PAD::buildCustomPadPolygon(), CINFO3D_VISU::buildPadShapePolygon(), D_PAD::BuildPadShapePolygon(), ZONE_FILLER::buildUnconnectedThermalStubsPolygonList(), ZONE_FILLER::buildZoneFeatureHoleList(), DRC::checkClearancePadToPad(), DRC::checkClearanceSegmToPad(), ConvertOutlineToPolygon(), ConvertPolyListToPolySet(), GERBER_DRAW_ITEM::ConvertSegmentToPolygon(), D_CODE::ConvertShapeToPolygon(), CINFO3D_VISU::createNewPadWithClearance(), CreateThermalReliefPadPolygon(), DRC::doFootprintOverlappingDrc(), KIGFX::PCB_PAINTER::draw(), D_PAD::DrawShape(), GERBER_FILE_IMAGE::Execute_DCODE_Command(), GERBER_FILE_IMAGE::Execute_G_Command(), fillArcPOLY(), MODULE::GetBoundingPoly(), getRectangleAlongCentreLine(), InsertVertex(), LEGACY_PLUGIN::loadZONE_CONTAINER(), ZONE_CONTAINER::operator=(), PCB_PARSER::parseZONE_CONTAINER(), DXF_PLOTTER::PlotPoly(), KIGFX::PREVIEW::POLYGON_ITEM::SetPoints(), DRAWSEGMENT::SetPolyPoints(), PNS_KICAD_IFACE::syncPad(), EDA_TEXT::TransformBoundingBoxWithClearanceToPolygon(), TransformCircleToPolygon(), ZONE_CONTAINER::TransformOutlinesShapeWithClearanceToPolygon(), TransformOvalClearanceToPolygon(), TransformRingToPolygon(), TransformRoundedEndsSegmentToPolygon(), TransformRoundRectToPolygon(), DRAWSEGMENT::TransformShapeWithClearanceToPolygon(), D_PAD::TransformShapeWithClearanceToPolygon(), ZONE_CONTAINER::TransformSolidAreasShapesToPolygonSet(), and ZONE_CONTAINER::ZONE_CONTAINER().

196 {
197  if( aOutline < 0 )
198  aOutline += m_polys.size();
199 
200  int idx;
201 
202  if( aHole < 0 )
203  idx = 0;
204  else
205  idx = aHole + 1;
206 
207  assert( aOutline < (int) m_polys.size() );
208  assert( idx < (int) m_polys[aOutline].size() );
209 
210  m_polys[aOutline][idx].Append( x, y, aAllowDuplication );
211 
212  return m_polys[aOutline][idx].PointCount();
213 }
void SHAPE_POLY_SET::Append ( const SHAPE_POLY_SET aSet)

Merges polygons from two sets.

Definition at line 1310 of file shape_poly_set.cpp.

References m_polys.

1311 {
1312  m_polys.insert( m_polys.end(), aSet.m_polys.begin(), aSet.m_polys.end() );
1313 }
void SHAPE_POLY_SET::Append ( const VECTOR2I aP,
int  aOutline = -1,
int  aHole = -1 
)

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

Definition at line 1316 of file shape_poly_set.cpp.

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

1317 {
1318  Append( aP.x, aP.y, aOutline, aHole );
1319 }
int Append(int x, int y, int aOutline=-1, int aHole=-1, bool aAllowDuplication=false)
Appends a vertex at the end of the given outline/hole (default: the last outline) ...
const BOX2I SHAPE_POLY_SET::BBox ( int  aClearance = 0) const
overridevirtual

Function BBox()

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

Parameters
aClearancehow much the bounding box is expanded wrs to the minimum enclosing rectangle for the shape.
Returns
the bounding box.

Implements SHAPE.

Definition at line 1154 of file shape_poly_set.cpp.

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

Referenced by ZONE_FILLER::buildUnconnectedThermalStubsPolygonList(), BOARD::CombineAllAreasInNet(), Convert_path_polygon_to_polygon_blocks_and_dummy_blocks(), D_PAD::GetBestAnchorPosition(), GERBER_DRAW_ITEM::GetBoundingBox(), IsSolid(), BOARD::TestAreaIntersection(), KIGFX::PREVIEW::POLYGON_ITEM::ViewBBox(), and KIGFX::PREVIEW::CENTRELINE_RECT_ITEM::ViewBBox().

1155 {
1156  BOX2I bb;
1157 
1158  for( unsigned i = 0; i < m_polys.size(); i++ )
1159  {
1160  if( i == 0 )
1161  bb = m_polys[i][0].BBox();
1162  else
1163  bb.Merge( m_polys[i][0].BBox() );
1164  }
1165 
1166  bb.Inflate( aClearance );
1167  return bb;
1168 }
BOX2< Vec > & Merge(const BOX2< Vec > &aRect)
Function Merge modifies the position and size of the rectangle in order to contain aRect...
Definition: box2.h:384
BOX2< Vec > & Inflate(coord_type dx, coord_type dy)
Function Inflate inflates the rectangle horizontally by dx and vertically by dy.
Definition: box2.h:300
size_t i
Definition: json11.cpp:597
const BOX2I BBox(int aClearance=0) const override
Function BBox()
void SHAPE_POLY_SET::BooleanAdd ( const SHAPE_POLY_SET b,
POLYGON_MODE  aFastMode 
)

Performs boolean polyset union For aFastMode meaning, see function booleanOp

Definition at line 505 of file shape_poly_set.cpp.

References booleanOp().

Referenced by D_PAD::buildCustomPadPolygon(), BOARD::CombineAreas(), DXF_PLOTTER::PlotPoly(), PlotSolderMaskLayer(), and C3D_RENDER_OGL_LEGACY::reload().

506 {
507  booleanOp( ctUnion, b, aFastMode );
508 }
void booleanOp(ClipperLib::ClipType aType, const SHAPE_POLY_SET &aOtherShape, POLYGON_MODE aFastMode)
Function booleanOp this is the engine to execute all polygon boolean transforms (AND, OR, ...
void SHAPE_POLY_SET::BooleanAdd ( const SHAPE_POLY_SET a,
const SHAPE_POLY_SET b,
POLYGON_MODE  aFastMode 
)

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

Definition at line 523 of file shape_poly_set.cpp.

References booleanOp().

526 {
527  booleanOp( ctUnion, a, b, aFastMode );
528 }
void booleanOp(ClipperLib::ClipType aType, const SHAPE_POLY_SET &aOtherShape, POLYGON_MODE aFastMode)
Function booleanOp this is the engine to execute all polygon boolean transforms (AND, OR, ...
void SHAPE_POLY_SET::BooleanIntersection ( const SHAPE_POLY_SET b,
POLYGON_MODE  aFastMode 
)

Performs boolean polyset intersection For aFastMode meaning, see function booleanOp

Definition at line 517 of file shape_poly_set.cpp.

References booleanOp().

Referenced by Convert_path_polygon_to_polygon_blocks_and_dummy_blocks(), DRC::doFootprintOverlappingDrc(), and TransformOvalClearanceToPolygon().

518 {
519  booleanOp( ctIntersection, b, aFastMode );
520 }
void booleanOp(ClipperLib::ClipType aType, const SHAPE_POLY_SET &aOtherShape, POLYGON_MODE aFastMode)
Function booleanOp this is the engine to execute all polygon boolean transforms (AND, OR, ...
void SHAPE_POLY_SET::BooleanIntersection ( const SHAPE_POLY_SET a,
const SHAPE_POLY_SET b,
POLYGON_MODE  aFastMode 
)

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

Definition at line 539 of file shape_poly_set.cpp.

References booleanOp().

542 {
543  booleanOp( ctIntersection, a, b, aFastMode );
544 }
void booleanOp(ClipperLib::ClipType aType, const SHAPE_POLY_SET &aOtherShape, POLYGON_MODE aFastMode)
Function booleanOp this is the engine to execute all polygon boolean transforms (AND, OR, ...
void SHAPE_POLY_SET::booleanOp ( ClipperLib::ClipType  aType,
const SHAPE_POLY_SET aOtherShape,
POLYGON_MODE  aFastMode 
)
private

Function booleanOp this is the engine to execute all polygon boolean transforms (AND, OR, ...

and polygon simplification (merging overlaping polygons)

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

Definition at line 469 of file shape_poly_set.cpp.

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

471 {
472  booleanOp( aType, *this, aOtherShape, aFastMode );
473 }
void booleanOp(ClipperLib::ClipType aType, const SHAPE_POLY_SET &aOtherShape, POLYGON_MODE aFastMode)
Function booleanOp this is the engine to execute all polygon boolean transforms (AND, OR, ...
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 476 of file shape_poly_set.cpp.

References i, importTree(), m_polys, and PM_STRICTLY_SIMPLE.

480 {
481  Clipper c;
482 
483  c.StrictlySimple( aFastMode == PM_STRICTLY_SIMPLE );
484 
485  for( auto poly : aShape.m_polys )
486  {
487  for( size_t i = 0 ; i < poly.size(); i++ )
488  c.AddPath( poly[i].convertToClipper( i == 0 ), ptSubject, true );
489  }
490 
491  for( auto poly : aOtherShape.m_polys )
492  {
493  for( size_t i = 0; i < poly.size(); i++ )
494  c.AddPath( poly[i].convertToClipper( i == 0 ), ptClip, true );
495  }
496 
497  PolyTree solution;
498 
499  c.Execute( aType, solution, pftNonZero, pftNonZero );
500 
501  importTree( &solution );
502 }
size_t i
Definition: json11.cpp:597
void importTree(ClipperLib::PolyTree *tree)
void SHAPE_POLY_SET::BooleanSubtract ( const SHAPE_POLY_SET b,
POLYGON_MODE  aFastMode 
)

Performs boolean polyset difference For aFastMode meaning, see function booleanOp

Definition at line 511 of file shape_poly_set.cpp.

References booleanOp().

Referenced by addHoleToPolygon(), ZONE_FILLER::computeRawFilledAreas(), MODULE::CoverageRatio(), CreateThermalReliefPadPolygon(), C3D_RENDER_OGL_LEGACY::generate_3D_Vias_and_Pads(), CPolyLine::NormalizeAreaOutlines(), NormalizeAreaOutlines(), and ZONE_CREATE_HELPER::performZoneCutout().

512 {
513  booleanOp( ctDifference, b, aFastMode );
514 }
void booleanOp(ClipperLib::ClipType aType, const SHAPE_POLY_SET &aOtherShape, POLYGON_MODE aFastMode)
Function booleanOp this is the engine to execute all polygon boolean transforms (AND, OR, ...
void SHAPE_POLY_SET::BooleanSubtract ( const SHAPE_POLY_SET a,
const SHAPE_POLY_SET b,
POLYGON_MODE  aFastMode 
)

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

Definition at line 531 of file shape_poly_set.cpp.

References booleanOp().

534 {
535  booleanOp( ctDifference, a, b, aFastMode );
536 }
void booleanOp(ClipperLib::ClipType aType, const SHAPE_POLY_SET &aOtherShape, POLYGON_MODE aFastMode)
Function booleanOp this is the engine to execute all polygon boolean transforms (AND, OR, ...
void SHAPE_POLY_SET::CacheTriangulation ( )

Definition at line 1844 of file shape_poly_set.cpp.

References checksum(), Fracture(), HasHoles(), i, MD5_HASH::IsValid(), m_hash, m_triangulatedPolys, m_triangulationValid, OutlineCount(), PM_FAST, Polygon(), and PolygonTriangulation::TesselatePolygon().

Referenced by ZONE_CONTAINER::CacheTriangulation(), Convert_shape_line_polygon_to_triangles(), and PNS_KICAD_IFACE::syncZone().

1845 {
1846  bool recalculate = !m_hash.IsValid();
1847  MD5_HASH hash;
1848 
1849  if( !m_triangulationValid )
1850  recalculate = true;
1851 
1852  if( !recalculate )
1853  {
1854  hash = checksum();
1855 
1856  if( m_hash != hash )
1857  {
1858  m_hash = hash;
1859  recalculate = true;
1860  }
1861  }
1862 
1863  if( !recalculate )
1864  return;
1865 
1866  SHAPE_POLY_SET tmpSet = *this;
1867 
1868  if( tmpSet.HasHoles() )
1869  tmpSet.Fracture( PM_FAST );
1870 
1871  m_triangulatedPolys.clear();
1872 
1873  for( int i = 0; i < tmpSet.OutlineCount(); i++ )
1874  {
1875  m_triangulatedPolys.push_back( std::make_unique<TRIANGULATED_POLYGON>() );
1876  PolygonTriangulation tess( *m_triangulatedPolys.back() );
1877 
1878  tess.TesselatePolygon( tmpSet.Polygon( i ).front() );
1879  }
1880 
1881  m_triangulationValid = true;
1882  m_hash = checksum();
1883 }
bool HasHoles() const
Returns true if the polygon set has any holes.
MD5_HASH checksum() const
void TesselatePolygon(const SHAPE_LINE_CHAIN &aPoly)
int OutlineCount() const
Returns the number of outlines in the set
std::vector< std::unique_ptr< TRIANGULATED_POLYGON > > m_triangulatedPolys
Class SHAPE_POLY_SET.
void Fracture(POLYGON_MODE aFastMode)
Converts a set of polygons with holes to a singe outline with "slits"/"fractures" connecting the oute...
bool IsValid() const
Definition: md5_hash.h:23
size_t i
Definition: json11.cpp:597
POLYGON & Polygon(int aIndex)
Returns the aIndex-th subpolygon in the set
virtual VECTOR2I SHAPE::Centre ( ) const
inlinevirtualinherited

Function Centre()

Computes a center-of-mass of the shape

Returns
the center-of-mass point

Definition at line 151 of file shape.h.

References SHAPE::BBox(), BOX2< Vec >::Centre(), SHAPE::Format(), SHAPE::IsSolid(), SHAPE::Move(), and SHAPE::Parse().

152  {
153  return BBox( 0 ).Centre(); // if nothing better is available....
154  }
virtual const BOX2I BBox(int aClearance=0) const =0
Function BBox()
Vec Centre() const
Definition: box2.h:77
SHAPE_POLY_SET SHAPE_POLY_SET::Chamfer ( int  aDistance)

Function Chamfer returns a chamfered version of the polygon set.

Parameters
aDistanceis the chamfering distance.
Returns
SHAPE_POLY_SET - A set containing the chamfered version of this set.

Definition at line 1624 of file shape_poly_set.cpp.

References ChamferPolygon(), and m_polys.

Referenced by ZONE_CONTAINER::BuildSmoothedPoly(), and IsEmpty().

1625 {
1626  SHAPE_POLY_SET chamfered;
1627 
1628  for( unsigned int polygonIdx = 0; polygonIdx < m_polys.size(); polygonIdx++ )
1629  chamfered.m_polys.push_back( ChamferPolygon( aDistance, polygonIdx ) );
1630 
1631  return chamfered;
1632 }
POLYGON ChamferPolygon(unsigned int aDistance, int aIndex=0)
Function Chamfer returns a chamfered version of the aIndex-th polygon.
Class SHAPE_POLY_SET.
SHAPE_POLY_SET::POLYGON SHAPE_POLY_SET::chamferFilletPolygon ( CORNER_MODE  aMode,
unsigned int  aDistance,
int  aIndex,
int  aErrorMax = -1 
)
private

Function chamferFilletPolygon Returns the camfered or filleted version of the aIndex-th polygon in the set, depending on the aMode selected.

Parameters
aModerepresent 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.
aDistanceis the chamfering distance if aMode = CHAMFERED; if aMode = FILLETED, is the filleting radius.
aIndexis the index of the polygon that will be chamfered/filleted.
aErrorMaxis the maximum allowable deviation of the polygon from the circle if aMode = FILLETED. If aMode = CHAMFERED, it is unused.
Returns
POLYGON - the chamfered/filleted version of the polygon.

Definition at line 1646 of file shape_poly_set.cpp.

References SHAPE_LINE_CHAIN::Append(), GetArcToSegmentCount(), SHAPE_LINE_CHAIN::Point(), Polygon(), RemoveNullSegments(), round_nearest(), SHAPE_LINE_CHAIN::SetClosed(), and VECTOR2< T >::x.

Referenced by ChamferPolygon(), and FilletPolygon().

1650 {
1651  // Null segments create serious issues in calculations. Remove them:
1653 
1654  SHAPE_POLY_SET::POLYGON currentPoly = Polygon( aIndex );
1655  SHAPE_POLY_SET::POLYGON newPoly;
1656 
1657  // If the chamfering distance is zero, then the polygon remain intact.
1658  if( aDistance == 0 )
1659  {
1660  return currentPoly;
1661  }
1662 
1663  // Iterate through all the contours (outline and holes) of the polygon.
1664  for( SHAPE_LINE_CHAIN& currContour : currentPoly )
1665  {
1666  // Generate a new contour in the new polygon
1667  SHAPE_LINE_CHAIN newContour;
1668 
1669  // Iterate through the vertices of the contour
1670  for( int currVertex = 0; currVertex < currContour.PointCount(); currVertex++ )
1671  {
1672  // Current vertex
1673  int x1 = currContour.Point( currVertex ).x;
1674  int y1 = currContour.Point( currVertex ).y;
1675 
1676  // Indices for previous and next vertices.
1677  int prevVertex;
1678  int nextVertex;
1679 
1680  // Previous and next vertices indices computation. Necessary to manage the edge cases.
1681 
1682  // Previous vertex is the last one if the current vertex is the first one
1683  prevVertex = currVertex == 0 ? currContour.PointCount() - 1 : currVertex - 1;
1684 
1685  // next vertex is the first one if the current vertex is the last one.
1686  nextVertex = currVertex == currContour.PointCount() - 1 ? 0 : currVertex + 1;
1687 
1688  // Previous vertex computation
1689  double xa = currContour.Point( prevVertex ).x - x1;
1690  double ya = currContour.Point( prevVertex ).y - y1;
1691 
1692  // Next vertex computation
1693  double xb = currContour.Point( nextVertex ).x - x1;
1694  double yb = currContour.Point( nextVertex ).y - y1;
1695 
1696  // Compute the new distances
1697  double lena = hypot( xa, ya );
1698  double lenb = hypot( xb, yb );
1699 
1700  // Make the final computations depending on the mode selected, chamfered or filleted.
1701  if( aMode == CORNER_MODE::CHAMFERED )
1702  {
1703  double distance = aDistance;
1704 
1705  // Chamfer one half of an edge at most
1706  if( 0.5 * lena < distance )
1707  distance = 0.5 * lena;
1708 
1709  if( 0.5 * lenb < distance )
1710  distance = 0.5 * lenb;
1711 
1712  int nx1 = round_nearest( distance * xa / lena );
1713  int ny1 = round_nearest( distance * ya / lena );
1714 
1715  newContour.Append( x1 + nx1, y1 + ny1 );
1716 
1717  int nx2 = round_nearest( distance * xb / lenb );
1718  int ny2 = round_nearest( distance * yb / lenb );
1719 
1720  newContour.Append( x1 + nx2, y1 + ny2 );
1721  }
1722  else // CORNER_MODE = FILLETED
1723  {
1724  double cosine = ( xa * xb + ya * yb ) / ( lena * lenb );
1725 
1726  double radius = aDistance;
1727  double denom = sqrt( 2.0 / ( 1 + cosine ) - 1 );
1728 
1729  // Do nothing in case of parallel edges
1730  if( std::isinf( denom ) )
1731  continue;
1732 
1733  // Limit rounding distance to one half of an edge
1734  if( 0.5 * lena * denom < radius )
1735  radius = 0.5 * lena * denom;
1736 
1737  if( 0.5 * lenb * denom < radius )
1738  radius = 0.5 * lenb * denom;
1739 
1740  // Calculate fillet arc absolute center point (xc, yx)
1741  double k = radius / sqrt( .5 * ( 1 - cosine ) );
1742  double lenab = sqrt( ( xa / lena + xb / lenb ) * ( xa / lena + xb / lenb ) +
1743  ( ya / lena + yb / lenb ) * ( ya / lena + yb / lenb ) );
1744  double xc = x1 + k * ( xa / lena + xb / lenb ) / lenab;
1745  double yc = y1 + k * ( ya / lena + yb / lenb ) / lenab;
1746 
1747  // Calculate arc start and end vectors
1748  k = radius / sqrt( 2 / ( 1 + cosine ) - 1 );
1749  double xs = x1 + k * xa / lena - xc;
1750  double ys = y1 + k * ya / lena - yc;
1751  double xe = x1 + k * xb / lenb - xc;
1752  double ye = y1 + k * yb / lenb - yc;
1753 
1754  // Cosine of arc angle
1755  double argument = ( xs * xe + ys * ye ) / ( radius * radius );
1756 
1757  // Make sure the argument is in [-1,1], interval in which the acos function is
1758  // defined
1759  if( argument < -1 )
1760  argument = -1;
1761  else if( argument > 1 )
1762  argument = 1;
1763 
1764  double arcAngle = acos( argument );
1765  double arcAngleDegrees = arcAngle * 180.0 / M_PI;
1766  int segments = GetArcToSegmentCount( radius, aErrorMax, arcAngleDegrees );
1767 
1768  double deltaAngle = arcAngle / segments;
1769  double startAngle = atan2( -ys, xs );
1770 
1771  // Flip arc for inner corners
1772  if( xa * yb - ya * xb <= 0 )
1773  deltaAngle *= -1;
1774 
1775  double nx = xc + xs;
1776  double ny = yc + ys;
1777 
1778  newContour.Append( round_nearest( nx ), round_nearest( ny ) );
1779 
1780  // Store the previous added corner to make a sanity check
1781  int prevX = round_nearest( nx );
1782  int prevY = round_nearest( ny );
1783 
1784  for( int j = 0; j < segments; j++ )
1785  {
1786  nx = xc + cos( startAngle + ( j + 1 ) * deltaAngle ) * radius;
1787  ny = yc - sin( startAngle + ( j + 1 ) * deltaAngle ) * radius;
1788 
1789  // Sanity check: the rounding can produce repeated corners; do not add them.
1790  if( round_nearest( nx ) != prevX || round_nearest( ny ) != prevY )
1791  {
1792  newContour.Append( round_nearest( nx ), round_nearest( ny ) );
1793  prevX = round_nearest( nx );
1794  prevY = round_nearest( ny );
1795  }
1796  }
1797  }
1798  }
1799 
1800  // Close the current contour and add it the new polygon
1801  newContour.SetClosed( true );
1802  newPoly.push_back( newContour );
1803  }
1804 
1805  return newPoly;
1806 }
std::vector< SHAPE_LINE_CHAIN > POLYGON
represents a single polygon outline with holes.
int GetArcToSegmentCount(int aRadius, int aErrorMax, double aArcAngleDegree)
static int round_nearest(double v)
Definition: math_util.h:56
void Append(int aX, int aY, bool aAllowDuplication=false)
Function Append()
void SetClosed(bool aClosed)
Function SetClosed()
int RemoveNullSegments()
Function RemoveNullSegments looks for null segments; ie, segments whose ends are exactly the same and...
Class SHAPE_LINE_CHAIN.
VECTOR2I & Point(int aIndex)
Function Point()
POLYGON & Polygon(int aIndex)
Returns the aIndex-th subpolygon in the set
SHAPE_POLY_SET::POLYGON SHAPE_POLY_SET::ChamferPolygon ( unsigned int  aDistance,
int  aIndex = 0 
)

Function Chamfer returns a chamfered version of the aIndex-th polygon.

Parameters
aDistanceis the chamfering distance.
aIndexis the index of the polygon to be chamfered.
Returns
POLYGON - A polygon containing the chamfered version of the aIndex-th polygon.

Definition at line 1500 of file shape_poly_set.cpp.

References chamferFilletPolygon().

Referenced by Chamfer(), and IsEmpty().

1501 {
1502  return chamferFilletPolygon( CORNER_MODE::CHAMFERED, aDistance, aIndex );
1503 }
POLYGON chamferFilletPolygon(CORNER_MODE aMode, unsigned int aDistance, int aIndex, int aErrorMax=-1)
Function chamferFilletPolygon Returns the camfered or filleted version of the aIndex-th polygon in th...
MD5_HASH SHAPE_POLY_SET::checksum ( ) const
private

Definition at line 1886 of file shape_poly_set.cpp.

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

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

1887 {
1888  MD5_HASH hash;
1889 
1890  hash.Hash( m_polys.size() );
1891 
1892  for( const auto& outline : m_polys )
1893  {
1894  hash.Hash( outline.size() );
1895 
1896  for( const auto& lc : outline )
1897  {
1898  hash.Hash( lc.PointCount() );
1899 
1900  for( int i = 0; i < lc.PointCount(); i++ )
1901  {
1902  hash.Hash( lc.CPoint( i ).x );
1903  hash.Hash( lc.CPoint( i ).y );
1904  }
1905  }
1906  }
1907 
1908  hash.Finalize();
1909 
1910  return hash;
1911 }
void Hash(uint8_t *data, uint32_t length)
Definition: md5_hash.cpp:66
size_t i
Definition: json11.cpp:597
void Finalize()
Definition: md5_hash.cpp:76
const SHAPE_LINE_CHAIN& SHAPE_POLY_SET::CHole ( int  aOutline,
int  aHole 
) const
inline

Definition at line 621 of file shape_poly_set.h.

References m_polys.

Referenced by CINFO3D_VISU::AddSolidAreasShapesToContainer(), CLAYER_TRIANGLES::AddToMiddleContourns(), containsSingle(), KIGFX::PCB_PAINTER::draw(), and PlotLayerOutlines().

622  {
623  return m_polys[aOutline][aHole + 1];
624  }
CONST_ITERATOR SHAPE_POLY_SET::CIterate ( int  aFirst,
int  aLast,
bool  aIterateHoles = false 
) const
inline

Definition at line 698 of file shape_poly_set.h.

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 D_PAD::AddPrimitive(), DRAWSEGMENT::BuildPolyPointsList(), EDGE_MODULE::Draw(), PCB_IO::format(), DRAWSEGMENT::GetBoundingBox(), BRDITEMS_PLOTTER::PlotFilledAreas(), and PNS_KICAD_IFACE::syncPad().

699  {
700  CONST_ITERATOR iter;
701 
702  iter.m_poly = const_cast<SHAPE_POLY_SET*>( this );
703  iter.m_currentPolygon = aFirst;
704  iter.m_lastPolygon = aLast < 0 ? OutlineCount() - 1 : aLast;
705  iter.m_currentContour = 0;
706  iter.m_currentVertex = 0;
707  iter.m_iterateHoles = aIterateHoles;
708 
709  return iter;
710  }
int OutlineCount() const
Returns the number of outlines in the set
Class SHAPE_POLY_SET.
ITERATOR_TEMPLATE< const VECTOR2I > CONST_ITERATOR
CONST_ITERATOR SHAPE_POLY_SET::CIterate ( int  aOutline) const
inline

Definition at line 712 of file shape_poly_set.h.

References CIterate().

713  {
714  return CIterate( aOutline, aOutline );
715  }
CONST_ITERATOR CIterate() const
CONST_ITERATOR SHAPE_POLY_SET::CIterate ( ) const
inline

Definition at line 722 of file shape_poly_set.h.

References OutlineCount().

Referenced by CIterate(), and CIterateWithHoles().

723  {
724  return CIterate( 0, OutlineCount() - 1 );
725  }
CONST_ITERATOR CIterate() const
int OutlineCount() const
Returns the number of outlines in the set
CONST_ITERATOR SHAPE_POLY_SET::CIterateWithHoles ( int  aOutline) const
inline

Definition at line 717 of file shape_poly_set.h.

References CIterate().

Referenced by EDIT_POINTS_FACTORY::buildForPolyOutline(), ZONE_CONTAINER::CIterateWithHoles(), and GRID_HELPER::computeAnchors().

718  {
719  return CIterate( aOutline, aOutline, true );
720  }
CONST_ITERATOR CIterate() const
CONST_ITERATOR SHAPE_POLY_SET::CIterateWithHoles ( ) const
inline

Definition at line 727 of file shape_poly_set.h.

References CIterate(), and OutlineCount().

728  {
729  return CIterate( 0, OutlineCount() - 1, true );
730  }
CONST_ITERATOR CIterate() const
int OutlineCount() const
Returns the number of outlines in the set
SHAPE * SHAPE_POLY_SET::Clone ( ) const
overridevirtual

Function Clone()

Returns a dynamically allocated copy of the shape

Return values
copyof the shape

Reimplemented from SHAPE.

Definition at line 77 of file shape_poly_set.cpp.

References SHAPE_POLY_SET().

78 {
79  return new SHAPE_POLY_SET( *this );
80 }
bool SHAPE::Collide ( const SHAPE aShape,
int  aClearance,
VECTOR2I aMTV 
) const
virtualinherited

Function Collide()

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

Parameters
aShapeshape to check collision against
aClearanceminimum clearance
aMTVminimum translation vector
Returns
true, if there is a collision.

Definition at line 545 of file shape_collisions.cpp.

References CollideShapes().

546 {
547  return CollideShapes( this, aShape, aClearance, true, aMTV );
548 }
bool CollideShapes(const SHAPE *aA, const SHAPE *aB, int aClearance, bool aNeedMTV, VECTOR2I &aMTV)
bool SHAPE::Collide ( const SHAPE aShape,
int  aClearance = 0 
) const
virtualinherited

Definition at line 551 of file shape_collisions.cpp.

References CollideShapes(), and dummy().

552 {
553  VECTOR2I dummy;
554 
555  return CollideShapes( this, aShape, aClearance, false, dummy );
556 }
Class VECTOR2 defines a general 2D-vector/point.
Definition: vector2d.h:61
static LIB_PART * dummy()
Used when a LIB_PART is not found in library to draw a dummy shape This component is a 400 mils squar...
bool CollideShapes(const SHAPE *aA, const SHAPE *aB, int aClearance, bool aNeedMTV, VECTOR2I &aMTV)
bool SHAPE_POLY_SET::Collide ( const VECTOR2I aP,
int  aClearance = 0 
) const
overridevirtual

Function Collide Checks whether the point aP collides with the inside of the polygon set; if the point lies on an edge or on a corner of any of the polygons, there is no collision: the edges does not belong to the polygon itself.

Parameters
aPis the VECTOR2I point whose collision with respect to the poly set will be tested.
aClearanceis the security distance; if the point lies closer to the polygon than aClearance distance, then there is a collision.
Returns
bool - true if the point aP collides with the polygon; false in any other case.

Reimplemented from SHAPE.

Definition at line 1219 of file shape_poly_set.cpp.

References Contains(), Inflate(), and SHAPE_POLY_SET().

Referenced by DRAWSEGMENT::HitTest(), and IsSolid().

1220 {
1221  SHAPE_POLY_SET polySet = SHAPE_POLY_SET( *this );
1222 
1223  // Inflate the polygon if necessary.
1224  if( aClearance > 0 )
1225  {
1226  // fixme: the number of arc segments should not be hardcoded
1227  polySet.Inflate( aClearance, 8 );
1228  }
1229 
1230  // There is a collision if and only if the point is inside of the polygon.
1231  return polySet.Contains( aP );
1232 }
bool Contains(const VECTOR2I &aP, int aSubpolyIndex=-1, bool aIgnoreHoles=false) const
Returns true if a given subpolygon contains the point aP.
void Inflate(int aFactor, int aCircleSegmentsCount)
Performs outline inflation/deflation, using round corners.
Class SHAPE_POLY_SET.
bool SHAPE_POLY_SET::Collide ( const SEG aSeg,
int  aClearance = 0 
) const
overridevirtual

Function Collide Checks whether the segment aSeg collides with the inside of the polygon set; if the segment touches an edge or a corner of any of the polygons, there is no collision: the edges do not belong to the polygon itself.

Parameters
aSegis the SEG segment whose collision with respect to the poly set will be tested.
aClearanceis the security distance; if the segment passes closer to the polygon than aClearance distance, then there is a collision.
Returns
bool - true if the segment aSeg collides with the polygon; false in any other case.

Implements SHAPE.

Definition at line 1188 of file shape_poly_set.cpp.

References SEG::A, Contains(), Inflate(), SEG::Intersect(), IterateSegmentsWithHoles(), and SHAPE_POLY_SET().

1189 {
1190 
1191  SHAPE_POLY_SET polySet = SHAPE_POLY_SET( *this );
1192 
1193  // Inflate the polygon if necessary.
1194  if( aClearance > 0 )
1195  {
1196  // fixme: the number of arc segments should not be hardcoded
1197  polySet.Inflate( aClearance, 8 );
1198  }
1199 
1200  // We are going to check to see if the segment crosses an external
1201  // boundary. However, if the full segment is inside the polyset, this
1202  // will not be true. So we first test to see if one of the points is
1203  // inside. If true, then we collide
1204  if( polySet.Contains( aSeg.A ) )
1205  return true;
1206 
1207  for( SEGMENT_ITERATOR iterator = polySet.IterateSegmentsWithHoles(); iterator; iterator++ )
1208  {
1209  SEG polygonEdge = *iterator;
1210 
1211  if( polygonEdge.Intersect( aSeg, true ) )
1212  return true;
1213  }
1214 
1215  return false;
1216 }
SEGMENT_ITERATOR IterateSegmentsWithHoles()
Returns an iterator object, for all outlines in the set (with holes)
SEGMENT_ITERATOR_TEMPLATE< SEG > SEGMENT_ITERATOR
bool Contains(const VECTOR2I &aP, int aSubpolyIndex=-1, bool aIgnoreHoles=false) const
Returns true if a given subpolygon contains the point aP.
OPT_VECTOR2I Intersect(const SEG &aSeg, bool aIgnoreEndpoints=false, bool aLines=false) const
Function Intersect()
Definition: seg.cpp:99
void Inflate(int aFactor, int aCircleSegmentsCount)
Performs outline inflation/deflation, using round corners.
Class SHAPE_POLY_SET.
Definition: seg.h:36
VECTOR2I A
Definition: seg.h:46
bool SHAPE_POLY_SET::CollideEdge ( const VECTOR2I aPoint,
SHAPE_POLY_SET::VERTEX_INDEX aClosestVertex,
int  aClearance = 0 
)

Function CollideEdge Checks whether aPoint collides with any edge of any of the contours of the polygon.

Parameters
aPointis the VECTOR2I point whose collision with respect to the polygon will be tested.
aClearanceis the security distance; if aPoint lies closer to a vertex than aClearance distance, then there is a collision.
aClosestVertexis the index of the closes vertex to aPoint.
Returns
bool - true if there is a collision, false in any other case.

Definition at line 1360 of file shape_poly_set.cpp.

References SEG::Distance(), SHAPE_POLY_SET::SEGMENT_ITERATOR_TEMPLATE< T >::GetIndex(), and IterateSegmentsWithHoles().

Referenced by ZONE_CONTAINER::HitTestForEdge(), and IsSolid().

1362 {
1363  // Shows whether there was a collision
1364  bool collision = false;
1365 
1366  SEGMENT_ITERATOR iterator;
1367 
1368  for( iterator = IterateSegmentsWithHoles(); iterator; iterator++ )
1369  {
1370  SEG currentSegment = *iterator;
1371  int distance = currentSegment.Distance( aPoint );
1372 
1373  // Check for collisions
1374  if( distance <= aClearance )
1375  {
1376  collision = true;
1377 
1378  // Update aClearance to look for closer edges
1379  aClearance = distance;
1380 
1381  // Store the indices that identify the vertex
1382  aClosestVertex = iterator.GetIndex();
1383  }
1384  }
1385 
1386  return collision;
1387 }
SEGMENT_ITERATOR IterateSegmentsWithHoles()
Returns an iterator object, for all outlines in the set (with holes)
SEGMENT_ITERATOR_TEMPLATE< SEG > SEGMENT_ITERATOR
Definition: seg.h:36
int Distance(const SEG &aSeg) const
Function Distance()
Definition: seg.h:195
bool SHAPE_POLY_SET::CollideVertex ( const VECTOR2I aPoint,
SHAPE_POLY_SET::VERTEX_INDEX aClosestVertex,
int  aClearance = 0 
)

Function CollideVertex Checks whether aPoint collides with any vertex of any of the contours of the polygon.

Parameters
aPointis the VECTOR2I point whose collision with respect to the polygon will be tested.
aClearanceis the security distance; if aPoint lies closer to a vertex than aClearance distance, then there is a collision.
aClosestVertexis the index of the closes vertex to aPoint.
Returns
bool - true if there is a collision, false in any other case.

Definition at line 1322 of file shape_poly_set.cpp.

References delta, VECTOR2< T >::EuclideanNorm(), and IterateWithHoles().

Referenced by ZONE_CONTAINER::HitTestForCorner(), and IsSolid().

1324 {
1325  // Shows whether there was a collision
1326  bool collision = false;
1327 
1328  // Difference vector between each vertex and aPoint.
1329  VECTOR2D delta;
1330  double distance, clearance;
1331 
1332  // Convert clearance to double for precission when comparing distances
1333  clearance = aClearance;
1334 
1335  for( ITERATOR iterator = IterateWithHoles(); iterator; iterator++ )
1336  {
1337  // Get the difference vector between current vertex and aPoint
1338  delta = *iterator - aPoint;
1339 
1340  // Compute distance
1341  distance = delta.EuclideanNorm();
1342 
1343  // Check for collisions
1344  if( distance <= clearance )
1345  {
1346  collision = true;
1347 
1348  // Update aClearance to look for closer vertices
1349  clearance = distance;
1350 
1351  // Store the indices that identify the vertex
1352  aClosestVertex = iterator.GetIndex();
1353  }
1354  }
1355 
1356  return collision;
1357 }
static const int delta[8][2]
Definition: solve.cpp:112
T EuclideanNorm() const
Destructor.
Definition: vector2d.h:292
ITERATOR_TEMPLATE< VECTOR2I > ITERATOR
ITERATOR IterateWithHoles()
Function IterateWithHoles.
bool SHAPE_POLY_SET::Contains ( const VECTOR2I aP,
int  aSubpolyIndex = -1,
bool  aIgnoreHoles = false 
) const

Returns true if a given subpolygon contains the point aP.

Parameters
aPis the point to check
aSubpolyIndexis the subpolygon to check, or -1 to check all
aIgnoreHolescontrols whether or not internal holes are considered
Returns
true if the polygon contains the point

Definition at line 1390 of file shape_poly_set.cpp.

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

Referenced by ZONE_FILLER::buildUnconnectedThermalStubsPolygonList(), Collide(), DRC::doEdgeZoneDrc(), D_PAD::GetBestAnchorPosition(), GERBER_DRAW_ITEM::HitTest(), ZONE_CONTAINER::HitTestFilledArea(), ZONE_CONTAINER::HitTestInsideZone(), IsSolid(), and BOARD::TestAreaIntersection().

1391 {
1392  if( m_polys.size() == 0 ) // empty set?
1393  return false;
1394 
1395  // If there is a polygon specified, check the condition against that polygon
1396  if( aSubpolyIndex >= 0 )
1397  return containsSingle( aP, aSubpolyIndex, aIgnoreHoles );
1398 
1399  // In any other case, check it against all polygons in the set
1400  for( int polygonIdx = 0; polygonIdx < OutlineCount(); polygonIdx++ )
1401  {
1402  if( containsSingle( aP, polygonIdx, aIgnoreHoles ) )
1403  return true;
1404  }
1405 
1406  return false;
1407 }
int OutlineCount() const
Returns the number of outlines in the set
bool containsSingle(const VECTOR2I &aP, int aSubpolyIndex, bool aIgnoreHoles=false) const
containsSingle function Checks whether the point aP is inside the aSubpolyIndex-th polygon of the pol...
bool SHAPE_POLY_SET::containsSingle ( const VECTOR2I aP,
int  aSubpolyIndex,
bool  aIgnoreHoles = false 
) const
private

containsSingle function Checks 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
aPis the VECTOR2I point whose position with respect to the inside of the aSubpolyIndex-th polygon will be tested.
aSubpolyIndexis an integer specifying which polygon in the set has to be checked.
aIgnoreHolescan be set to true to ignore internal holes in the polygon
Returns
bool - true if aP is inside aSubpolyIndex-th polygon; false in any other case.

Definition at line 1428 of file shape_poly_set.cpp.

References CHole(), HoleCount(), m_polys, pointInPolygon(), and SHAPE_LINE_CHAIN::PointOnEdge().

Referenced by Contains(), DistanceToPolygon(), and IsEmpty().

1429 {
1430  // Check that the point is inside the outline
1431  if( pointInPolygon( aP, m_polys[aSubpolyIndex][0] ) )
1432  {
1433  if( !aIgnoreHoles )
1434  {
1435  // Check that the point is not in any of the holes
1436  for( int holeIdx = 0; holeIdx < HoleCount( aSubpolyIndex ); holeIdx++ )
1437  {
1438  const SHAPE_LINE_CHAIN hole = CHole( aSubpolyIndex, holeIdx );
1439 
1440  // If the point is inside a hole (and not on its edge),
1441  // it is outside of the polygon
1442  if( pointInPolygon( aP, hole ) && !hole.PointOnEdge( aP ) )
1443  return false;
1444  }
1445  }
1446 
1447  return true;
1448  }
1449 
1450  return false;
1451 }
bool PointOnEdge(const VECTOR2I &aP) const
Function PointOnEdge()
int HoleCount(int aOutline) const
Returns the number of holes in a given outline
const SHAPE_LINE_CHAIN & CHole(int aOutline, int aHole) const
bool pointInPolygon(const VECTOR2I &aP, const SHAPE_LINE_CHAIN &aPath) const
Class SHAPE_LINE_CHAIN.
const POLYGON& SHAPE_POLY_SET::CPolygon ( int  aIndex) const
inline
const VECTOR2I & SHAPE_POLY_SET::CVertex ( int  aIndex,
int  aOutline,
int  aHole 
) const

Returns the index-th vertex in a given hole outline within a given outline

Definition at line 297 of file shape_poly_set.cpp.

References m_polys.

Referenced by CVertex(), ZONE_CONTAINER::GetCornerPosition(), DRAWSEGMENT::GetPosition(), DRAWSEGMENT::HitTest(), and POINT_EDITOR::updatePoints().

298 {
299  if( aOutline < 0 )
300  aOutline += m_polys.size();
301 
302  int idx;
303 
304  if( aHole < 0 )
305  idx = 0;
306  else
307  idx = aHole + 1;
308 
309  assert( aOutline < (int) m_polys.size() );
310  assert( idx < (int) m_polys[aOutline].size() );
311 
312  return m_polys[aOutline][idx].CPoint( aIndex );
313 }
const VECTOR2I & SHAPE_POLY_SET::CVertex ( int  aGlobalIndex) const

Returns the aGlobalIndex-th vertex in the poly set

Definition at line 328 of file shape_poly_set.cpp.

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.

329 {
331 
332  // Assure the passed index references a legal position; abort otherwise
333  if( !GetRelativeIndices( aGlobalIndex, &index ) )
334  throw( std::out_of_range( "aGlobalIndex-th vertex does not exist" ) );
335 
336  return m_polys[index.m_polygon][index.m_contour].CPoint( index.m_vertex );
337 }
Struct VERTEX_INDEX.
bool GetRelativeIndices(int aGlobalIdx, VERTEX_INDEX *aRelativeIndices) const
Function GetRelativeIndices.
const VECTOR2I & SHAPE_POLY_SET::CVertex ( SHAPE_POLY_SET::VERTEX_INDEX  index) const

Returns the index-th vertex in a given hole outline within a given outline

Definition at line 346 of file shape_poly_set.cpp.

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

347 {
348  return CVertex( index.m_vertex, index.m_polygon, index.m_contour - 1 );
349 }
const VECTOR2I & CVertex(int aIndex, int aOutline, int aHole) const
Returns the index-th vertex in a given hole outline within a given outline
const VECTOR2I& SHAPE_POLY_SET::cvertex ( int  aCornerId) const
private

Referenced by IsEmpty().

void SHAPE_POLY_SET::DeletePolygon ( int  aIdx)

Deletes aIdx-th polygon from the set

Definition at line 1304 of file shape_poly_set.cpp.

References m_polys.

Referenced by ZONE_FILLER::Fill(), and IsEmpty().

1305 {
1306  m_polys.erase( m_polys.begin() + aIdx );
1307 }
int SHAPE_POLY_SET::Distance ( VECTOR2I  aPoint)

Function DistanceToPolygon computes the minimum distance between aPoint and all the polygons in the set.

Parameters
aPointis the point whose distance to the set has to be measured.
Returns
int - The minimum distance 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 1575 of file shape_poly_set.cpp.

References DistanceToPolygon(), and m_polys.

Referenced by DRC::doTrackDrc(), DRC::doTrackKeepoutDrc(), IsEmpty(), DRC::newMarker(), DRC::testCopperDrawItem(), DRC::testCopperTextItem(), and DRC::testKeepoutAreas().

1576 {
1577  int currentDistance;
1578  int minDistance = DistanceToPolygon( aPoint, 0 );
1579 
1580  // Iterate through all the polygons and get the minimum distance.
1581  for( unsigned int polygonIdx = 1; polygonIdx < m_polys.size(); polygonIdx++ )
1582  {
1583  currentDistance = DistanceToPolygon( aPoint, polygonIdx );
1584 
1585  if( currentDistance < minDistance )
1586  minDistance = currentDistance;
1587  }
1588 
1589  return minDistance;
1590 }
int DistanceToPolygon(VECTOR2I aPoint, int aIndex)
Function DistanceToPolygon computes the minimum distance between the aIndex-th polygon and aPoint...
int SHAPE_POLY_SET::Distance ( const SEG aSegment,
int  aSegmentWidth = 0 
)

Function DistanceToPolygon computes the minimum distance between aSegment and all the polygons in the set.

Parameters
aSegmentis the segment whose distance to the polygon set has to be measured.
aSegmentWidthis the width of the segment; defaults to zero.
Returns
int - The minimum distance between aSegment and all the polygons in the set. If the point is contained in the polygon, the distance is zero.

Definition at line 1593 of file shape_poly_set.cpp.

References DistanceToPolygon(), and m_polys.

1594 {
1595  int currentDistance;
1596  int minDistance = DistanceToPolygon( aSegment, 0 );
1597 
1598  // Iterate through all the polygons and get the minimum distance.
1599  for( unsigned int polygonIdx = 1; polygonIdx < m_polys.size(); polygonIdx++ )
1600  {
1601  currentDistance = DistanceToPolygon( aSegment, polygonIdx, aSegmentWidth );
1602 
1603  if( currentDistance < minDistance )
1604  minDistance = currentDistance;
1605  }
1606 
1607  return minDistance;
1608 }
int DistanceToPolygon(VECTOR2I aPoint, int aIndex)
Function DistanceToPolygon computes the minimum distance between the aIndex-th polygon and aPoint...
int SHAPE_POLY_SET::DistanceToPolygon ( VECTOR2I  aPoint,
int  aIndex 
)

Function DistanceToPolygon computes the minimum distance between the aIndex-th polygon and aPoint.

Parameters
aPointis the point whose distance to the aIndex-th polygon has to be measured.
aIndexis the index of the polygon whose distace to aPoint has to be measured.
Returns
int - 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 1514 of file shape_poly_set.cpp.

References containsSingle(), SEG::Distance(), and IterateSegmentsWithHoles().

Referenced by Distance(), and IsEmpty().

1515 {
1516  // We calculate the min dist between the segment and each outline segment
1517  // However, if the segment to test is inside the outline, and does not cross
1518  // any edge, it can be seen outside the polygon.
1519  // Therefore test if a segment end is inside ( testing only one end is enough )
1520  if( containsSingle( aPoint, aPolygonIndex ) )
1521  return 0;
1522 
1523  SEGMENT_ITERATOR iterator = IterateSegmentsWithHoles( aPolygonIndex );
1524 
1525  SEG polygonEdge = *iterator;
1526  int minDistance = polygonEdge.Distance( aPoint );
1527 
1528  for( iterator++; iterator && minDistance > 0; iterator++ )
1529  {
1530  polygonEdge = *iterator;
1531 
1532  int currentDistance = polygonEdge.Distance( aPoint );
1533 
1534  if( currentDistance < minDistance )
1535  minDistance = currentDistance;
1536  }
1537 
1538  return minDistance;
1539 }
SEGMENT_ITERATOR IterateSegmentsWithHoles()
Returns an iterator object, for all outlines in the set (with holes)
SEGMENT_ITERATOR_TEMPLATE< SEG > SEGMENT_ITERATOR
Definition: seg.h:36
bool containsSingle(const VECTOR2I &aP, int aSubpolyIndex, bool aIgnoreHoles=false) const
containsSingle function Checks whether the point aP is inside the aSubpolyIndex-th polygon of the pol...
int Distance(const SEG &aSeg) const
Function Distance()
Definition: seg.h:195
int SHAPE_POLY_SET::DistanceToPolygon ( SEG  aSegment,
int  aIndex,
int  aSegmentWidth = 0 
)

Function DistanceToPolygon computes the minimum distance between the aIndex-th polygon and aSegment with a possible width.

Parameters
aSegmentis the segment whose distance to the aIndex-th polygon has to be measured.
aIndexis the index of the polygon whose distace to aPoint has to be measured.
aSegmentWidthis the width of the segment; defaults to zero.
Returns
int - 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 1542 of file shape_poly_set.cpp.

References SEG::A, containsSingle(), SEG::Distance(), and IterateSegmentsWithHoles().

1543 {
1544  // We calculate the min dist between the segment and each outline segment
1545  // However, if the segment to test is inside the outline, and does not cross
1546  // any edge, it can be seen outside the polygon.
1547  // Therefore test if a segment end is inside ( testing only one end is enough )
1548  if( containsSingle( aSegment.A, aPolygonIndex ) )
1549  return 0;
1550 
1551  SEGMENT_ITERATOR iterator = IterateSegmentsWithHoles( aPolygonIndex );
1552 
1553  SEG polygonEdge = *iterator;
1554  int minDistance = polygonEdge.Distance( aSegment );
1555 
1556  for( iterator++; iterator && minDistance > 0; iterator++ )
1557  {
1558  polygonEdge = *iterator;
1559 
1560  int currentDistance = polygonEdge.Distance( aSegment );
1561 
1562  if( currentDistance < minDistance )
1563  minDistance = currentDistance;
1564  }
1565 
1566  // Take into account the width of the segment
1567  if( aSegmentWidth > 0 )
1568  minDistance -= aSegmentWidth / 2;
1569 
1570  // Return the maximum of minDistance and zero
1571  return minDistance < 0 ? 0 : minDistance;
1572 }
SEGMENT_ITERATOR IterateSegmentsWithHoles()
Returns an iterator object, for all outlines in the set (with holes)
SEGMENT_ITERATOR_TEMPLATE< SEG > SEGMENT_ITERATOR
Definition: seg.h:36
VECTOR2I A
Definition: seg.h:46
bool containsSingle(const VECTOR2I &aP, int aSubpolyIndex, bool aIgnoreHoles=false) const
containsSingle function Checks whether the point aP is inside the aSubpolyIndex-th polygon of the pol...
int Distance(const SEG &aSeg) const
Function Distance()
Definition: seg.h:195
SHAPE_POLY_SET SHAPE_POLY_SET::Fillet ( int  aRadius,
int  aErrorMax 
)

Function Fillet returns a filleted version of the polygon set.

Parameters
aRadiusis the fillet radius.
aErrorMaxis the maximum allowable deviation of the polygon from the circle
Returns
SHAPE_POLY_SET - A set containing the filleted version of this set.

Definition at line 1635 of file shape_poly_set.cpp.

References FilletPolygon(), and m_polys.

Referenced by ZONE_CONTAINER::BuildSmoothedPoly(), and IsEmpty().

1636 {
1637  SHAPE_POLY_SET filleted;
1638 
1639  for( size_t polygonIdx = 0; polygonIdx < m_polys.size(); polygonIdx++ )
1640  filleted.m_polys.push_back( FilletPolygon( aRadius, aErrorMax, polygonIdx ) );
1641 
1642  return filleted;
1643 }
POLYGON FilletPolygon(unsigned int aRadius, int aErrorMax, int aIndex=0)
Function Fillet returns a filleted version of the aIndex-th polygon.
Class SHAPE_POLY_SET.
SHAPE_POLY_SET::POLYGON SHAPE_POLY_SET::FilletPolygon ( unsigned int  aRadius,
int  aErrorMax,
int  aIndex = 0 
)

Function Fillet returns a filleted version of the aIndex-th polygon.

Parameters
aRadiusis the fillet radius.
aErrorMaxis the maximum allowable deviation of the polygon from the circle
aIndexis the index of the polygon to be filleted
Returns
POLYGON - A polygon containing the filleted version of the aIndex-th polygon.

Definition at line 1506 of file shape_poly_set.cpp.

References chamferFilletPolygon().

Referenced by Fillet(), and IsEmpty().

1509 {
1510  return chamferFilletPolygon( CORNER_MODE::FILLETED, aRadius, aIndex, aErrorMax );
1511 }
POLYGON chamferFilletPolygon(CORNER_MODE aMode, unsigned int aDistance, int aIndex, int aErrorMax=-1)
Function chamferFilletPolygon Returns the camfered or filleted version of the aIndex-th polygon in th...
const std::string SHAPE_POLY_SET::Format ( ) const
overridevirtual

Reimplemented from SHAPE.

Definition at line 1070 of file shape_poly_set.cpp.

References i, and m_polys.

1071 {
1072  std::stringstream ss;
1073 
1074  ss << "polyset " << m_polys.size() << "\n";
1075 
1076  for( unsigned i = 0; i < m_polys.size(); i++ )
1077  {
1078  ss << "poly " << m_polys[i].size() << "\n";
1079 
1080  for( unsigned j = 0; j < m_polys[i].size(); j++ )
1081  {
1082  ss << m_polys[i][j].PointCount() << "\n";
1083 
1084  for( int v = 0; v < m_polys[i][j].PointCount(); v++ )
1085  ss << m_polys[i][j].CPoint( v ).x << " " << m_polys[i][j].CPoint( v ).y << "\n";
1086  }
1087 
1088  ss << "\n";
1089  }
1090 
1091  return ss.str();
1092 }
size_t i
Definition: json11.cpp:597
void SHAPE_POLY_SET::Fracture ( POLYGON_MODE  aFastMode)

Converts a set of polygons with holes to a singe outline with "slits"/"fractures" connecting the outer ring to the inner holes For aFastMode meaning, see function booleanOp

Definition at line 831 of file shape_poly_set.cpp.

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

Referenced by addHoleToPolygon(), D_PAD::AddPrimitive(), D_PAD::buildCustomPadPolygon(), CacheTriangulation(), ZONE_FILLER::computeRawFilledAreas(), MODULE::CoverageRatio(), export_vrml_polygon(), ZONE_FILLER::fillSingleZone(), DXF_PLOTTER::PlotPoly(), PlotSolderMaskLayer(), C3D_RENDER_RAYTRACING::reload(), and ZONE_CONTAINER::TransformOutlinesShapeWithClearanceToPolygon().

832 {
833  Simplify( aFastMode ); // remove overlapping holes/degeneracy
834 
835  for( POLYGON& paths : m_polys )
836  {
837  fractureSingle( paths );
838  }
839 }
std::vector< SHAPE_LINE_CHAIN > POLYGON
represents a single polygon outline with holes.
void fractureSingle(POLYGON &paths)
void Simplify(POLYGON_MODE aFastMode)
Simplifies the polyset (merges overlapping polys, eliminates degeneracy/self-intersections) For aFast...
void SHAPE_POLY_SET::fractureSingle ( POLYGON paths)
private

Definition at line 729 of file shape_poly_set.cpp.

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

Referenced by Fracture(), and IsEmpty().

730 {
731  FractureEdgeSet edges;
732  FractureEdgeSet border_edges;
733  FractureEdge* root = NULL;
734 
735  bool first = true;
736 
737  if( paths.size() == 1 )
738  return;
739 
740  int num_unconnected = 0;
741 
742  for( SHAPE_LINE_CHAIN& path : paths )
743  {
744  int index = 0;
745 
746  FractureEdge* prev = NULL, * first_edge = NULL;
747 
748  int x_min = std::numeric_limits<int>::max();
749 
750  for( int i = 0; i < path.PointCount(); i++ )
751  {
752  const VECTOR2I& p = path.CPoint( i );
753 
754  if( p.x < x_min )
755  x_min = p.x;
756  }
757 
758  for( int i = 0; i < path.PointCount(); i++ )
759  {
760  FractureEdge* fe = new FractureEdge( first, &path, index++ );
761 
762  if( !root )
763  root = fe;
764 
765  if( !first_edge )
766  first_edge = fe;
767 
768  if( prev )
769  prev->m_next = fe;
770 
771  if( i == path.PointCount() - 1 )
772  fe->m_next = first_edge;
773 
774  prev = fe;
775  edges.push_back( fe );
776 
777  if( !first )
778  {
779  if( fe->m_p1.x == x_min )
780  border_edges.push_back( fe );
781  }
782 
783  if( !fe->m_connected )
784  num_unconnected++;
785  }
786 
787  first = false; // first path is always the outline
788  }
789 
790  // keep connecting holes to the main outline, until there's no holes left...
791  while( num_unconnected > 0 )
792  {
793  int x_min = std::numeric_limits<int>::max();
794 
795  FractureEdge* smallestX = NULL;
796 
797  // find the left-most hole edge and merge with the outline
798  for( FractureEdgeSet::iterator i = border_edges.begin(); i != border_edges.end(); ++i )
799  {
800  int xt = (*i)->m_p1.x;
801 
802  if( ( xt < x_min ) && !(*i)->m_connected )
803  {
804  x_min = xt;
805  smallestX = *i;
806  }
807  }
808 
809  num_unconnected -= processEdge( edges, smallestX );
810  }
811 
812  paths.clear();
813  SHAPE_LINE_CHAIN newPath;
814 
815  newPath.SetClosed( true );
816 
817  FractureEdge* e;
818 
819  for( e = root; e->m_next != root; e = e->m_next )
820  newPath.Append( e->m_p1 );
821 
822  newPath.Append( e->m_p1 );
823 
824  for( FractureEdgeSet::iterator i = edges.begin(); i != edges.end(); ++i )
825  delete *i;
826 
827  paths.push_back( newPath );
828 }
static int processEdge(FractureEdgeSet &edges, FractureEdge *edge)
void Append(int aX, int aY, bool aAllowDuplication=false)
Function Append()
void SetClosed(bool aClosed)
Function SetClosed()
#define max(a, b)
Definition: auxiliary.h:86
Class SHAPE_LINE_CHAIN.
FractureEdge * m_next
size_t i
Definition: json11.cpp:597
std::vector< FractureEdge * > FractureEdgeSet
SHAPE_LINE_CHAIN& SHAPE_POLY_SET::getContourForCorner ( int  aCornerId,
int &  aIndexWithinContour 
)
private

Referenced by IsEmpty().

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

Function GetGlobalIndex computes the global index of a vertex from the relative indices of polygon, contour and vertex.

Parameters
aRelativeIndicesis the set of relative indices.
aGlobalIdx[out] is the computed global index.
Returns
bool - true if the relative indices are correct; false otherwise. The computed global index is returned in the aGlobalIdx reference.

Definition at line 123 of file shape_poly_set.cpp.

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_CONTAINER::GetSelectedCorner().

125 {
126  int selectedVertex = aRelativeIndices.m_vertex;
127  unsigned int selectedContour = aRelativeIndices.m_contour;
128  unsigned int selectedPolygon = aRelativeIndices.m_polygon;
129 
130  // Check whether the vertex indices make sense in this poly set
131  if( selectedPolygon < m_polys.size() && selectedContour < m_polys[selectedPolygon].size()
132  && selectedVertex < m_polys[selectedPolygon][selectedContour].PointCount() )
133  {
134  POLYGON currentPolygon;
135 
136  aGlobalIdx = 0;
137 
138  for( unsigned int polygonIdx = 0; polygonIdx < selectedPolygon; polygonIdx++ )
139  {
140  currentPolygon = Polygon( polygonIdx );
141 
142  for( unsigned int contourIdx = 0; contourIdx < currentPolygon.size(); contourIdx++ )
143  {
144  aGlobalIdx += currentPolygon[contourIdx].PointCount();
145  }
146  }
147 
148  currentPolygon = Polygon( selectedPolygon );
149 
150  for( unsigned int contourIdx = 0; contourIdx < selectedContour; contourIdx++ )
151  {
152  aGlobalIdx += currentPolygon[contourIdx].PointCount();
153  }
154 
155  aGlobalIdx += selectedVertex;
156 
157  return true;
158  }
159  else
160  {
161  return false;
162  }
163 }
std::vector< SHAPE_LINE_CHAIN > POLYGON
represents a single polygon outline with holes.
POLYGON & Polygon(int aIndex)
Returns the aIndex-th subpolygon in the set
MD5_HASH SHAPE_POLY_SET::GetHash ( ) const

Definition at line 1821 of file shape_poly_set.cpp.

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

Referenced by ZONE_FILLER::Fill(), and SHAPE_POLY_SET().

1822 {
1823  if( !m_hash.IsValid() )
1824  return checksum();
1825 
1826  return m_hash;
1827 }
MD5_HASH checksum() const
bool IsValid() const
Definition: md5_hash.h:23
bool SHAPE_POLY_SET::GetNeighbourIndexes ( int  aGlobalIndex,
int *  aPrevious,
int *  aNext 
)

Returns 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
aGlobalIndexis index of the corner, globally indexed between all edges in all contours
aPrevious- the globalIndex of the previous corner of the same contour.
aNext- the globalIndex of the next corner of the same contour.
Returns
true if OK, false if aGlobalIndex is out of range

Definition at line 352 of file shape_poly_set.cpp.

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_CONTAINER::MoveEdge().

353 {
355 
356  // If the edge does not exist, throw an exception, it is an illegal access memory error
357  if( !GetRelativeIndices( aGlobalIndex, &index ) )
358  return false;
359 
360  // Calculate the previous and next index of aGlobalIndex, corresponding to
361  // the same contour;
362  VERTEX_INDEX inext = index;
363  int lastpoint = m_polys[index.m_polygon][index.m_contour].SegmentCount();
364 
365  if( index.m_vertex == 0 )
366  {
367  index.m_vertex = lastpoint;
368  inext.m_vertex = 1;
369  }
370  else if( index.m_vertex == lastpoint )
371  {
372  index.m_vertex--;
373  inext.m_vertex = 0;
374  }
375  else
376  {
377  inext.m_vertex++;
378  index.m_vertex--;
379  }
380 
381  if( aPrevious )
382  {
383  int previous;
384  GetGlobalIndex( index, previous );
385  *aPrevious = previous;
386  }
387 
388  if( aNext )
389  {
390  int next;
391  GetGlobalIndex( inext, next );
392  *aNext = next;
393  }
394 
395  return true;
396 }
CITER next(CITER it)
Definition: ptree.cpp:130
Struct VERTEX_INDEX.
struct SHAPE_POLY_SET::VERTEX_INDEX VERTEX_INDEX
Struct VERTEX_INDEX.
bool GetRelativeIndices(int aGlobalIdx, VERTEX_INDEX *aRelativeIndices) const
Function GetRelativeIndices.
bool GetGlobalIndex(VERTEX_INDEX aRelativeIndices, int &aGlobalIdx)
Function GetGlobalIndex computes the global index of a vertex from the relative indices of polygon...
bool SHAPE_POLY_SET::GetRelativeIndices ( int  aGlobalIdx,
SHAPE_POLY_SET::VERTEX_INDEX aRelativeIndices 
) const

Function GetRelativeIndices.

Converts 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
aGlobalIdxis the global index of the corner whose structured index wants to be found
aRelativeIndicesis a pointer to the set of relative indices to store.
Returns
bool - true if the global index is correct and the information in aRelativeIndices is valid; false otherwise.

Definition at line 83 of file shape_poly_set.cpp.

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(), PCB_EDIT_FRAME::Delete_Zone_Contour(), DRC::doEdgeZoneDrc(), ZONE_CONTAINER::GetCornerPosition(), GetNeighbourIndexes(), InsertVertex(), IsVertexInHole(), IterateFromVertexWithHoles(), RemoveVertex(), ZONE_CONTAINER::SetCornerPosition(), ZONE_CONTAINER::SetSelectedCorner(), and Vertex().

85 {
86  int polygonIdx = 0;
87  unsigned int contourIdx = 0;
88  int vertexIdx = 0;
89 
90  int currentGlobalIdx = 0;
91 
92  for( polygonIdx = 0; polygonIdx < OutlineCount(); polygonIdx++ )
93  {
94  const POLYGON currentPolygon = CPolygon( polygonIdx );
95 
96  for( contourIdx = 0; contourIdx < currentPolygon.size(); contourIdx++ )
97  {
98  SHAPE_LINE_CHAIN currentContour = currentPolygon[contourIdx];
99  int totalPoints = currentContour.PointCount();
100 
101  for( vertexIdx = 0; vertexIdx < totalPoints; vertexIdx++ )
102  {
103  // Check if the current vertex is the globally indexed as aGlobalIdx
104  if( currentGlobalIdx == aGlobalIdx )
105  {
106  aRelativeIndices->m_polygon = polygonIdx;
107  aRelativeIndices->m_contour = contourIdx;
108  aRelativeIndices->m_vertex = vertexIdx;
109 
110  return true;
111  }
112 
113  // Advance
114  currentGlobalIdx++;
115  }
116  }
117  }
118 
119  return false;
120 }
std::vector< SHAPE_LINE_CHAIN > POLYGON
represents a single polygon outline with holes.
int PointCount() const
Function PointCount()
int OutlineCount() const
Returns the number of outlines in the set
Class SHAPE_LINE_CHAIN.
const POLYGON & CPolygon(int aIndex) const
bool SHAPE_POLY_SET::HasHoles ( ) const

Returns true if the polygon set has any holes.

Definition at line 1003 of file shape_poly_set.cpp.

References m_polys.

Referenced by CacheTriangulation().

1004 {
1005  // Iterate through all the polygons on the set
1006  for( const POLYGON& paths : m_polys )
1007  {
1008  // If any of them has more than one contour, it is a hole.
1009  if( paths.size() > 1 )
1010  return true;
1011  }
1012 
1013  // Return false if and only if every polygon has just one outline, without holes.
1014  return false;
1015 }
std::vector< SHAPE_LINE_CHAIN > POLYGON
represents a single polygon outline with holes.
bool SHAPE_POLY_SET::HasTouchingHoles ( ) const

Returns true if the polygon set has any holes tha share a vertex.

Definition at line 1914 of file shape_poly_set.cpp.

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

1915 {
1916  for( int i = 0; i < OutlineCount(); i++ )
1917  {
1918  if( hasTouchingHoles( CPolygon( i ) ) )
1919  {
1920  return true;
1921  }
1922  }
1923 
1924  return false;
1925 }
int OutlineCount() const
Returns the number of outlines in the set
bool hasTouchingHoles(const POLYGON &aPoly) const
Returns true if the polygon set has any holes that touch share a vertex.
size_t i
Definition: json11.cpp:597
const POLYGON & CPolygon(int aIndex) const
bool SHAPE_POLY_SET::hasTouchingHoles ( const POLYGON aPoly) const
private

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

Definition at line 1928 of file shape_poly_set.cpp.

Referenced by HasTouchingHoles().

1929 {
1930  std::set< long long > ptHashes;
1931 
1932  for( const auto& lc : aPoly )
1933  {
1934  for( const VECTOR2I& pt : lc.CPoints() )
1935  {
1936  const long long ptHash = (long long) pt.x << 32 | pt.y;
1937 
1938  if( ptHashes.count( ptHash ) > 0 )
1939  {
1940  return true;
1941  }
1942 
1943  ptHashes.insert( ptHash );
1944  }
1945  }
1946 
1947  return false;
1948 }
SHAPE_LINE_CHAIN& SHAPE_POLY_SET::Hole ( int  aOutline,
int  aHole 
)
inline

Returns the reference to aHole-th hole in the aIndex-th outline

Definition at line 595 of file shape_poly_set.h.

References m_polys.

Referenced by Convert_path_polygon_to_polygon_blocks_and_dummy_blocks(), export_vrml_board(), and DSN::SPECCTRA_DB::fillBOUNDARY().

596  {
597  return m_polys[aOutline][aHole + 1];
598  }
int SHAPE_POLY_SET::HoleCount ( int  aOutline) const
inline

Returns the number of holes in a given outline

Definition at line 562 of file shape_poly_set.h.

References m_polys.

Referenced by CINFO3D_VISU::AddSolidAreasShapesToContainer(), CLAYER_TRIANGLES::AddToMiddleContourns(), ZONE_CONTAINER::AppendCorner(), containsSingle(), Convert_path_polygon_to_polygon_blocks_and_dummy_blocks(), KIGFX::PCB_PAINTER::draw(), export_vrml_board(), DSN::SPECCTRA_DB::fillBOUNDARY(), and PlotLayerOutlines().

563  {
564  if( ( aOutline < 0 ) || (aOutline >= (int)m_polys.size()) || (m_polys[aOutline].size() < 2) )
565  return 0;
566 
567  // the first polygon in m_polys[aOutline] is the main contour,
568  // only others are holes:
569  return m_polys[aOutline].size() - 1;
570  }
void SHAPE_POLY_SET::importTree ( ClipperLib::PolyTree *  tree)
private

Definition at line 593 of file shape_poly_set.cpp.

References i, and m_polys.

Referenced by booleanOp(), Inflate(), and IsEmpty().

594 {
595  m_polys.clear();
596 
597  for( PolyNode* n = tree->GetFirst(); n; n = n->GetNext() )
598  {
599  if( !n->IsHole() )
600  {
601  POLYGON paths;
602  paths.reserve( n->Childs.size() + 1 );
603  paths.push_back( n->Contour );
604 
605  for( unsigned int i = 0; i < n->Childs.size(); i++ )
606  paths.push_back( n->Childs[i]->Contour );
607 
608  m_polys.push_back( paths );
609  }
610  }
611 }
std::vector< SHAPE_LINE_CHAIN > POLYGON
represents a single polygon outline with holes.
size_t i
Definition: json11.cpp:597
void SHAPE_POLY_SET::Inflate ( int  aFactor,
int  aCircleSegmentsCount 
)

Performs outline inflation/deflation, using round corners.

Definition at line 547 of file shape_poly_set.cpp.

References abs, i, importTree(), m_polys, and SEG_CNT_MAX.

Referenced by D_PAD::buildCustomPadPolygon(), ZONE_FILLER::buildZoneFeatureHoleList(), Collide(), ZONE_FILLER::computeRawFilledAreas(), CINFO3D_VISU::createNewPadWithClearance(), KIGFX::PCB_PAINTER::draw(), D_PAD::DrawShape(), export_vrml_polygon(), ZONE_FILLER::fillSingleZone(), GERBER_PLOTTER::FlashPadCustom(), GERBER_PLOTTER::FlashPadRoundRect(), MODULE::GetBoundingPoly(), PlotSolderMaskLayer(), PlotStandardLayer(), ZONE_CONTAINER::TransformOutlinesShapeWithClearanceToPolygon(), TransformRoundRectToPolygon(), and D_PAD::TransformShapeWithClearanceToPolygon().

548 {
549  // A static table to avoid repetitive calculations of the coefficient
550  // 1.0 - cos( M_PI/aCircleSegmentsCount)
551  // aCircleSegmentsCount is most of time <= 64 and usually 8, 12, 16, 32
552  #define SEG_CNT_MAX 64
553  static double arc_tolerance_factor[SEG_CNT_MAX + 1];
554 
555  ClipperOffset c;
556 
557  for( const POLYGON& poly : m_polys )
558  {
559  for( size_t i = 0; i < poly.size(); i++ )
560  c.AddPath( poly[i].convertToClipper( i == 0 ), jtRound, etClosedPolygon );
561  }
562 
563  PolyTree solution;
564 
565  // Calculate the arc tolerance (arc error) from the seg count by circle.
566  // the seg count is nn = M_PI / acos(1.0 - c.ArcTolerance / abs(aFactor))
567  // see:
568  // www.angusj.com/delphi/clipper/documentation/Docs/Units/ClipperLib/Classes/ClipperOffset/Properties/ArcTolerance.htm
569 
570  if( aCircleSegmentsCount < 6 ) // avoid incorrect aCircleSegmentsCount values
571  aCircleSegmentsCount = 6;
572 
573  double coeff;
574 
575  if( aCircleSegmentsCount > SEG_CNT_MAX || arc_tolerance_factor[aCircleSegmentsCount] == 0 )
576  {
577  coeff = 1.0 - cos( M_PI / aCircleSegmentsCount );
578 
579  if( aCircleSegmentsCount <= SEG_CNT_MAX )
580  arc_tolerance_factor[aCircleSegmentsCount] = coeff;
581  }
582  else
583  coeff = arc_tolerance_factor[aCircleSegmentsCount];
584 
585  c.ArcTolerance = std::abs( aFactor ) * coeff;
586 
587  c.Execute( solution, aFactor );
588 
589  importTree( &solution );
590 }
std::vector< SHAPE_LINE_CHAIN > POLYGON
represents a single polygon outline with holes.
#define abs(a)
Definition: auxiliary.h:84
#define SEG_CNT_MAX
size_t i
Definition: json11.cpp:597
void importTree(ClipperLib::PolyTree *tree)
void SHAPE_POLY_SET::InsertVertex ( int  aGlobalIndex,
VECTOR2I  aNewVertex 
)

Function InsertVertex Adds a vertex in the globally indexed position aGlobalIndex.

Parameters
aGlobalIndexis the global index of the position in which teh new vertex will be inserted.
aNewVertexis the new inserted vertex.

Definition at line 216 of file shape_poly_set.cpp.

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 POINT_EDITOR::addCorner(), PCB_EDIT_FRAME::Process_Special_Functions(), and PCB_EDIT_FRAME::Start_Move_Zone_Corner().

217 {
218  VERTEX_INDEX index;
219 
220  if( aGlobalIndex < 0 )
221  aGlobalIndex = 0;
222 
223  if( aGlobalIndex >= TotalVertices() )
224  {
225  Append( aNewVertex );
226  }
227  else
228  {
229  // Assure the position to be inserted exists; throw an exception otherwise
230  if( GetRelativeIndices( aGlobalIndex, &index ) )
231  m_polys[index.m_polygon][index.m_contour].Insert( index.m_vertex, aNewVertex );
232  else
233  throw( std::out_of_range( "aGlobalIndex-th vertex does not exist" ) );
234  }
235 }
int TotalVertices() const
Returns total number of vertices stored in the set.
struct SHAPE_POLY_SET::VERTEX_INDEX VERTEX_INDEX
Struct VERTEX_INDEX.
bool GetRelativeIndices(int aGlobalIdx, VERTEX_INDEX *aRelativeIndices) const
Function GetRelativeIndices.
int Append(int x, int y, int aOutline=-1, int aHole=-1, bool aAllowDuplication=false)
Appends a vertex at the end of the given outline/hole (default: the last outline) ...
bool SHAPE_POLY_SET::IsPolygonSelfIntersecting ( int  aPolygonIndex)

Function IsPolygonSelfIntersecting.

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

Parameters
aPolygonIndexindex of the polygon that wants to be checked.
Returns
bool - true if the aPolygonIndex-th polygon is self intersecting, false otherwise.

Definition at line 399 of file shape_poly_set.cpp.

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

Referenced by IsSelfIntersecting().

400 {
401  SEGMENT_ITERATOR iterator = IterateSegmentsWithHoles( aPolygonIndex );
402  SEGMENT_ITERATOR innerIterator;
403 
404  for( iterator = IterateSegmentsWithHoles( aPolygonIndex ); iterator; iterator++ )
405  {
406  SEG firstSegment = *iterator;
407 
408  // Iterate through all remaining segments.
409  innerIterator = iterator;
410 
411  // Start in the next segment, we don't want to check collision between a segment and itself
412  for( innerIterator++; innerIterator; innerIterator++ )
413  {
414  SEG secondSegment = *innerIterator;
415 
416  // Check whether the two segments built collide, only when they are not adjacent.
417  if( !iterator.IsAdjacent( innerIterator ) && firstSegment.Collide( secondSegment, 0 ) )
418  return true;
419  }
420  }
421 
422  return false;
423 }
SEGMENT_ITERATOR IterateSegmentsWithHoles()
Returns an iterator object, for all outlines in the set (with holes)
SEGMENT_ITERATOR_TEMPLATE< SEG > SEGMENT_ITERATOR
Definition: seg.h:36
bool Collide(const SEG &aSeg, int aClearance) const
Definition: seg.cpp:134
bool SHAPE_POLY_SET::IsSelfIntersecting ( )

Function IsSelfIntersecting Checks whether any of the polygons in the set is self intersecting.

Returns
bool - true if any of the polygons is self intersecting, false otherwise.

Definition at line 426 of file shape_poly_set.cpp.

References IsPolygonSelfIntersecting(), and m_polys.

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

427 {
428  for( unsigned int polygon = 0; polygon < m_polys.size(); polygon++ )
429  {
430  if( IsPolygonSelfIntersecting( polygon ) )
431  return true;
432  }
433 
434  return false;
435 }
bool IsPolygonSelfIntersecting(int aPolygonIndex)
Function IsPolygonSelfIntersecting.
bool SHAPE_POLY_SET::IsSolid ( ) const
inlineoverridevirtual

Implements SHAPE.

Definition at line 881 of file shape_poly_set.h.

References BBox(), Collide(), CollideEdge(), CollideVertex(), Contains(), and PointOnEdge().

882  {
883  return true;
884  }
bool SHAPE_POLY_SET::IsTriangulationUpToDate ( ) const

Definition at line 1830 of file shape_poly_set.cpp.

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

Referenced by KIGFX::OPENGL_GAL::DrawPolygon(), SHAPE_POLY_SET(), and PNS_KICAD_IFACE::syncZone().

1831 {
1832  if( !m_triangulationValid )
1833  return false;
1834 
1835  if( !m_hash.IsValid() )
1836  return false;
1837 
1838  auto hash = checksum();
1839 
1840  return hash == m_hash;
1841 }
MD5_HASH checksum() const
bool IsValid() const
Definition: md5_hash.h:23
bool SHAPE_POLY_SET::IsVertexInHole ( int  aGlobalIdx)

Function IsVertexInHole.

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

Parameters
aGlobalIdxis the index of the vertex.
Returns
bool - true if the globally indexed aGlobalIdx-th vertex belongs to a hole.

Definition at line 1611 of file shape_poly_set.cpp.

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

Referenced by PCB_EDIT_FRAME::createPopUpMenuForZones(), and IsEmpty().

1612 {
1613  VERTEX_INDEX index;
1614 
1615  // Get the polygon and contour where the vertex is. If the vertex does not exist, return false
1616  if( !GetRelativeIndices( aGlobalIdx, &index ) )
1617  return false;
1618 
1619  // The contour is a hole if its index is greater than zero
1620  return index.m_contour > 0;
1621 }
struct SHAPE_POLY_SET::VERTEX_INDEX VERTEX_INDEX
Struct VERTEX_INDEX.
bool GetRelativeIndices(int aGlobalIdx, VERTEX_INDEX *aRelativeIndices) const
Function GetRelativeIndices.
ITERATOR SHAPE_POLY_SET::Iterate ( int  aFirst,
int  aLast,
bool  aIterateHoles = false 
)
inline

Function Iterate returns an object to iterate through the points of the polygons between aFirst and aLast.

Parameters
aFirstis the first polygon whose points will be iterated.
aLastis the last polygon whose points will be iterated.
aIterateHolesis a flag to indicate whether the points of the holes should be iterated.
Returns
ITERATOR - the iterator object.

Definition at line 641 of file shape_poly_set.h.

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 POINT_EDITOR::addCorner(), GERBER_DRAW_ITEM::ConvertSegmentToPolygon(), D_CODE::ConvertShapeToPolygon(), KIGFX::GERBVIEW_PAINTER::draw(), KIGFX::GERBVIEW_PAINTER::drawPolygon(), ZONE_CONTAINER::DrawWhileCreateOutline(), EDGE_MODULE::Flip(), DRAWSEGMENT::Flip(), ZONE_CONTAINER::Iterate(), EDGE_MODULE::Mirror(), ZONE_CONTAINER::Mirror(), EDGE_MODULE::Move(), DRAWSEGMENT::Move(), GERBER_DRAW_ITEM::MoveAB(), GERBER_DRAW_ITEM::MoveXY(), DRAWSEGMENT::Rotate(), and ZONE_CONTAINER::Rotate().

642  {
643  ITERATOR iter;
644 
645  iter.m_poly = this;
646  iter.m_currentPolygon = aFirst;
647  iter.m_lastPolygon = aLast < 0 ? OutlineCount() - 1 : aLast;
648  iter.m_currentContour = 0;
649  iter.m_currentVertex = 0;
650  iter.m_iterateHoles = aIterateHoles;
651 
652  return iter;
653  }
int OutlineCount() const
Returns the number of outlines in the set
ITERATOR_TEMPLATE< VECTOR2I > ITERATOR
ITERATOR SHAPE_POLY_SET::Iterate ( int  aOutline)
inline

Function Iterate.

Parameters
aOutlinethe index of the polygon to be iterated.
Returns
ITERATOR - 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 661 of file shape_poly_set.h.

References Iterate().

662  {
663  return Iterate( aOutline, aOutline );
664  }
ITERATOR Iterate()
Function Iterate.
ITERATOR SHAPE_POLY_SET::Iterate ( )
inline

Function Iterate.

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

Definition at line 682 of file shape_poly_set.h.

References OutlineCount().

Referenced by Iterate(), and IterateWithHoles().

683  {
684  return Iterate( 0, OutlineCount() - 1 );
685  }
ITERATOR Iterate()
Function Iterate.
int OutlineCount() const
Returns the number of outlines in the set
ITERATOR SHAPE_POLY_SET::IterateFromVertexWithHoles ( int  aGlobalIdx)
inline

Definition at line 732 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.

733  {
734  // Build iterator
735  ITERATOR iter = IterateWithHoles();
736 
737  // Get the relative indices of the globally indexed vertex
738  VERTEX_INDEX indices;
739 
740  if( !GetRelativeIndices( aGlobalIdx, &indices ) )
741  throw( std::out_of_range( "aGlobalIndex-th vertex does not exist" ) );
742 
743  // Adjust where the iterator is pointing
744  iter.m_currentPolygon = indices.m_polygon;
745  iter.m_currentContour = indices.m_contour;
746  iter.m_currentVertex = indices.m_vertex;
747 
748  return iter;
749  }
struct SHAPE_POLY_SET::VERTEX_INDEX VERTEX_INDEX
Struct VERTEX_INDEX.
bool GetRelativeIndices(int aGlobalIdx, VERTEX_INDEX *aRelativeIndices) const
Function GetRelativeIndices.
ITERATOR_TEMPLATE< VECTOR2I > ITERATOR
ITERATOR IterateWithHoles()
Function IterateWithHoles.
SEGMENT_ITERATOR SHAPE_POLY_SET::IterateSegments ( int  aFirst,
int  aLast,
bool  aIterateHoles = false 
)
inline

Returns an iterator object, for iterating between aFirst and aLast outline, with or

without holes (default: without)

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

754  {
755  SEGMENT_ITERATOR iter;
756 
757  iter.m_poly = this;
758  iter.m_currentPolygon = aFirst;
759  iter.m_lastPolygon = aLast < 0 ? OutlineCount() - 1 : aLast;
760  iter.m_currentContour = 0;
761  iter.m_currentSegment = 0;
762  iter.m_iterateHoles = aIterateHoles;
763 
764  return iter;
765  }
SEGMENT_ITERATOR_TEMPLATE< SEG > SEGMENT_ITERATOR
int OutlineCount() const
Returns the number of outlines in the set
SEGMENT_ITERATOR SHAPE_POLY_SET::IterateSegments ( int  aPolygonIdx)
inline

Returns an iterator object, for iterating aPolygonIdx-th polygon edges

Definition at line 768 of file shape_poly_set.h.

References IterateSegments().

769  {
770  return IterateSegments( aPolygonIdx, aPolygonIdx );
771  }
SEGMENT_ITERATOR IterateSegments()
Returns an iterator object, for all outlines in the set (no holes)
SEGMENT_ITERATOR SHAPE_POLY_SET::IterateSegments ( )
inline

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

Definition at line 774 of file shape_poly_set.h.

References OutlineCount().

Referenced by IterateSegments(), and IterateSegmentsWithHoles().

775  {
776  return IterateSegments( 0, OutlineCount() - 1 );
777  }
int OutlineCount() const
Returns the number of outlines in the set
SEGMENT_ITERATOR IterateSegments()
Returns an iterator object, for all outlines in the set (no holes)
SEGMENT_ITERATOR SHAPE_POLY_SET::IterateSegmentsWithHoles ( )
inline

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

Definition at line 780 of file shape_poly_set.h.

References IterateSegments(), and OutlineCount().

Referenced by Collide(), CollideEdge(), DistanceToPolygon(), DRC::doEdgeZoneDrc(), ZONE_CONTAINER::Draw(), ZONE_CONTAINER::Hatch(), IsPolygonSelfIntersecting(), and BOARD::TestAreaIntersection().

781  {
782  return IterateSegments( 0, OutlineCount() - 1, true );
783  }
int OutlineCount() const
Returns the number of outlines in the set
SEGMENT_ITERATOR IterateSegments()
Returns an iterator object, for all outlines in the set (no holes)
SEGMENT_ITERATOR SHAPE_POLY_SET::IterateSegmentsWithHoles ( int  aOutline)
inline

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

Definition at line 786 of file shape_poly_set.h.

References IterateSegments().

787  {
788  return IterateSegments( aOutline, aOutline, true );
789  }
SEGMENT_ITERATOR IterateSegments()
Returns an iterator object, for all outlines in the set (no holes)
ITERATOR SHAPE_POLY_SET::IterateWithHoles ( int  aOutline)
inline

Function IterateWithHoles.

Parameters
aOutlinethe index of the polygon to be iterated.
Returns
ITERATOR - 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 672 of file shape_poly_set.h.

References Iterate().

Referenced by findVertex(), ZONE_CONTAINER::Hatch(), ZONE_CONTAINER::IterateWithHoles(), ZONE_CONTAINER::Mirror(), ZONE_CONTAINER::Rotate(), and BOARD::TestAreaIntersection().

673  {
674  return Iterate( aOutline, aOutline, true );
675  }
ITERATOR Iterate()
Function Iterate.
ITERATOR SHAPE_POLY_SET::IterateWithHoles ( )
inline

Function IterateWithHoles.

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

Definition at line 692 of file shape_poly_set.h.

References Iterate(), and OutlineCount().

Referenced by CollideVertex(), IterateFromVertexWithHoles(), and RemoveNullSegments().

693  {
694  return Iterate( 0, OutlineCount() - 1, true );
695  }
ITERATOR Iterate()
Function Iterate.
int OutlineCount() const
Returns the number of outlines in the set
void SHAPE_POLY_SET::Move ( const VECTOR2I aVector)
overridevirtual

Implements SHAPE.

Definition at line 1460 of file shape_poly_set.cpp.

References m_polys.

Referenced by KIGFX::GERBVIEW_PAINTER::drawFlashedShape(), export_vrml_polygon(), GERBER_DRAW_ITEM::HitTest(), ZONE_CONTAINER::Move(), and TransformOvalClearanceToPolygon().

1461 {
1462  for( POLYGON& poly : m_polys )
1463  {
1464  for( SHAPE_LINE_CHAIN& path : poly )
1465  {
1466  path.Move( aVector );
1467  }
1468  }
1469 }
std::vector< SHAPE_LINE_CHAIN > POLYGON
represents a single polygon outline with holes.
Class SHAPE_LINE_CHAIN.
int SHAPE_POLY_SET::NewHole ( int  aOutline = -1)

Creates a new hole in a given outline

Definition at line 178 of file shape_poly_set.cpp.

References m_polys, and SHAPE_LINE_CHAIN::SetClosed().

Referenced by ConvertOutlineToPolygon(), ConvertPolyListToPolySet(), and ZONE_CONTAINER::NewHole().

179 {
180  SHAPE_LINE_CHAIN empty_path;
181 
182  empty_path.SetClosed( true );
183 
184  // Default outline is the last one
185  if( aOutline < 0 )
186  aOutline += m_polys.size();
187 
188  // Add hole to the selected outline
189  m_polys[aOutline].push_back( empty_path );
190 
191  return m_polys.back().size() - 2;
192 }
void SetClosed(bool aClosed)
Function SetClosed()
Class SHAPE_LINE_CHAIN.
int SHAPE_POLY_SET::NewOutline ( )

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

Definition at line 166 of file shape_poly_set.cpp.

References m_polys, and SHAPE_LINE_CHAIN::SetClosed().

Referenced by addHoleToPolygon(), addRect(), ZONE_CONTAINER::AppendCorner(), BuildBoardPolygonOutlines(), D_PAD::buildCustomPadPolygon(), D_PAD::BuildPadShapePolygon(), ZONE_FILLER::buildUnconnectedThermalStubsPolygonList(), ZONE_FILLER::buildZoneFeatureHoleList(), ConvertOutlineToPolygon(), ConvertPolyListToPolySet(), GERBER_DRAW_ITEM::ConvertSegmentToPolygon(), D_CODE::ConvertShapeToPolygon(), CreateThermalReliefPadPolygon(), KIGFX::PCB_PAINTER::draw(), GERBER_FILE_IMAGE::Execute_DCODE_Command(), fillArcPOLY(), MODULE::GetBoundingPoly(), getRectangleAlongCentreLine(), LEGACY_PLUGIN::loadZONE_CONTAINER(), CPolyLine::NormalizeAreaOutlines(), PCB_PARSER::parseZONE_CONTAINER(), DXF_PLOTTER::PlotPoly(), KIGFX::PREVIEW::POLYGON_ITEM::SetPoints(), DRAWSEGMENT::SetPolyPoints(), EDA_TEXT::TransformBoundingBoxWithClearanceToPolygon(), TransformCircleToPolygon(), TransformOvalClearanceToPolygon(), TransformRingToPolygon(), TransformRoundedEndsSegmentToPolygon(), TransformRoundRectToPolygon(), DRAWSEGMENT::TransformShapeWithClearanceToPolygon(), and D_PAD::TransformShapeWithClearanceToPolygon().

167 {
168  SHAPE_LINE_CHAIN empty_path;
169  POLYGON poly;
170 
171  empty_path.SetClosed( true );
172  poly.push_back( empty_path );
173  m_polys.push_back( poly );
174  return m_polys.size() - 1;
175 }
std::vector< SHAPE_LINE_CHAIN > POLYGON
represents a single polygon outline with holes.
void SetClosed(bool aClosed)
Function SetClosed()
Class SHAPE_LINE_CHAIN.
int SHAPE_POLY_SET::NormalizeAreaOutlines ( )

Function NormalizeAreaOutlines Convert a self-intersecting polygon to one (or more) non self-intersecting polygon(s) Removes null segments.

Returns
int - 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 1037 of file shape_poly_set.cpp.

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

Referenced by BOARD::NormalizeAreaPolygon().

1038 {
1039  // We are expecting only one main outline, but this main outline can have holes
1040  // if holes: combine holes and remove them from the main outline.
1041  // Note also we are using SHAPE_POLY_SET::PM_STRICTLY_SIMPLE in polygon
1042  // calculations, but it is not mandatory. It is used mainly
1043  // because there is usually only very few vertices in area outlines
1044  SHAPE_POLY_SET::POLYGON& outline = Polygon( 0 );
1045  SHAPE_POLY_SET holesBuffer;
1046 
1047  // Move holes stored in outline to holesBuffer:
1048  // The first SHAPE_LINE_CHAIN is the main outline, others are holes
1049  while( outline.size() > 1 )
1050  {
1051  holesBuffer.AddOutline( outline.back() );
1052  outline.pop_back();
1053  }
1054 
1056 
1057  // If any hole, substract it to main outline
1058  if( holesBuffer.OutlineCount() )
1059  {
1060  holesBuffer.Simplify( SHAPE_POLY_SET::PM_FAST );
1062  }
1063 
1065 
1066  return OutlineCount();
1067 }
std::vector< SHAPE_LINE_CHAIN > POLYGON
represents a single polygon outline with holes.
int OutlineCount() const
Returns the number of outlines in the set
Class SHAPE_POLY_SET.
void Simplify(POLYGON_MODE aFastMode)
Simplifies the polyset (merges overlapping polys, eliminates degeneracy/self-intersections) For aFast...
int RemoveNullSegments()
Function RemoveNullSegments looks for null segments; ie, segments whose ends are exactly the same and...
int AddOutline(const SHAPE_LINE_CHAIN &aOutline)
Adds a new outline to the set and returns its index
void BooleanSubtract(const SHAPE_POLY_SET &b, POLYGON_MODE aFastMode)
Performs boolean polyset difference For aFastMode meaning, see function booleanOp ...
POLYGON & Polygon(int aIndex)
Returns the aIndex-th subpolygon in the set
SHAPE_POLY_SET & SHAPE_POLY_SET::operator= ( const SHAPE_POLY_SET aOther)

Definition at line 1809 of file shape_poly_set.cpp.

References m_hash, m_polys, m_triangulatedPolys, and m_triangulationValid.

1810 {
1811  static_cast<SHAPE&>(*this) = aOther;
1812  m_polys = aOther.m_polys;
1813 
1814  // reset poly cache:
1815  m_hash = MD5_HASH{};
1816  m_triangulationValid = false;
1817  m_triangulatedPolys.clear();
1818  return *this;
1819 }
std::vector< std::unique_ptr< TRIANGULATED_POLYGON > > m_triangulatedPolys
Class SHAPE.
Definition: shape.h:58
int SHAPE_POLY_SET::OutlineCount ( ) const
inline

Returns the number of outlines in the set

Definition at line 556 of file shape_poly_set.h.

References m_polys, and VertexCount().

Referenced by POINT_EDITOR::addCorner(), ZONE_CONTAINER::AddPolygon(), CINFO3D_VISU::AddSolidAreasShapesToContainer(), CLAYER_TRIANGLES::AddToMiddleContourns(), ZONE_CONTAINER::AppendCorner(), D_PAD::boundingRadius(), BuildBoardPolygonOutlines(), BuildConvexHull(), D_PAD::buildCustomPadPolygon(), DRAWSEGMENT::BuildPolyPointsList(), CacheTriangulation(), DRC::checkClearancePadToPad(), CIterate(), CIterateWithHoles(), BOARD::CombineAreas(), Contains(), Convert_path_polygon_to_polygon_blocks_and_dummy_blocks(), D_PAD::CustomShapeAsPolygonToBoardPosition(), DRC::doFootprintOverlappingDrc(), KIGFX::GERBVIEW_PAINTER::draw(), DRAWSEGMENT::Draw(), GERBER_DRAW_ITEM::Draw(), KIGFX::PCB_PAINTER::draw(), KIGFX::GERBVIEW_PAINTER::drawApertureMacro(), APERTURE_MACRO::DrawApertureMacroShape(), ZONE_CONTAINER::DrawFilledArea(), D_CODE::DrawFlashedPolygon(), D_CODE::DrawFlashedShape(), KIGFX::GERBVIEW_PAINTER::drawFlashedShape(), KIGFX::CAIRO_GAL_BASE::DrawPolygon(), KIGFX::OPENGL_GAL::DrawPolygon(), KIGFX::GERBVIEW_PAINTER::drawPolygon(), D_PAD::DrawShape(), KIGFX::OPENGL_GAL::drawTriangulatedPolyset(), GERBER_FILE_IMAGE::Execute_DCODE_Command(), export_vrml_board(), export_vrml_padshape(), export_vrml_zones(), fillArcPOLY(), DSN::SPECCTRA_DB::fillBOUNDARY(), ZONE_FILLER::fillZoneWithSegments(), HPGL_PLOTTER::FlashPadCustom(), PSLIKE_PLOTTER::FlashPadCustom(), GERBER_PLOTTER::FlashPadCustom(), DXF_PLOTTER::FlashPadCustom(), D_PAD::FlipPrimitives(), C3D_RENDER_OGL_LEGACY::generate_3D_Vias_and_Pads(), C3D_RENDER_OGL_LEGACY::generate_holes_display_list(), APERTURE_MACRO::GetApertureMacroShape(), GERBER_DRAW_ITEM::GetBoundingBox(), D_PAD::GetBoundingBox(), GetRelativeIndices(), HasTouchingHoles(), D_PAD::HitTest(), Iterate(), IterateSegments(), IterateSegmentsWithHoles(), IterateWithHoles(), D_PAD::MergePrimitivesAsPolygon(), GERBER_DRAW_ITEM::MoveAB(), GERBER_DRAW_ITEM::MoveXY(), CPolyLine::NormalizeAreaOutlines(), NormalizeAreaOutlines(), BRDITEMS_PLOTTER::PlotDrawSegment(), PlotLayerOutlines(), BRDITEMS_PLOTTER::PlotPad(), DXF_PLOTTER::PlotPoly(), Polygon_Calc_BBox_3DU(), polygonArea(), C3D_RENDER_OGL_LEGACY::reload(), Subset(), and PNS_KICAD_IFACE::syncZone().

556 { return m_polys.size(); }
bool SHAPE_POLY_SET::Parse ( std::stringstream &  aStream)
overridevirtual

Reimplemented from SHAPE.

Definition at line 1095 of file shape_poly_set.cpp.

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

1096 {
1097  std::string tmp;
1098 
1099  aStream >> tmp;
1100 
1101  if( tmp != "polyset" )
1102  return false;
1103 
1104  aStream >> tmp;
1105 
1106  int n_polys = atoi( tmp.c_str() );
1107 
1108  if( n_polys < 0 )
1109  return false;
1110 
1111  for( int i = 0; i < n_polys; i++ )
1112  {
1113  POLYGON paths;
1114 
1115  aStream >> tmp;
1116 
1117  if( tmp != "poly" )
1118  return false;
1119 
1120  aStream >> tmp;
1121  int n_outlines = atoi( tmp.c_str() );
1122 
1123  if( n_outlines < 0 )
1124  return false;
1125 
1126  for( int j = 0; j < n_outlines; j++ )
1127  {
1128  SHAPE_LINE_CHAIN outline;
1129 
1130  outline.SetClosed( true );
1131 
1132  aStream >> tmp;
1133  int n_vertices = atoi( tmp.c_str() );
1134 
1135  for( int v = 0; v < n_vertices; v++ )
1136  {
1137  VECTOR2I p;
1138 
1139  aStream >> tmp; p.x = atoi( tmp.c_str() );
1140  aStream >> tmp; p.y = atoi( tmp.c_str() );
1141  outline.Append( p );
1142  }
1143 
1144  paths.push_back( outline );
1145  }
1146 
1147  m_polys.push_back( paths );
1148  }
1149 
1150  return true;
1151 }
std::vector< SHAPE_LINE_CHAIN > POLYGON
represents a single polygon outline with holes.
void Append(int aX, int aY, bool aAllowDuplication=false)
Function Append()
void SetClosed(bool aClosed)
Function SetClosed()
Class SHAPE_LINE_CHAIN.
size_t i
Definition: json11.cpp:597
bool SHAPE_POLY_SET::pointInPolygon ( const VECTOR2I aP,
const SHAPE_LINE_CHAIN aPath 
) const
private

Definition at line 1454 of file shape_poly_set.cpp.

References SHAPE_LINE_CHAIN::PointInside().

Referenced by containsSingle(), and IsEmpty().

1455 {
1456  return aPath.PointInside( aP );
1457 }
bool PointInside(const VECTOR2I &aP) const
Function PointInside()
bool SHAPE_POLY_SET::PointOnEdge ( const VECTOR2I aP) const

Function PointOnEdge()

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

Parameters
aPis the point to check.
Returns
bool - true if the point lies on the edge of any polygon.

Definition at line 1171 of file shape_poly_set.cpp.

References m_polys.

Referenced by IsSolid().

1172 {
1173  // Iterate through all the polygons in the set
1174  for( const POLYGON& polygon : m_polys )
1175  {
1176  // Iterate through all the line chains in the polygon
1177  for( const SHAPE_LINE_CHAIN& lineChain : polygon )
1178  {
1179  if( lineChain.PointOnEdge( aP ) )
1180  return true;
1181  }
1182  }
1183 
1184  return false;
1185 }
std::vector< SHAPE_LINE_CHAIN > POLYGON
represents a single polygon outline with holes.
Class SHAPE_LINE_CHAIN.
POLYGON& SHAPE_POLY_SET::Polygon ( int  aIndex)
inline
const POLYGON& SHAPE_POLY_SET::Polygon ( int  aIndex) const
inline

Definition at line 606 of file shape_poly_set.h.

References m_polys.

607  {
608  return m_polys[aIndex];
609  }
void SHAPE_POLY_SET::RemoveContour ( int  aContourIdx,
int  aPolygonIdx = -1 
)

Function RemoveContour deletes the aContourIdx-th contour of the aPolygonIdx-th polygon in the set.

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

Definition at line 1241 of file shape_poly_set.cpp.

References m_polys.

Referenced by PCB_EDIT_FRAME::Delete_Zone_Contour(), IsEmpty(), and POINT_EDITOR::removeCorner().

1242 {
1243  // Default polygon is the last one
1244  if( aPolygonIdx < 0 )
1245  aPolygonIdx += m_polys.size();
1246 
1247  m_polys[aPolygonIdx].erase( m_polys[aPolygonIdx].begin() + aContourIdx );
1248 }
int SHAPE_POLY_SET::RemoveNullSegments ( )

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

Returns
int - the number of deleted segments.

Definition at line 1251 of file shape_poly_set.cpp.

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

Referenced by chamferFilletPolygon(), PCB_EDIT_FRAME::End_Zone(), IsEmpty(), and NormalizeAreaOutlines().

1252 {
1253  int removed = 0;
1254 
1255  ITERATOR iterator = IterateWithHoles();
1256 
1257  VECTOR2I contourStart = *iterator;
1258  VECTOR2I segmentStart, segmentEnd;
1259 
1260  VERTEX_INDEX indexStart;
1261 
1262  while( iterator )
1263  {
1264  // Obtain first point and its index
1265  segmentStart = *iterator;
1266  indexStart = iterator.GetIndex();
1267 
1268  // Obtain last point
1269  if( iterator.IsEndContour() )
1270  {
1271  segmentEnd = contourStart;
1272 
1273  // Advance
1274  iterator++;
1275 
1276  if( iterator )
1277  contourStart = *iterator;
1278  }
1279  else
1280  {
1281  // Advance
1282  iterator++;
1283 
1284  if( iterator )
1285  segmentEnd = *iterator;
1286  }
1287 
1288  // Remove segment start if both points are equal
1289  if( segmentStart == segmentEnd )
1290  {
1291  RemoveVertex( indexStart );
1292  removed++;
1293 
1294  // Advance the iterator one position, as there is one vertex less.
1295  if( iterator )
1296  iterator++;
1297  }
1298  }
1299 
1300  return removed;
1301 }
struct SHAPE_POLY_SET::VERTEX_INDEX VERTEX_INDEX
Struct VERTEX_INDEX.
ITERATOR_TEMPLATE< VECTOR2I > ITERATOR
ITERATOR IterateWithHoles()
Function IterateWithHoles.
void RemoveVertex(int aGlobalIndex)
Function RemoveVertex deletes the aGlobalIndex-th vertex.
void SHAPE_POLY_SET::RemoveVertex ( int  aGlobalIndex)

Function RemoveVertex deletes the aGlobalIndex-th vertex.

Parameters
aGlobalIndexis the global index of the to-be-removed vertex.

Definition at line 1410 of file shape_poly_set.cpp.

References GetRelativeIndices().

Referenced by Abort_Zone_Move_Corner_Or_Outlines(), PCB_EDIT_FRAME::Delete_LastCreatedCorner(), IsEmpty(), PCB_EDIT_FRAME::Remove_Zone_Corner(), POINT_EDITOR::removeCorner(), RemoveNullSegments(), and PCB_EDIT_FRAME::Start_Move_Zone_Corner().

1411 {
1412  VERTEX_INDEX index;
1413 
1414  // Assure the to be removed vertex exists, abort otherwise
1415  if( GetRelativeIndices( aGlobalIndex, &index ) )
1416  RemoveVertex( index );
1417  else
1418  throw( std::out_of_range( "aGlobalIndex-th vertex does not exist" ) );
1419 }
struct SHAPE_POLY_SET::VERTEX_INDEX VERTEX_INDEX
Struct VERTEX_INDEX.
bool GetRelativeIndices(int aGlobalIdx, VERTEX_INDEX *aRelativeIndices) const
Function GetRelativeIndices.
void RemoveVertex(int aGlobalIndex)
Function RemoveVertex deletes the aGlobalIndex-th vertex.
void SHAPE_POLY_SET::RemoveVertex ( VERTEX_INDEX  aRelativeIndices)

Function RemoveVertex deletes the vertex indexed by aIndex (index of polygon, contour and vertex).

Parameters
aRelativeIndicesis the set of relative indices of the to-be-removed vertex.

Definition at line 1422 of file shape_poly_set.cpp.

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.

1423 {
1424  m_polys[aIndex.m_polygon][aIndex.m_contour].Remove( aIndex.m_vertex );
1425 }
void SHAPE_POLY_SET::Rotate ( double  aAngle,
const VECTOR2I aCenter 
)

Function Rotate rotates all vertices by a given angle.

Parameters
aCenteris the rotation center
aAnglerotation angle in radians

Definition at line 1472 of file shape_poly_set.cpp.

References m_polys.

Referenced by D_CODE::ConvertShapeToPolygon(), export_vrml_polygon(), MODULE::GetBoundingPoly(), and TransformOvalClearanceToPolygon().

1473 {
1474  for( POLYGON& poly : m_polys )
1475  {
1476  for( SHAPE_LINE_CHAIN& path : poly )
1477  {
1478  path.Rotate( aAngle, aCenter );
1479  }
1480  }
1481 }
std::vector< SHAPE_LINE_CHAIN > POLYGON
represents a single polygon outline with holes.
Class SHAPE_LINE_CHAIN.
void SHAPE_POLY_SET::Simplify ( POLYGON_MODE  aFastMode)

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

Definition at line 1029 of file shape_poly_set.cpp.

References booleanOp(), and empty().

Referenced by CINFO3D_VISU::AddShapeWithClearanceToContainer(), D_PAD::buildCustomPadPolygon(), BOARD::CombineAreas(), ZONE_FILLER::computeRawFilledAreas(), MODULE::CoverageRatio(), CINFO3D_VISU::createBoardPolygon(), CINFO3D_VISU::createLayers(), CreateThermalReliefPadPolygon(), Fracture(), BOARD::GetBoardPolygonOutlines(), CPolyLine::NormalizeAreaOutlines(), NormalizeAreaOutlines(), PlotLayerOutlines(), ZONE_CONTAINER::TransformShapeWithClearanceToPolygon(), and Unfracture().

1030 {
1032 
1033  booleanOp( ctUnion, empty, aFastMode );
1034 }
void booleanOp(ClipperLib::ClipType aType, const SHAPE_POLY_SET &aOtherShape, POLYGON_MODE aFastMode)
Function booleanOp this is the engine to execute all polygon boolean transforms (AND, OR, ...
Class SHAPE_POLY_SET.
static bool empty(const wxTextEntryBase *aCtrl)
SHAPE_POLY_SET SHAPE_POLY_SET::Subset ( int  aFirstPolygon,
int  aLastPolygon 
)

Function Subset returns a subset of the polygons in this set, the ones between aFirstPolygon and aLastPolygon.

Parameters
aFirstPolygonis the first polygon to be included in the returned set.
aLastPolygonis the first polygon to be excluded of the returned set.
Returns
SHAPE_POLY_SET - a set containing the polygons between aFirstPolygon (included) and aLastPolygon (excluded).

Definition at line 263 of file shape_poly_set.cpp.

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

Referenced by Outline(), and UnitSet().

264 {
265  assert( aFirstPolygon >= 0 && aLastPolygon <= OutlineCount() );
266 
267  SHAPE_POLY_SET newPolySet;
268 
269  for( int index = aFirstPolygon; index < aLastPolygon; index++ )
270  {
271  newPolySet.m_polys.push_back( Polygon( index ) );
272  }
273 
274  return newPolySet;
275 }
int OutlineCount() const
Returns the number of outlines in the set
Class SHAPE_POLY_SET.
POLYGON & Polygon(int aIndex)
Returns the aIndex-th subpolygon in the set
int SHAPE_POLY_SET::TotalVertices ( ) const

Returns total number of vertices stored in the set.

Definition at line 1484 of file shape_poly_set.cpp.

References m_polys.

Referenced by EDIT_POINTS_FACTORY::buildForPolyOutline(), ZONE_CONTAINER::GetMsgPanelInfo(), ZONE_CONTAINER::GetNumCorners(), DRAWSEGMENT::HitTest(), ZONE_CONTAINER::HitTest(), InsertVertex(), IsEmpty(), PCB_EDIT_FRAME::Remove_Zone_Corner(), POINT_EDITOR::updateItem(), and POINT_EDITOR::updatePoints().

1485 {
1486  int c = 0;
1487 
1488  for( const POLYGON& poly : m_polys )
1489  {
1490  for( const SHAPE_LINE_CHAIN& path : poly )
1491  {
1492  c += path.PointCount();
1493  }
1494  }
1495 
1496  return c;
1497 }
std::vector< SHAPE_LINE_CHAIN > POLYGON
represents a single polygon outline with holes.
Class SHAPE_LINE_CHAIN.
unsigned int SHAPE_POLY_SET::TriangulatedPolyCount ( ) const
inline

Returns the number of triangulated polygons

Definition at line 553 of file shape_poly_set.h.

References m_triangulatedPolys.

Referenced by Convert_shape_line_polygon_to_triangles(), KIGFX::OPENGL_GAL::drawTriangulatedPolyset(), and SHAPE_POLY_SET().

553 { return m_triangulatedPolys.size(); }
std::vector< std::unique_ptr< TRIANGULATED_POLYGON > > m_triangulatedPolys
const TRIANGULATED_POLYGON* SHAPE_POLY_SET::TriangulatedPolygon ( int  aIndex) const
inline

Definition at line 611 of file shape_poly_set.h.

References m_triangulatedPolys.

Referenced by Convert_shape_line_polygon_to_triangles(), KIGFX::OPENGL_GAL::drawTriangulatedPolyset(), SHAPE_POLY_SET(), and PNS_KICAD_IFACE::syncZone().

612  {
613  return m_triangulatedPolys[aIndex].get();
614  }
std::vector< std::unique_ptr< TRIANGULATED_POLYGON > > m_triangulatedPolys
SHAPE_TYPE SHAPE::Type ( ) const
inlineinherited

Function Type()

Returns the type of the shape.

Return values
thetype

Definition at line 83 of file shape.h.

References SHAPE::m_type.

Referenced by PNS::DP_GATEWAYS::BuildFromPrimitivePair(), CollideShapes(), PNS::OPTIMIZER::computeBreakouts(), PNS::LOGGER::dumpShape(), PNS::SOLID::Hull(), ROUTER_PREVIEW_ITEM::ViewDraw(), and SHAPE_FILE_IO::Write().

84  {
85  return m_type;
86  }
SHAPE_TYPE m_type
type of our shape
Definition: shape.h:166
void SHAPE_POLY_SET::Unfracture ( POLYGON_MODE  aFastMode)

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

Definition at line 1018 of file shape_poly_set.cpp.

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

1019 {
1020  for( POLYGON& path : m_polys )
1021  {
1022  unfractureSingle( path );
1023  }
1024 
1025  Simplify( aFastMode ); // remove overlapping holes/degeneracy
1026 }
std::vector< SHAPE_LINE_CHAIN > POLYGON
represents a single polygon outline with holes.
void unfractureSingle(POLYGON &path)
void Simplify(POLYGON_MODE aFastMode)
Simplifies the polyset (merges overlapping polys, eliminates degeneracy/self-intersections) For aFast...
void SHAPE_POLY_SET::unfractureSingle ( SHAPE_POLY_SET::POLYGON aPoly)
private

Definition at line 842 of file shape_poly_set.cpp.

References SEG::A, SHAPE_LINE_CHAIN::Append(), SHAPE_LINE_CHAIN::Area(), SEG::B, SHAPE_LINE_CHAIN::CPoint(), SHAPE_LINE_CHAIN::CSegment(), i, next(), operator!=(), operator==(), and SHAPE_LINE_CHAIN::SetClosed().

Referenced by IsEmpty(), and Unfracture().

843 {
844  assert( aPoly.size() == 1 );
845 
846  struct EDGE
847  {
848  int m_index = 0;
849  SHAPE_LINE_CHAIN* m_poly = nullptr;
850  bool m_duplicate = false;
851 
852  EDGE( SHAPE_LINE_CHAIN* aPolygon, int aIndex ) :
853  m_index( aIndex ),
854  m_poly( aPolygon )
855  {}
856 
857  bool compareSegs( const SEG& s1, const SEG& s2 ) const
858  {
859  return (s1.A == s2.B && s1.B == s2.A);
860  }
861 
862  bool operator==( const EDGE& aOther ) const
863  {
864  return compareSegs( m_poly->CSegment( m_index ),
865  aOther.m_poly->CSegment( aOther.m_index ) );
866  }
867 
868  bool operator!=( const EDGE& aOther ) const
869  {
870  return !compareSegs( m_poly->CSegment( m_index ),
871  aOther.m_poly->CSegment( aOther.m_index ) );
872  }
873 
874  struct HASH
875  {
876  std::size_t operator()( const EDGE& aEdge ) const
877  {
878  const auto& a = aEdge.m_poly->CSegment( aEdge.m_index );
879 
880  return (std::size_t) ( a.A.x + a.B.x + a.A.y + a.B.y );
881  }
882  };
883  };
884 
885  struct EDGE_LIST_ENTRY
886  {
887  int index;
888  EDGE_LIST_ENTRY* next;
889  };
890 
891  std::unordered_set<EDGE, EDGE::HASH> uniqueEdges;
892 
893  auto lc = aPoly[0];
894  lc.Simplify();
895 
896  auto edgeList = std::make_unique<EDGE_LIST_ENTRY []>( lc.SegmentCount() );
897 
898  for( int i = 0; i < lc.SegmentCount(); i++ )
899  {
900  edgeList[i].index = i;
901  edgeList[i].next = &edgeList[ (i != lc.SegmentCount() - 1) ? i + 1 : 0 ];
902  }
903 
904  std::unordered_set<EDGE_LIST_ENTRY*> queue;
905 
906  for( int i = 0; i < lc.SegmentCount(); i++ )
907  {
908  EDGE e( &lc, i );
909  uniqueEdges.insert( e );
910  }
911 
912  for( int i = 0; i < lc.SegmentCount(); i++ )
913  {
914  EDGE e( &lc, i );
915  auto it = uniqueEdges.find( e );
916 
917  if( it != uniqueEdges.end() && it->m_index != i )
918  {
919  int e1 = it->m_index;
920  int e2 = i;
921 
922  if( e1 > e2 )
923  std::swap( e1, e2 );
924 
925  int e1_prev = e1 - 1;
926 
927  if( e1_prev < 0 )
928  e1_prev = lc.SegmentCount() - 1;
929 
930  int e2_prev = e2 - 1;
931 
932  if( e2_prev < 0 )
933  e2_prev = lc.SegmentCount() - 1;
934 
935  int e1_next = e1 + 1;
936 
937  if( e1_next == lc.SegmentCount() )
938  e1_next = 0;
939 
940  int e2_next = e2 + 1;
941 
942  if( e2_next == lc.SegmentCount() )
943  e2_next = 0;
944 
945  edgeList[e1_prev].next = &edgeList[ e2_next ];
946  edgeList[e2_prev].next = &edgeList[ e1_next ];
947  edgeList[i].next = nullptr;
948  edgeList[it->m_index].next = nullptr;
949  }
950  }
951 
952  for( int i = 0; i < lc.SegmentCount(); i++ )
953  {
954  if( edgeList[i].next )
955  queue.insert( &edgeList[i] );
956  }
957 
958  auto edgeBuf = std::make_unique<EDGE_LIST_ENTRY* []>( lc.SegmentCount() );
959 
960  int n = 0;
961  int outline = -1;
962 
963  POLYGON result;
964 
965  while( queue.size() )
966  {
967  auto e_first = (*queue.begin() );
968  auto e = e_first;
969  int cnt = 0;
970 
971  do {
972  edgeBuf[cnt++] = e;
973  e = e->next;
974  } while( e && e != e_first );
975 
976  SHAPE_LINE_CHAIN outl;
977 
978  for( int i = 0; i < cnt; i++ )
979  {
980  auto p = lc.CPoint( edgeBuf[i]->index );
981  outl.Append( p );
982  queue.erase( edgeBuf[i] );
983  }
984 
985  outl.SetClosed( true );
986 
987  bool cw = outl.Area() > 0.0;
988 
989  if( cw )
990  outline = n;
991 
992  result.push_back( outl );
993  n++;
994  }
995 
996  if( outline > 0 )
997  std::swap( result[0], result[outline] );
998 
999  aPoly = result;
1000 }
std::vector< SHAPE_LINE_CHAIN > POLYGON
represents a single polygon outline with holes.
CITER next(CITER it)
Definition: ptree.cpp:130
bool operator==(const PART_LIB &aLibrary, const wxString &aName)
Case insensitive library name comparison.
void Append(int aX, int aY, bool aAllowDuplication=false)
Function Append()
const SEG CSegment(int aIndex) const
Function CSegment()
void SetClosed(bool aClosed)
Function SetClosed()
Definition: seg.h:36
Class SHAPE_LINE_CHAIN.
double Area() const
size_t i
Definition: json11.cpp:597
VECTOR2I A
Definition: seg.h:46
const VECTOR2I & CPoint(int aIndex) const
Function CPoint()
bool operator!=(const PART_LIB &aLibrary, const wxString &aName)
VECTOR2I B
Definition: seg.h:47
SHAPE_POLY_SET SHAPE_POLY_SET::UnitSet ( int  aPolygonIndex)
inline

Definition at line 589 of file shape_poly_set.h.

References Subset().

Referenced by BOARD::NormalizeAreaPolygon().

590  {
591  return Subset( aPolygonIndex, aPolygonIndex + 1 );
592  }
SHAPE_POLY_SET Subset(int aFirstPolygon, int aLastPolygon)
Function Subset returns a subset of the polygons in this set, the ones between aFirstPolygon and aLas...
VECTOR2I & SHAPE_POLY_SET::Vertex ( int  aIndex,
int  aOutline,
int  aHole 
)

Returns the index-th vertex in a given hole outline within a given outline

Definition at line 278 of file shape_poly_set.cpp.

References m_polys.

Referenced by Abort_Zone_Move_Corner_Or_Outlines(), POINT_EDITOR::addCorner(), DRC::doFootprintOverlappingDrc(), D_CODE::DrawFlashedPolygon(), GERBER_FILE_IMAGE::Execute_DCODE_Command(), GERBER_FILE_IMAGE::Execute_G_Command(), findVertex(), ZONE_CONTAINER::Hatch(), ZONE_CONTAINER::HitTest(), ZONE_CONTAINER::MoveEdge(), ZONE_CONTAINER::SetCornerPosition(), Show_Zone_Corner_Or_Outline_While_Move_Mouse(), PCB_EDIT_FRAME::Start_Move_Zone_Corner(), POINT_EDITOR::updateItem(), and Vertex().

279 {
280  if( aOutline < 0 )
281  aOutline += m_polys.size();
282 
283  int idx;
284 
285  if( aHole < 0 )
286  idx = 0;
287  else
288  idx = aHole + 1;
289 
290  assert( aOutline < (int) m_polys.size() );
291  assert( idx < (int) m_polys[aOutline].size() );
292 
293  return m_polys[aOutline][idx].Point( aIndex );
294 }
VECTOR2I & SHAPE_POLY_SET::Vertex ( int  aGlobalIndex)

Returns the aGlobalIndex-th vertex in the poly set

Definition at line 316 of file shape_poly_set.cpp.

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.

317 {
319 
320  // Assure the passed index references a legal position; abort otherwise
321  if( !GetRelativeIndices( aGlobalIndex, &index ) )
322  throw( std::out_of_range( "aGlobalIndex-th vertex does not exist" ) );
323 
324  return m_polys[index.m_polygon][index.m_contour].Point( index.m_vertex );
325 }
Struct VERTEX_INDEX.
bool GetRelativeIndices(int aGlobalIdx, VERTEX_INDEX *aRelativeIndices) const
Function GetRelativeIndices.
VECTOR2I & SHAPE_POLY_SET::Vertex ( SHAPE_POLY_SET::VERTEX_INDEX  index)

Returns the index-th vertex in a given hole outline within a given outline

Definition at line 340 of file shape_poly_set.cpp.

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

341 {
342  return Vertex( index.m_vertex, index.m_polygon, index.m_contour - 1 );
343 }
VECTOR2I & Vertex(int aIndex, int aOutline, int aHole)
Returns the index-th vertex in a given hole outline within a given outline
VECTOR2I& SHAPE_POLY_SET::vertex ( int  aCornerId)
private

Referenced by IsEmpty().

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

Returns the number of vertices in a given outline/hole

Definition at line 238 of file shape_poly_set.cpp.

References m_polys.

Referenced by D_CODE::DrawFlashedPolygon(), DRAWSEGMENT::GetPointCount(), and OutlineCount().

239 {
240  if( m_polys.size() == 0 ) // Empty poly set
241  return 0;
242 
243  if( aOutline < 0 ) // Use last outline
244  aOutline += m_polys.size();
245 
246  int idx;
247 
248  if( aHole < 0 )
249  idx = 0;
250  else
251  idx = aHole + 1;
252 
253  if( aOutline >= (int) m_polys.size() ) // not existing outline
254  return 0;
255 
256  if( idx >= (int) m_polys[aOutline].size() ) // not existing hole
257  return 0;
258 
259  return m_polys[aOutline][idx].PointCount();
260 }

Member Data Documentation

MD5_HASH SHAPE_POLY_SET::m_hash
private
std::vector<std::unique_ptr<TRIANGULATED_POLYGON> > SHAPE_POLY_SET::m_triangulatedPolys
private
bool SHAPE_POLY_SET::m_triangulationValid = false
private
SHAPE_TYPE SHAPE::m_type
protectedinherited

type of our shape

Definition at line 166 of file shape.h.

Referenced by SHAPE::Type().


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