KiCad PCB EDA Suite
shape_poly_set.cpp File Reference
#include <vector>
#include <cstdio>
#include <set>
#include <list>
#include <algorithm>
#include <unordered_set>
#include <memory>
#include <md5_hash.h>
#include <map>
#include <make_unique.h>
#include <geometry/geometry_utils.h>
#include <geometry/shape.h>
#include <geometry/shape_line_chain.h>
#include <geometry/shape_poly_set.h>
#include <geometry/polygon_triangulation.h>

Go to the source code of this file.

Classes

struct  FractureEdge
 

Macros

#define SEG_CNT_MAX   64
 

Typedefs

typedef std::vector< FractureEdge * > FractureEdgeSet
 

Functions

static int processEdge (FractureEdgeSet &edges, FractureEdge *edge)
 

Macro Definition Documentation

#define SEG_CNT_MAX   64

Referenced by SHAPE_POLY_SET::Inflate().

Typedef Documentation

typedef std::vector<FractureEdge*> FractureEdgeSet

Definition at line 653 of file shape_poly_set.cpp.

Function Documentation

static int processEdge ( FractureEdgeSet edges,
FractureEdge edge 
)
static

Definition at line 656 of file shape_poly_set.cpp.

References dist, i, FractureEdge::m_connected, FractureEdge::m_next, FractureEdge::m_p1, FractureEdge::m_p2, max, rescale(), VECTOR2< T >::x, and VECTOR2< T >::y.

Referenced by SHAPE_POLY_SET::fractureSingle().

657 {
658  int x = edge->m_p1.x;
659  int y = edge->m_p1.y;
660  int min_dist = std::numeric_limits<int>::max();
661  int x_nearest = 0;
662 
663  FractureEdge* e_nearest = NULL;
664 
665  for( FractureEdgeSet::iterator i = edges.begin(); i != edges.end(); ++i )
666  {
667  if( !(*i)->matches( y ) )
668  continue;
669 
670  int x_intersect;
671 
672  if( (*i)->m_p1.y == (*i)->m_p2.y ) // horizontal edge
673  x_intersect = std::max( (*i)->m_p1.x, (*i)->m_p2.x );
674  else
675  x_intersect = (*i)->m_p1.x + rescale( (*i)->m_p2.x - (*i)->m_p1.x, y - (*i)->m_p1.y,
676  (*i)->m_p2.y - (*i)->m_p1.y );
677 
678  int dist = ( x - x_intersect );
679 
680  if( dist >= 0 && dist < min_dist && (*i)->m_connected )
681  {
682  min_dist = dist;
683  x_nearest = x_intersect;
684  e_nearest = (*i);
685  }
686  }
687 
688  if( e_nearest && e_nearest->m_connected )
689  {
690  int count = 0;
691 
692  FractureEdge* lead1 =
693  new FractureEdge( true, VECTOR2I( x_nearest, y ), VECTOR2I( x, y ) );
694  FractureEdge* lead2 =
695  new FractureEdge( true, VECTOR2I( x, y ), VECTOR2I( x_nearest, y ) );
696  FractureEdge* split_2 =
697  new FractureEdge( true, VECTOR2I( x_nearest, y ), e_nearest->m_p2 );
698 
699  edges.push_back( split_2 );
700  edges.push_back( lead1 );
701  edges.push_back( lead2 );
702 
703  FractureEdge* link = e_nearest->m_next;
704 
705  e_nearest->m_p2 = VECTOR2I( x_nearest, y );
706  e_nearest->m_next = lead1;
707  lead1->m_next = edge;
708 
709  FractureEdge* last;
710 
711  for( last = edge; last->m_next != edge; last = last->m_next )
712  {
713  last->m_connected = true;
714  count++;
715  }
716 
717  last->m_connected = true;
718  last->m_next = lead2;
719  lead2->m_next = split_2;
720  split_2->m_next = link;
721 
722  return count + 1;
723  }
724 
725  return 0;
726 }
static const int dist[10][10]
Definition: ar_matrix.cpp:320
VECTOR2< int > VECTOR2I
Definition: vector2d.h:587
int rescale(int aNumerator, int aValue, int aDenominator)
Definition: math_util.cpp:32
#define max(a, b)
Definition: auxiliary.h:86
FractureEdge * m_next
size_t i
Definition: json11.cpp:597