KiCad PCB EDA Suite
shape_poly_set.cpp File Reference
#include <vector>
#include <cstdio>
#include <set>
#include <list>
#include <algorithm>
#include <geometry/shape.h>
#include <geometry/shape_line_chain.h>
#include <geometry/shape_poly_set.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 412 of file shape_poly_set.cpp.

Function Documentation

static int processEdge ( FractureEdgeSet edges,
FractureEdge edge 
)
static

Definition at line 414 of file shape_poly_set.cpp.

References dist, 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().

415 {
416  int x = edge->m_p1.x;
417  int y = edge->m_p1.y;
418  int min_dist = std::numeric_limits<int>::max();
419  int x_nearest = 0;
420 
421  FractureEdge* e_nearest = NULL;
422 
423  for( FractureEdgeSet::iterator i = edges.begin(); i != edges.end(); ++i )
424  {
425  if( !(*i)->matches( y ) )
426  continue;
427 
428  int x_intersect;
429 
430  if( (*i)->m_p1.y == (*i)->m_p2.y ) // horizontal edge
431  x_intersect = std::max ( (*i)->m_p1.x, (*i)->m_p2.x );
432  else
433  x_intersect = (*i)->m_p1.x + rescale((*i)->m_p2.x - (*i)->m_p1.x, y - (*i)->m_p1.y, (*i)->m_p2.y - (*i)->m_p1.y );
434 
435  int dist = ( x - x_intersect );
436 
437  if( dist >= 0 && dist < min_dist && (*i)->m_connected )
438  {
439  min_dist = dist;
440  x_nearest = x_intersect;
441  e_nearest = (*i);
442  }
443  }
444 
445  if( e_nearest && e_nearest->m_connected )
446  {
447  int count = 0;
448 
449  FractureEdge* lead1 = new FractureEdge( true, VECTOR2I( x_nearest, y ), VECTOR2I( x, y ) );
450  FractureEdge* lead2 = new FractureEdge( true, VECTOR2I( x, y ), VECTOR2I( x_nearest, y ) );
451  FractureEdge* split_2 = new FractureEdge( true, VECTOR2I( x_nearest, y ), e_nearest->m_p2 );
452 
453  edges.push_back( split_2 );
454  edges.push_back( lead1 );
455  edges.push_back( lead2 );
456 
457  FractureEdge* link = e_nearest->m_next;
458 
459  e_nearest->m_p2 = VECTOR2I( x_nearest, y );
460  e_nearest->m_next = lead1;
461  lead1->m_next = edge;
462 
463  FractureEdge*last;
464  for( last = edge; last->m_next != edge; last = last->m_next )
465  {
466  last->m_connected = true;
467  count++;
468  }
469 
470  last->m_connected = true;
471  last->m_next = lead2;
472  lead2->m_next = split_2;
473  split_2->m_next = link;
474 
475  return count + 1;
476  }
477 
478  return 0;
479 }
static const int dist[10][10]
Definition: dist.cpp:57
VECTOR2< int > VECTOR2I
Definition: vector2d.h:580
int rescale(int aNumerator, int aValue, int aDenominator)
Definition: math_util.cpp:32
#define max(a, b)
Definition: auxiliary.h:86
FractureEdge * m_next