KiCad PCB EDA Suite
Loading...
Searching...
No Matches
shape_line_chain.h
Go to the documentation of this file.
1/*
2 * This program source code file is part of KiCad, a free EDA CAD application.
3 *
4 * Copyright (C) 2013 CERN
5 * @author Tomasz Wlostowski <[email protected]>
6 * Copyright (C) 2013-2024 KiCad Developers, see AUTHORS.txt for contributors.
7 *
8 * This program is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU General Public License
10 * as published by the Free Software Foundation; either version 2
11 * of the License, or (at your option) any later version.
12 *
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
17 *
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, you may find one here:
20 * http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
21 * or you may search the http://www.gnu.org website for the version 2 license,
22 * or you may write to the Free Software Foundation, Inc.,
23 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
24 */
25
26#ifndef __SHAPE_LINE_CHAIN
27#define __SHAPE_LINE_CHAIN
28
29
30#include <clipper.hpp>
31#include <clipper2/clipper.h>
32#include <geometry/seg.h>
33#include <geometry/shape.h>
34#include <geometry/shape_arc.h>
36#include <math/vector2d.h>
37
43{
45 {
46 m_FirstArcIdx = -1;
47 m_SecondArcIdx = -1;
48 }
49
50 CLIPPER_Z_VALUE( const std::pair<ssize_t, ssize_t> aShapeIndices, ssize_t aOffset = 0 )
51 {
52 m_FirstArcIdx = aShapeIndices.first;
53 m_SecondArcIdx = aShapeIndices.second;
54
55 auto offsetVal = [&]( ssize_t& aVal )
56 {
57 if( aVal >= 0 )
58 aVal += aOffset;
59 };
60
61 offsetVal( m_FirstArcIdx );
62 offsetVal( m_SecondArcIdx );
63 }
64
67};
68
69
83{
84public:
85 typedef std::vector<VECTOR2I>::iterator point_iter;
86 typedef std::vector<VECTOR2I>::const_iterator point_citer;
87
92 {
95
98
102
105
110
114 bool valid;
115
117 index_our( -1 ),
118 index_their( -1 ),
119 is_corner_our( false ),
120 is_corner_their( false ),
121 valid( false )
122 {
123 }
124 };
125
126
132 {
133 public:
134 POINT_INSIDE_TRACKER( const VECTOR2I& aPoint );
135
136 void AddPolyline( const SHAPE_LINE_CHAIN& aPolyline );
137 bool IsInside();
138
139 private:
140
141 bool processVertex ( const VECTOR2I& ip, const VECTOR2I& ipNext );
142
149 };
150
151 typedef std::vector<INTERSECTION> INTERSECTIONS;
152
153
159 m_closed( false ),
160 m_width( 0 )
161 {}
162
165 m_points( aShape.m_points ),
166 m_shapes( aShape.m_shapes ),
167 m_arcs( aShape.m_arcs ),
168 m_closed( aShape.m_closed ),
169 m_width( aShape.m_width ),
170 m_bbox( aShape.m_bbox )
171 {}
172
173 SHAPE_LINE_CHAIN( const std::vector<int>& aV );
174
175 SHAPE_LINE_CHAIN( const std::vector<VECTOR2I>& aV, bool aClosed = false );
176
177 SHAPE_LINE_CHAIN( const SHAPE_ARC& aArc, bool aClosed = false );
178
179 SHAPE_LINE_CHAIN( const ClipperLib::Path& aPath,
180 const std::vector<CLIPPER_Z_VALUE>& aZValueBuffer,
181 const std::vector<SHAPE_ARC>& aArcBuffer );
182
183 SHAPE_LINE_CHAIN( const Clipper2Lib::Path64& aPath,
184 const std::vector<CLIPPER_Z_VALUE>& aZValueBuffer,
185 const std::vector<SHAPE_ARC>& aArcBuffer );
186
188 {}
189
202 virtual bool Collide( const VECTOR2I& aP, int aClearance = 0, int* aActual = nullptr,
203 VECTOR2I* aLocation = nullptr ) const override;
204
217 virtual bool Collide( const SEG& aSeg, int aClearance = 0, int* aActual = nullptr,
218 VECTOR2I* aLocation = nullptr ) const override;
219
229 bool ClosestPoints( const SHAPE_LINE_CHAIN& aOther, VECTOR2I& aPt0, VECTOR2I& aPt1 ) const;
230
231 static bool ClosestPoints( const point_citer& aMyStart, const point_citer& aMyEnd,
232 const point_citer& aOtherStart, const point_citer& aOtherEnd,
233 VECTOR2I& aPt0, VECTOR2I& aPt1, int64_t& aDistSq );
234
235 static bool ClosestSegments( const VECTOR2I& aMyPrevPt, const point_citer& aMyStart,
236 const point_citer& aMyEnd, const VECTOR2I& aOtherPrevPt,
237 const point_citer& aOtherStart, const point_citer& aOtherEnd,
238 VECTOR2I& aPt0, VECTOR2I& aPt1, int64_t& aDistSq );
239
251 bool ClosestSegmentsFast( const SHAPE_LINE_CHAIN& aOther, VECTOR2I& aPt0,
252 VECTOR2I& aPt1 ) const;
253
255
256 SHAPE* Clone() const override;
257
261 void Clear()
262 {
263 m_points.clear();
264 m_arcs.clear();
265 m_shapes.clear();
266 m_closed = false;
267 }
268
275 void SetClosed( bool aClosed )
276 {
277 m_closed = aClosed;
279 }
280
284 bool IsClosed() const override
285 {
286 return m_closed;
287 }
288
294 void SetWidth( int aWidth )
295 {
296 m_width = aWidth;
297 }
298
304 int Width() const
305 {
306 return m_width;
307 }
308
314 int SegmentCount() const
315 {
316 int c = m_points.size() - 1;
317
318 if( m_closed )
319 c++;
320
321 return std::max( 0, c );
322 }
323
331 int ShapeCount() const;
332
333
338
345 void Simplify( int aMaxError = 0 );
346
352 int PointCount() const
353 {
354 return m_points.size();
355 }
356
364 SEG Segment( int aIndex ) const;
365
373 const SEG CSegment( int aIndex ) const { return Segment( aIndex ); }
374
387 int NextShape( int aPointIndex ) const;
388
395 void SetPoint( int aIndex, const VECTOR2I& aPos );
396
403 const VECTOR2I& CPoint( int aIndex ) const
404 {
405 if( aIndex < 0 )
406 aIndex += PointCount();
407 else if( aIndex >= PointCount() )
408 aIndex -= PointCount();
409
410 return m_points[aIndex];
411 }
412
413 const std::vector<VECTOR2I>& CPoints() const
414 {
415 return m_points;
416 }
417
421 const VECTOR2I& CLastPoint() const
422 {
423 return m_points[static_cast<size_t>( PointCount() ) - 1];
424 }
425
429 const std::vector<SHAPE_ARC>& CArcs() const
430 {
431 return m_arcs;
432 }
433
437 const std::vector<std::pair<ssize_t, ssize_t>>& CShapes() const
438 {
439 return m_shapes;
440 }
441
443 const BOX2I BBox( int aClearance = 0 ) const override
444 {
445 BOX2I bbox;
446 bbox.Compute( m_points );
447
448 if( aClearance != 0 || m_width != 0 )
449 bbox.Inflate( aClearance + m_width );
450
451 return bbox;
452 }
453
454 void GenerateBBoxCache() const
455 {
457
458 if( m_width != 0 )
460 }
461
462 BOX2I* GetCachedBBox() const override
463 {
464 return &m_bbox;
465 }
466
472 const SHAPE_LINE_CHAIN Reverse() const;
473
479 void ClearArcs();
480
486 long long int Length() const;
487
491 void ReservePoints( size_t aSize )
492 {
493 m_points.reserve( aSize );
494 }
495
505 void Append( int aX, int aY, bool aAllowDuplication = false )
506 {
507 VECTOR2I v( aX, aY );
508 Append( v, aAllowDuplication );
509 }
510
519 void Append( const VECTOR2I& aP, bool aAllowDuplication = false )
520 {
521 if( m_points.size() == 0 )
522 m_bbox = BOX2I( aP, VECTOR2I( 0, 0 ) );
523
524 if( m_points.size() == 0 || aAllowDuplication || CPoint( -1 ) != aP )
525 {
526 m_points.push_back( aP );
527 m_shapes.push_back( SHAPES_ARE_PT );
528 m_bbox.Merge( aP );
529 }
530 }
531
537 void Append( const SHAPE_LINE_CHAIN& aOtherLine );
538
539 void Append( const SHAPE_ARC& aArc );
540 void Append( const SHAPE_ARC& aArc, double aAccuracy );
541
542 void Insert( size_t aVertex, const VECTOR2I& aP );
543
544 void Insert( size_t aVertex, const SHAPE_ARC& aArc );
545
553 void Replace( int aStartIndex, int aEndIndex, const VECTOR2I& aP );
554
563 void Replace( int aStartIndex, int aEndIndex, const SHAPE_LINE_CHAIN& aLine );
564
571 void Remove( int aStartIndex, int aEndIndex );
572
578 void Remove( int aIndex )
579 {
580 Remove( aIndex, aIndex );
581 }
582
591 void RemoveShape( int aPointIndex );
592
601 int Split( const VECTOR2I& aP, bool aExact = false );
602
609 int Find( const VECTOR2I& aP, int aThreshold = 0 ) const;
610
617 int FindSegment( const VECTOR2I& aP, int aThreshold = 1 ) const;
618
626 const SHAPE_LINE_CHAIN Slice( int aStartIndex, int aEndIndex = -1 ) const;
627
629 {
631 m_origin( aOrigin )
632 {}
633
634 bool operator()( const INTERSECTION& aA, const INTERSECTION& aB )
635 {
636 return ( m_origin - aA.p ).EuclideanNorm() < ( m_origin - aB.p ).EuclideanNorm();
637 }
638
640 };
641
642 bool Intersects( const SHAPE_LINE_CHAIN& aChain ) const;
643
652 int Intersect( const SEG& aSeg, INTERSECTIONS& aIp ) const;
653
662 int Intersect( const SHAPE_LINE_CHAIN& aChain, INTERSECTIONS& aIp,
663 bool aExcludeColinearAndTouching = false,
664 BOX2I* aChainBBox = nullptr ) const;
665
672 int PathLength( const VECTOR2I& aP, int aIndex = -1 ) const;
673
681 bool CheckClearance( const VECTOR2I& aP, const int aDist) const;
682
688 const std::optional<INTERSECTION> SelfIntersecting() const;
689
695 const std::optional<INTERSECTION> SelfIntersectingWithArcs() const;
696
703 int NearestSegment( const VECTOR2I& aP ) const;
704
713 const VECTOR2I NearestPoint( const VECTOR2I& aP, bool aAllowInternalShapePoints = true ) const;
714
723 const VECTOR2I NearestPoint( const SEG& aSeg, int& dist ) const;
724
726 const std::string Format( bool aCplusPlus = true ) const override;
727
729 bool Parse( std::stringstream& aStream ) override;
730
731 bool operator!=( const SHAPE_LINE_CHAIN& aRhs ) const
732 {
733 if( PointCount() != aRhs.PointCount() )
734 return true;
735
736 for( int i = 0; i < PointCount(); i++ )
737 {
738 if( CPoint( i ) != aRhs.CPoint( i ) )
739 return true;
740 }
741
742 return false;
743 }
744
745 bool CompareGeometry( const SHAPE_LINE_CHAIN& aOther ) const;
746
747 void Move( const VECTOR2I& aVector ) override
748 {
749 for( auto& pt : m_points )
750 pt += aVector;
751
752 for( auto& arc : m_arcs )
753 arc.Move( aVector );
754
755 m_bbox.Move( aVector );
756 }
757
765 void Mirror( bool aX = true, bool aY = false, const VECTOR2I& aRef = { 0, 0 } );
766
772 void Mirror( const SEG& axis );
773
780 void Rotate( const EDA_ANGLE& aAngle, const VECTOR2I& aCenter = { 0, 0 } ) override;
781
782 bool IsSolid() const override
783 {
784 return false;
785 }
786
787 const VECTOR2I PointAlong( int aPathLength ) const;
788
794 double Area( bool aAbsolute = true ) const;
795
805 void Split( const VECTOR2I& aStart, const VECTOR2I& aEnd, SHAPE_LINE_CHAIN& aPre,
806 SHAPE_LINE_CHAIN& aMid, SHAPE_LINE_CHAIN& aPost ) const;
807
818 bool OffsetLine( int aAmount, CORNER_STRATEGY aCornerStrategy, int aMaxError,
819 SHAPE_LINE_CHAIN& aLeft, SHAPE_LINE_CHAIN& aRight,
820 bool aSimplify = false ) const;
821
822 size_t ArcCount() const
823 {
824 return m_arcs.size();
825 }
826
830 ssize_t ArcIndex( size_t aSegment ) const
831 {
832 if( IsSharedPt( aSegment ) )
833 return m_shapes[aSegment].second;
834 else
835 return m_shapes[aSegment].first;
836 }
837
838 const SHAPE_ARC& Arc( size_t aArc ) const
839 {
840 return m_arcs[aArc];
841 }
842
848 bool IsSharedPt( size_t aIndex ) const;
849
850 bool IsPtOnArc( size_t aPtIndex ) const;
851
852 bool IsArcSegment( size_t aSegment ) const;
853
854 bool IsArcStart( size_t aIndex ) const;
855
856 bool IsArcEnd( size_t aIndex ) const;
857
858 using SHAPE::Distance;
859
860 int Distance( const VECTOR2I& aP, bool aOutlineOnly ) const
861 {
862 return sqrt( SquaredDistance( aP, aOutlineOnly ) );
863 }
864
865 virtual const VECTOR2I GetPoint( int aIndex ) const override { return CPoint(aIndex); }
866 virtual const SEG GetSegment( int aIndex ) const override { return CSegment(aIndex); }
867 virtual size_t GetPointCount() const override { return PointCount(); }
868 virtual size_t GetSegmentCount() const override { return SegmentCount(); }
869
870 void TransformToPolygon( SHAPE_POLY_SET& aBuffer, int aError,
871 ERROR_LOC aErrorLoc ) const override;
872
873protected:
874 friend class SHAPE_POLY_SET;
875
881 void convertArc( ssize_t aArcIndex );
882
895 void splitArc( ssize_t aPtIndex, bool aCoincident = false );
896
897 void amendArc( size_t aArcIndex, const VECTOR2I& aNewStart, const VECTOR2I& aNewEnd );
898
899 void amendArcStart( size_t aArcIndex, const VECTOR2I& aNewStart )
900 {
901 amendArc( aArcIndex, aNewStart, m_arcs[aArcIndex].GetP1() );
902 }
903
904 void amendArcEnd( size_t aArcIndex, const VECTOR2I& aNewEnd )
905 {
906 amendArc( aArcIndex, m_arcs[aArcIndex].GetP0(), aNewEnd );
907 }
908
912 ssize_t reversedArcIndex( size_t aSegment ) const
913 {
914 if( IsSharedPt( aSegment ) )
915 return m_shapes[aSegment].first;
916 else
917 return m_shapes[aSegment].second;
918 }
919
923 ClipperLib::Path convertToClipper( bool aRequiredOrientation,
924 std::vector<CLIPPER_Z_VALUE>& aZValueBuffer,
925 std::vector<SHAPE_ARC>& aArcBuffer ) const;
926
930 Clipper2Lib::Path64 convertToClipper2( bool aRequiredOrientation,
931 std::vector<CLIPPER_Z_VALUE> &aZValueBuffer,
932 std::vector<SHAPE_ARC> &aArcBuffer ) const;
933
937 void fixIndicesRotation();
938
943
944private:
945
946 static const ssize_t SHAPE_IS_PT;
947
948 static const std::pair<ssize_t, ssize_t> SHAPES_ARE_PT;
949
951 std::vector<VECTOR2I> m_points;
952
967 std::vector<std::pair<ssize_t, ssize_t>> m_shapes;
968
969 std::vector<SHAPE_ARC> m_arcs;
970
973
980
982 mutable BOX2I m_bbox;
983};
984
985
986#endif // __SHAPE_LINE_CHAIN
BOX2< VECTOR2I > BOX2I
Definition: box2.h:877
void Move(const Vec &aMoveVector)
Move the rectangle by the aMoveVector.
Definition: box2.h:128
BOX2< Vec > & Inflate(coord_type dx, coord_type dy)
Inflates the rectangle horizontally by dx and vertically by dy.
Definition: box2.h:541
void Compute(const Container &aPointList)
Compute the bounding box from a given list of points.
Definition: box2.h:99
BOX2< Vec > & Merge(const BOX2< Vec > &aRect)
Modify the position and size of the rectangle in order to contain aRect.
Definition: box2.h:623
Definition: seg.h:42
A dynamic state checking if a point lies within polygon with a dynamically built outline ( with each ...
bool processVertex(const VECTOR2I &ip, const VECTOR2I &ipNext)
void AddPolyline(const SHAPE_LINE_CHAIN &aPolyline)
SEG::ecoord SquaredDistance(const VECTOR2I &aP, bool aOutlineOnly=false) const override
Represent a polyline containing arcs as well as line segments: A chain of connected line and/or arc s...
std::vector< std::pair< ssize_t, ssize_t > > m_shapes
Array of indices that refer to the index of the shape if the point is part of a larger shape,...
const SHAPE_LINE_CHAIN Reverse() const
Reverse point order in the line chain.
void Move(const VECTOR2I &aVector) override
bool IsPtOnArc(size_t aPtIndex) const
void amendArcStart(size_t aArcIndex, const VECTOR2I &aNewStart)
void Remove(int aIndex)
Remove the aIndex-th point from the line chain.
void amendArcEnd(size_t aArcIndex, const VECTOR2I &aNewEnd)
int Width() const
Get the current width of the segments in the chain.
const SHAPE_ARC & Arc(size_t aArc) const
void splitArc(ssize_t aPtIndex, bool aCoincident=false)
Splits an arc into two arcs at aPtIndex.
void Append(const VECTOR2I &aP, bool aAllowDuplication=false)
Append a new point at the end of the line chain.
const std::optional< INTERSECTION > SelfIntersecting() const
Check if the line chain is self-intersecting.
bool Parse(std::stringstream &aStream) override
bool CheckClearance(const VECTOR2I &aP, const int aDist) const
Check if point aP is closer to (or on) an edge or vertex of the line chain.
std::vector< SHAPE_ARC > m_arcs
int Distance(const VECTOR2I &aP, bool aOutlineOnly) const
bool IsClosed() const override
virtual const VECTOR2I GetPoint(int aIndex) const override
ClipperLib::Path convertToClipper(bool aRequiredOrientation, std::vector< CLIPPER_Z_VALUE > &aZValueBuffer, std::vector< SHAPE_ARC > &aArcBuffer) const
Create a new Clipper path from the SHAPE_LINE_CHAIN in a given orientation.
void SetPoint(int aIndex, const VECTOR2I &aPos)
Move a point to a specific location.
const VECTOR2I PointAlong(int aPathLength) const
int Split(const VECTOR2I &aP, bool aExact=false)
Insert the point aP belonging to one of the our segments, splitting the adjacent segment in two.
SHAPE_LINE_CHAIN & operator=(const SHAPE_LINE_CHAIN &)=default
void fixIndicesRotation()
Fix indices of this chain to ensure arcs are not split between the end and start indices.
std::vector< VECTOR2I > m_points
array of vertices
void GenerateBBoxCache() const
int FindSegment(const VECTOR2I &aP, int aThreshold=1) const
Search for segment containing point aP.
int ShapeCount() const
Return the number of shapes (line segments or arcs) in this line chain.
void SetClosed(bool aClosed)
Mark the line chain as closed (i.e.
ssize_t reversedArcIndex(size_t aSegment) const
Return the arc index for the given segment index, looking backwards.
int Intersect(const SEG &aSeg, INTERSECTIONS &aIp) const
Find all intersection points between our line chain and the segment aSeg.
bool Intersects(const SHAPE_LINE_CHAIN &aChain) const
void Simplify(int aMaxError=0)
Simplify the line chain by removing colinear adjacent segments and duplicate vertices.
SHAPE_LINE_CHAIN()
Initialize an empty line chain.
int m_width
Width of the segments (for BBox calculations in RTree) TODO Adjust usage of SHAPE_LINE_CHAIN to accou...
virtual ~SHAPE_LINE_CHAIN()
int PointCount() const
Return the number of points (vertices) in this line chain.
bool IsArcEnd(size_t aIndex) const
void Replace(int aStartIndex, int aEndIndex, const VECTOR2I &aP)
Replace points with indices in range [start_index, end_index] with a single point aP.
void TransformToPolygon(SHAPE_POLY_SET &aBuffer, int aError, ERROR_LOC aErrorLoc) const override
Fills a SHAPE_POLY_SET with a polygon representation of this shape.
virtual bool Collide(const VECTOR2I &aP, int aClearance=0, int *aActual=nullptr, VECTOR2I *aLocation=nullptr) const override
Check if point aP lies closer to us than aClearance.
void ClearArcs()
Remove all arc references in the line chain, resulting in a chain formed only of straight segments.
void ReservePoints(size_t aSize)
Allocate a number of points all at once (for performance).
void mergeFirstLastPointIfNeeded()
Merge the first and last point if they are the same and this chain is closed.
bool CompareGeometry(const SHAPE_LINE_CHAIN &aOther) const
ssize_t ArcIndex(size_t aSegment) const
Return the arc index for the given segment index.
void Clear()
Remove all points from the line chain.
SEG Segment(int aIndex) const
Return a copy of the aIndex-th segment in the line chain.
BOX2I m_bbox
cached bounding box
BOX2I * GetCachedBBox() const override
const SHAPE_LINE_CHAIN Slice(int aStartIndex, int aEndIndex=-1) const
Return a subset of this line chain containing the [start_index, end_index] range of points.
bool m_closed
is the line chain closed?
const std::vector< SHAPE_ARC > & CArcs() const
const std::optional< INTERSECTION > SelfIntersectingWithArcs() const
Check if the line chain is self-intersecting.
int NearestSegment(const VECTOR2I &aP) const
Find the segment nearest the given point.
int NextShape(int aPointIndex) const
Return the vertex index of the next shape in the chain, or -1 if aPointIndex is the last shape.
double Area(bool aAbsolute=true) const
Return the area of this chain.
void Mirror(bool aX=true, bool aY=false, const VECTOR2I &aRef={ 0, 0 })
Mirror the line points about y or x (or both).
void amendArc(size_t aArcIndex, const VECTOR2I &aNewStart, const VECTOR2I &aNewEnd)
virtual size_t GetPointCount() const override
bool ClosestPoints(const SHAPE_LINE_CHAIN &aOther, VECTOR2I &aPt0, VECTOR2I &aPt1) const
Finds closest points between this and the other line chain.
void Append(int aX, int aY, bool aAllowDuplication=false)
Append a new point at the end of the line chain.
void Rotate(const EDA_ANGLE &aAngle, const VECTOR2I &aCenter={ 0, 0 }) override
Rotate all vertices by a given angle.
virtual const SEG GetSegment(int aIndex) const override
const VECTOR2I & CPoint(int aIndex) const
Return a reference to a given point in the line chain.
bool operator!=(const SHAPE_LINE_CHAIN &aRhs) const
const std::vector< std::pair< ssize_t, ssize_t > > & CShapes() const
const VECTOR2I NearestPoint(const VECTOR2I &aP, bool aAllowInternalShapePoints=true) const
Find a point on the line chain that is closest to point aP.
std::vector< VECTOR2I >::iterator point_iter
int SegmentCount() const
Return the number of segments in this line chain.
int PathLength(const VECTOR2I &aP, int aIndex=-1) const
Compute the walk path length from the beginning of the line chain and the point aP belonging to our l...
const VECTOR2I & CLastPoint() const
Return the last point in the line chain.
bool ClosestSegmentsFast(const SHAPE_LINE_CHAIN &aOther, VECTOR2I &aPt0, VECTOR2I &aPt1) const
Finds closest points between segments of this and the other line chain.
const std::string Format(bool aCplusPlus=true) const override
static bool ClosestSegments(const VECTOR2I &aMyPrevPt, const point_citer &aMyStart, const point_citer &aMyEnd, const VECTOR2I &aOtherPrevPt, const point_citer &aOtherStart, const point_citer &aOtherEnd, VECTOR2I &aPt0, VECTOR2I &aPt1, int64_t &aDistSq)
SHAPE_LINE_CHAIN(const SHAPE_LINE_CHAIN &aShape)
Clipper2Lib::Path64 convertToClipper2(bool aRequiredOrientation, std::vector< CLIPPER_Z_VALUE > &aZValueBuffer, std::vector< SHAPE_ARC > &aArcBuffer) const
Create a new Clipper2 path from the SHAPE_LINE_CHAIN in a given orientation.
static const std::pair< ssize_t, ssize_t > SHAPES_ARE_PT
void convertArc(ssize_t aArcIndex)
Convert an arc to only a point chain by removing the arc and references.
virtual size_t GetSegmentCount() const override
void Remove(int aStartIndex, int aEndIndex)
Remove the range of points [start_index, end_index] from the line chain.
void RemoveDuplicatePoints()
Remove the duplicate points from the line chain.
size_t ArcCount() const
const SEG CSegment(int aIndex) const
Return a constant copy of the aIndex segment in the line chain.
bool IsArcSegment(size_t aSegment) const
void RemoveShape(int aPointIndex)
Remove the shape at the given index from the line chain.
void Insert(size_t aVertex, const VECTOR2I &aP)
bool IsArcStart(size_t aIndex) const
void SetWidth(int aWidth)
Set the width of all segments in the chain.
bool IsSharedPt(size_t aIndex) const
Test if a point is shared between multiple shapes.
std::vector< INTERSECTION > INTERSECTIONS
long long int Length() const
Return length of the line chain in Euclidean metric.
int Find(const VECTOR2I &aP, int aThreshold=0) const
Search for point aP.
const std::vector< VECTOR2I > & CPoints() const
const BOX2I BBox(int aClearance=0) const override
Compute a bounding box of the shape, with a margin of aClearance a collision.
std::vector< VECTOR2I >::const_iterator point_citer
SHAPE * Clone() const override
Return a dynamically allocated copy of the shape.
bool IsSolid() const override
static const ssize_t SHAPE_IS_PT
bool OffsetLine(int aAmount, CORNER_STRATEGY aCornerStrategy, int aMaxError, SHAPE_LINE_CHAIN &aLeft, SHAPE_LINE_CHAIN &aRight, bool aSimplify=false) const
Creates line chains aLeft and aRight offset to this line chain.
Represent a set of closed polygons.
An abstract shape on 2D plane.
Definition: shape.h:126
virtual int Distance(const VECTOR2I &aP) const
Returns the minimum distance from a given point to this shape.
Definition: shape.cpp:108
CORNER_STRATEGY
define how inflate transform build inflated polygon
ERROR_LOC
When approximating an arc or circle, should the error be placed on the outside or inside of the curve...
@ SH_LINE_CHAIN
line chain (polyline)
Definition: shape.h:49
Holds information on each point of a SHAPE_LINE_CHAIN that is retrievable after an operation with Cli...
CLIPPER_Z_VALUE(const std::pair< ssize_t, ssize_t > aShapeIndices, ssize_t aOffset=0)
Represent an intersection between two line segments.
bool is_corner_their
When true, the corner [index_their] of the 'their' line lies exactly on 'our' line.
bool is_corner_our
When true, the corner [index_our] of the 'our' line lies exactly on 'their' line.
int index_our
Index of the intersecting corner/segment in the 'our' (== this) line.
VECTOR2I p
Point of intersection between our and their.
bool valid
Auxiliary flag to avoid copying intersection info to intersection refining code, used by the refining...
int index_their
index of the intersecting corner/segment in the 'their' (Intersect() method parameter) line.
compareOriginDistance(const VECTOR2I &aOrigin)
bool operator()(const INTERSECTION &aA, const INTERSECTION &aB)
VECTOR2< int32_t > VECTOR2I
Definition: vector2d.h:673