Re: [Kicad-developers] Question on Connectivity Algo

Cool. Thanks, Seth! > On 7 Aug 2018, at 20:43, Seth Hillbrand wrote: > > Am Di., 7. Aug. 2018 um 12:13 Uhr schrieb Jeff Young >: > So the polygon of a zone and the zone boundary points are two distinct data > structures? (And the polygon both has the fillet shapes and

Re: [Kicad-developers] Question on Connectivity Algo

So the polygon of a zone and the zone boundary points are two distinct data structures? (And the polygon both has the fillet shapes and is inset by half the minThickness width?) Thanks, Jeff. > On 7 Aug 2018, at 19:35, jp charras wrote: > > Le 07/08/2018 à 20:14, Seth Hillbrand a écrit : >>

Re: [Kicad-developers] Question on Connectivity Algo

Am Di., 7. Aug. 2018 um 12:13 Uhr schrieb Jeff Young : > So the polygon of a zone and the zone boundary points are two distinct > data structures? (And the polygon both has the fillet shapes and is inset > by half the minThickness width?) > The polygon (m_Poly) of the zone is just the area that

Re: [Kicad-developers] Question on Connectivity Algo

Le 07/08/2018 à 20:14, Seth Hillbrand a écrit : > Hi Jeff- > > Am Di., 7. Aug. 2018 um 08:07 Uhr schrieb Jeff Young >: > > When building zone connectivity, we go through the following two > routines: > > bool ContainsPoint( const VECTOR2I p ) const > { >

Re: [Kicad-developers] Question on Connectivity Algo

Hi Jeff- Am Di., 7. Aug. 2018 um 08:07 Uhr schrieb Jeff Young : > When building zone connectivity, we go through the following two routines: > > bool ContainsPoint( const VECTOR2I p ) const > { > auto zone = static_cast ( Parent() ); > return m_cachedPoly->ContainsPoint( p, zone->GetMinTh

[Kicad-developers] Question on Connectivity Algo

When building zone connectivity, we go through the following two routines: bool ContainsPoint( const VECTOR2I p ) const { auto zone = static_cast ( Parent() ); return m_cachedPoly->ContainsPoint( p, zone->GetMinThickness() ); } int ContainsPoint( const VECTOR2I& aP, int aClearance = 0 )