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

Go to the source code of this file.

Classes

struct  FractureEdge
 
class  SHAPE_POLY_SET::TRIANGULATION_CONTEXT
 
class  SHAPE_POLY_SET::TRIANGULATION_CONTEXT::comparePoints
 

Macros

#define SEG_CNT_MAX   64
 

Typedefs

typedef std::vector< FractureEdge * > FractureEdgeSet
 

Functions

static int processEdge (FractureEdgeSet &edges, FractureEdge *edge)
 
static int totalVertexCount (const SHAPE_POLY_SET::POLYGON &aPoly)
 

Macro Definition Documentation

#define SEG_CNT_MAX   64

Referenced by SHAPE_POLY_SET::Inflate().

Typedef Documentation

typedef std::vector<FractureEdge*> FractureEdgeSet

Definition at line 697 of file shape_poly_set.cpp.

Function Documentation

static int processEdge ( FractureEdgeSet edges,
FractureEdge edge 
)
static

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

701 {
702  int x = edge->m_p1.x;
703  int y = edge->m_p1.y;
704  int min_dist = std::numeric_limits<int>::max();
705  int x_nearest = 0;
706 
707  FractureEdge* e_nearest = NULL;
708 
709  for( FractureEdgeSet::iterator i = edges.begin(); i != edges.end(); ++i )
710  {
711  if( !(*i)->matches( y ) )
712  continue;
713 
714  int x_intersect;
715 
716  if( (*i)->m_p1.y == (*i)->m_p2.y ) // horizontal edge
717  x_intersect = std::max( (*i)->m_p1.x, (*i)->m_p2.x );
718  else
719  x_intersect = (*i)->m_p1.x + rescale( (*i)->m_p2.x - (*i)->m_p1.x, y - (*i)->m_p1.y,
720  (*i)->m_p2.y - (*i)->m_p1.y );
721 
722  int dist = ( x - x_intersect );
723 
724  if( dist >= 0 && dist < min_dist && (*i)->m_connected )
725  {
726  min_dist = dist;
727  x_nearest = x_intersect;
728  e_nearest = (*i);
729  }
730  }
731 
732  if( e_nearest && e_nearest->m_connected )
733  {
734  int count = 0;
735 
736  FractureEdge* lead1 =
737  new FractureEdge( true, VECTOR2I( x_nearest, y ), VECTOR2I( x, y ) );
738  FractureEdge* lead2 =
739  new FractureEdge( true, VECTOR2I( x, y ), VECTOR2I( x_nearest, y ) );
740  FractureEdge* split_2 =
741  new FractureEdge( true, VECTOR2I( x_nearest, y ), e_nearest->m_p2 );
742 
743  edges.push_back( split_2 );
744  edges.push_back( lead1 );
745  edges.push_back( lead2 );
746 
747  FractureEdge* link = e_nearest->m_next;
748 
749  e_nearest->m_p2 = VECTOR2I( x_nearest, y );
750  e_nearest->m_next = lead1;
751  lead1->m_next = edge;
752 
753  FractureEdge* last;
754 
755  for( last = edge; last->m_next != edge; last = last->m_next )
756  {
757  last->m_connected = true;
758  count++;
759  }
760 
761  last->m_connected = true;
762  last->m_next = lead2;
763  lead2->m_next = split_2;
764  split_2->m_next = link;
765 
766  return count + 1;
767  }
768 
769  return 0;
770 }
static const int dist[10][10]
Definition: dist.cpp:57
VECTOR2< int > VECTOR2I
Definition: vector2d.h:589
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
static int totalVertexCount ( const SHAPE_POLY_SET::POLYGON aPoly)
static

Definition at line 2022 of file shape_poly_set.cpp.

Referenced by SHAPE_POLY_SET::triangulateSingle().

2023 {
2024  int cnt = 0;
2025 
2026  for( const auto& outl : aPoly )
2027  {
2028  cnt += outl.PointCount();
2029  }
2030 
2031  return cnt;
2032 }