Added wagyu and removed angus clipper

7 files changed, 70 insertions, 6211 deletions

diff --git a/CMakeLists.txt b/CMakeLists.txt
index 123158e2eb..49f3443d9e 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -51,6 +51,7 @@ mason_use(protozero VERSION 1.4.2 HEADER_ONLY)
 mason_use(pixelmatch VERSION 0.10.0 HEADER_ONLY)
 mason_use(geojson VERSION 0.4.0 HEADER_ONLY)
 mason_use(polylabel VERSION 1.0.2 HEADER_ONLY)
+mason_use(wagyu VERSION 0.4.1 HEADER_ONLY)
 
 add_definitions(-DRAPIDJSON_HAS_STDSTRING=1)
 
diff --git a/cmake/core-files.cmake b/cmake/core-files.cmake
index b10d7cff6c..9b5ddc97d6 100644
--- a/cmake/core-files.cmake
+++ b/cmake/core-files.cmake
@@ -35,10 +35,6 @@ set(MBGL_CORE_FILES
     src/mbgl/annotation/symbol_annotation_impl.cpp
     src/mbgl/annotation/symbol_annotation_impl.hpp
 
-    # clipper
-    src/clipper/clipper.cpp
-    src/clipper/clipper.hpp
-
     # csscolorparser
     src/csscolorparser/csscolorparser.cpp
     src/csscolorparser/csscolorparser.hpp
diff --git a/cmake/core.cmake b/cmake/core.cmake
index 59de7708b6..723139e368 100644
--- a/cmake/core.cmake
+++ b/cmake/core.cmake
@@ -24,6 +24,7 @@ target_add_mason_package(mbgl-core PRIVATE kdbush)
 target_add_mason_package(mbgl-core PRIVATE earcut)
 target_add_mason_package(mbgl-core PRIVATE protozero)
 target_add_mason_package(mbgl-core PRIVATE polylabel)
+target_add_mason_package(mbgl-core PRIVATE wagyu)
 
 mbgl_platform_core()
 
diff --git a/src/clipper/clipper.cpp b/src/clipper/clipper.cpp
deleted file mode 100644
index 5f4ac4d481..0000000000
--- a/src/clipper/clipper.cpp
+++ /dev/null
@@ -1,5687 +0,0 @@
-/*******************************************************************************

-*                                                                              *

-* Author    :  Angus Johnson                                                   *

-* Version   :  6.4.0                                                           *

-* Date      :  2 July 2015                                                     *

-* Website   :  http://www.angusj.com                                           *

-* Copyright :  Angus Johnson 2010-2015                                         *

-*                                                                              *

-* License:                                                                     *

-* Use, modification & distribution is subject to Boost Software License Ver 1. *

-* http://www.boost.org/LICENSE_1_0.txt                                         *

-*                                                                              *

-* Attributions:                                                                *

-* The code in this library is an extension of Bala Vatti's clipping algorithm: *

-* "A generic solution to polygon clipping"                                     *

-* Communications of the ACM, Vol 35, Issue 7 (July 1992) pp 56-63.             *

-* http://portal.acm.org/citation.cfm?id=129906                                 *

-*                                                                              *

-* Computer graphics and geometric modeling: implementation and algorithms      *

-* By Max K. Agoston                                                            *

-* Springer; 1 edition (January 4, 2005)                                        *

-* http://books.google.com/books?q=vatti+clipping+agoston                       *

-*                                                                              *

-* See also:                                                                    *

-* "Polygon Offsetting by Computing Winding Numbers"                            *

-* Paper no. DETC2005-85513 pp. 565-575                                         *

-* ASME 2005 International Design Engineering Technical Conferences             *

-* and Computers and Information in Engineering Conference (IDETC/CIE2005)      *

-* September 24-28, 2005 , Long Beach, California, USA                          *

-* http://www.me.berkeley.edu/~mcmains/pubs/DAC05OffsetPolygon.pdf              *

-*                                                                              *

-*******************************************************************************/

-

-/*******************************************************************************

-*                                                                              *

-* This is a translation of the Delphi Clipper library and the naming style     *

-* used has retained a Delphi flavour.                                          *

-*                                                                              *

-*******************************************************************************/

-

-#include "clipper.hpp"

-#include <cmath>

-#include <vector>

-#include <algorithm>

-#include <stdexcept>

-#include <cstring>

-#include <cstdlib>

-#include <ostream>

-#include <functional>

-#include <sstream>

-

-namespace ClipperLib {

-

-static double const pi = 3.141592653589793238;

-static double const two_pi = pi *2;

-static double const def_arc_tolerance = 0.25;

-

-enum Direction { dRightToLeft, dLeftToRight };

-

-static int const Unassigned = -1;  //edge not currently 'owning' a solution

-static int const Skip = -2;        //edge that would otherwise close a path

-

-#define HORIZONTAL (-1.0E+40)

-#define TOLERANCE (1.0e-20)

-#define NEAR_ZERO(val) (((val) > -TOLERANCE) && ((val) < TOLERANCE))

-

-struct TEdge {

-  IntPoint Bot;

-  IntPoint Curr; //current (updated for every new scanbeam)

-  IntPoint Top;

-  double Dx;

-  PolyType PolyTyp;

-  EdgeSide Side; //side only refers to current side of solution poly

-  int WindDelta; //1 or -1 depending on winding direction

-  int WindCnt;

-  int WindCnt2; //winding count of the opposite polytype

-  int OutIdx;

-  TEdge *Next;

-  TEdge *Prev;

-  TEdge *NextInLML;

-  TEdge *NextInAEL;

-  TEdge *PrevInAEL;

-  TEdge *NextInSEL;

-  TEdge *PrevInSEL;

-};

-

-struct IntersectNode {

-  TEdge          *Edge1;

-  TEdge          *Edge2;

-  IntPoint        Pt;

-};

-

-struct LocalMinimum {

-  cInt          y;

-  TEdge        *LeftBound;

-  TEdge        *RightBound;

-};

-

-struct OutPt;

-

-//OutRec: contains a path in the clipping solution. Edges in the AEL will

-//carry a pointer to an OutRec when they are part of the clipping solution.

-struct OutRec {

-  int       Idx;

-  bool      IsHole;

-  bool      IsOpen;

-  OutRec   *FirstLeft;  //see comments in clipper.pas

-  PolyNode *PolyNd;

-  OutPt    *Pts;

-  OutPt    *BottomPt;

-};

-

-struct OutPt {

-  int       Idx;

-  IntPoint  Pt;

-  OutPt    *Next;

-  OutPt    *Prev;

-};

-

-struct Join {

-  OutPt    *OutPt1;

-  OutPt    *OutPt2;

-  IntPoint  OffPt;

-};

-

-struct LocMinSorter

-{

-  inline bool operator()(const LocalMinimum& locMin1, const LocalMinimum& locMin2)

-  {

-    return locMin2.y < locMin1.y;

-  }

-};

-

-//------------------------------------------------------------------------------

-//------------------------------------------------------------------------------

-

-inline cInt Round(double val)

-{

-  if ((val < 0)) return static_cast<cInt>(val - 0.5); 

-  else return static_cast<cInt>(val + 0.5);

-}

-//------------------------------------------------------------------------------

-

-inline cInt Abs(cInt val)

-{

-  return val < 0 ? -val : val;

-}

-

-//------------------------------------------------------------------------------

-// PolyTree methods ...

-//------------------------------------------------------------------------------

-

-void PolyTree::Clear()

-{

-    for (PolyNodes::size_type i = 0; i < AllNodes.size(); ++i)

-      delete AllNodes[i];

-    AllNodes.resize(0); 

-    Childs.resize(0);

-}

-//------------------------------------------------------------------------------

-

-PolyNode* PolyTree::GetFirst() const

-{

-  if (!Childs.empty())

-      return Childs[0];

-  else

-      return 0;

-}

-//------------------------------------------------------------------------------

-

-int PolyTree::Total() const

-{

-  int result = (int)AllNodes.size();

-  //with negative offsets, ignore the hidden outer polygon ...

-  if (result > 0 && Childs[0] != AllNodes[0]) result--;

-  return result;

-}

-

-//------------------------------------------------------------------------------

-// PolyNode methods ...

-//------------------------------------------------------------------------------

-

-PolyNode::PolyNode(): Childs(), Parent(0), Index(0), m_IsOpen(false)

-{

-}

-//------------------------------------------------------------------------------

-

-int PolyNode::ChildCount() const

-{

-  return (int)Childs.size();

-}

-//------------------------------------------------------------------------------

-

-void PolyNode::AddChild(PolyNode& child)

-{

-  unsigned cnt = (unsigned)Childs.size();

-  Childs.push_back(&child);

-  child.Parent = this;

-  child.Index = cnt;

-}

-//------------------------------------------------------------------------------

-

-PolyNode* PolyNode::GetNext() const

-{ 

-  if (!Childs.empty()) 

-      return Childs[0]; 

-  else

-      return GetNextSiblingUp();    

-}  

-//------------------------------------------------------------------------------

-

-PolyNode* PolyNode::GetNextSiblingUp() const

-{ 

-  if (!Parent) //protects against PolyTree.GetNextSiblingUp()

-      return 0;

-  else if (Index == Parent->Childs.size() - 1)

-      return Parent->GetNextSiblingUp();

-  else

-      return Parent->Childs[Index + 1];

-}  

-//------------------------------------------------------------------------------

-

-bool PolyNode::IsHole() const

-{ 

-  bool result = true;

-  PolyNode* node = Parent;

-  while (node)

-  {

-      result = !result;

-      node = node->Parent;

-  }

-  return result;

-}  

-//------------------------------------------------------------------------------

-

-bool PolyNode::IsOpen() const

-{ 

-  return m_IsOpen;

-}  

-//------------------------------------------------------------------------------

-

-#ifndef use_int32

-

-//------------------------------------------------------------------------------

-// Int128 class (enables safe math on signed 64bit integers)

-// eg Int128 val1((long64)9223372036854775807); //ie 2^63 -1

-//    Int128 val2((long64)9223372036854775807);

-//    Int128 val3 = val1 * val2;

-//    val3.AsString => "85070591730234615847396907784232501249" (8.5e+37)

-//------------------------------------------------------------------------------

-

-class Int128

-{

-  public:

-    ulong64 lo;

-    long64 hi;

-

-    Int128(long64 _lo = 0)

-    {

-      lo = (ulong64)_lo;   

-      if (_lo < 0)  hi = -1; else hi = 0; 

-    }

-

-

-    Int128(const Int128 &val): lo(val.lo), hi(val.hi){}

-

-    Int128(const long64& _hi, const ulong64& _lo): lo(_lo), hi(_hi){}

-    

-    Int128& operator = (const long64 &val)

-    {

-      lo = (ulong64)val;

-      if (val < 0) hi = -1; else hi = 0;

-      return *this;

-    }

-

-    bool operator == (const Int128 &val) const

-      {return (hi == val.hi && lo == val.lo);}

-

-    bool operator != (const Int128 &val) const

-      { return !(*this == val);}

-

-    bool operator > (const Int128 &val) const

-    {

-      if (hi != val.hi)

-        return hi > val.hi;

-      else

-        return lo > val.lo;

-    }

-

-    bool operator < (const Int128 &val) const

-    {

-      if (hi != val.hi)

-        return hi < val.hi;

-      else

-        return lo < val.lo;

-    }

-

-    bool operator >= (const Int128 &val) const

-      { return !(*this < val);}

-

-    bool operator <= (const Int128 &val) const

-      { return !(*this > val);}

-

-    Int128& operator += (const Int128 &rhs)

-    {

-      hi += rhs.hi;

-      lo += rhs.lo;

-      if (lo < rhs.lo) hi++;

-      return *this;

-    }

-

-    Int128 operator + (const Int128 &rhs) const

-    {

-      Int128 result(*this);

-      result+= rhs;

-      return result;

-    }

-

-    Int128& operator -= (const Int128 &rhs)

-    {

-      *this += -rhs;

-      return *this;

-    }

-

-    Int128 operator - (const Int128 &rhs) const

-    {

-      Int128 result(*this);

-      result -= rhs;

-      return result;

-    }

-

-    Int128 operator-() const //unary negation

-    {

-      if (lo == 0)

-        return Int128(-hi, 0);

-      else

-        return Int128(~hi, ~lo + 1);

-    }

-

-    operator double() const

-    {

-      const double shift64 = 18446744073709551616.0; //2^64

-      if (hi < 0)

-      {

-        if (lo == 0) return (double)hi * shift64;

-        else return -(double)(~lo + ~hi * shift64);

-      }

-      else

-        return (double)(lo + hi * shift64);

-    }

-

-};

-//------------------------------------------------------------------------------

-

-Int128 Int128Mul (long64 lhs, long64 rhs)

-{

-  bool negate = (lhs < 0) != (rhs < 0);

-

-  if (lhs < 0) lhs = -lhs;

-  ulong64 int1Hi = ulong64(lhs) >> 32;

-  ulong64 int1Lo = ulong64(lhs & 0xFFFFFFFF);

-

-  if (rhs < 0) rhs = -rhs;

-  ulong64 int2Hi = ulong64(rhs) >> 32;

-  ulong64 int2Lo = ulong64(rhs & 0xFFFFFFFF);

-

-  //nb: see comments in clipper.pas

-  ulong64 a = int1Hi * int2Hi;

-  ulong64 b = int1Lo * int2Lo;

-  ulong64 c = int1Hi * int2Lo + int1Lo * int2Hi;

-

-  Int128 tmp;

-  tmp.hi = long64(a + (c >> 32));

-  tmp.lo = long64(c << 32);

-  tmp.lo += long64(b);

-  if (tmp.lo < b) tmp.hi++;

-  if (negate) tmp = -tmp;

-  return tmp;

-};

-#endif

-

-//------------------------------------------------------------------------------

-// Miscellaneous global functions

-//------------------------------------------------------------------------------

-

-bool Orientation(const Path &poly)

-{

-    return Area(poly) >= 0;

-}

-//------------------------------------------------------------------------------

-

-double Area(const Path &poly)

-{

-  int size = (int)poly.size();

-  if (size < 3) return 0;

-

-  double a = 0;

-  for (int i = 0, j = size -1; i < size; ++i)

-  {

-    a += ((double)poly[j].x + poly[i].x) * ((double)poly[j].y - poly[i].y);

-    j = i;

-  }

-  return -a * 0.5;

-}

-//------------------------------------------------------------------------------

-

-double Area(const OutPt *op)

-{

-  const OutPt *startOp = op;

-  if (!op) return 0;

-  double a = 0;

-  do {

-    a +=  (double)(op->Prev->Pt.x + op->Pt.x) * (double)(op->Prev->Pt.y - op->Pt.y);

-    op = op->Next;

-  } while (op != startOp);

-  return a * 0.5;

-}

-//------------------------------------------------------------------------------

-

-double Area(const OutRec &outRec)

-{

-  return Area(outRec.Pts);

-}

-//------------------------------------------------------------------------------

-

-bool PointIsVertex(const IntPoint &Pt, OutPt *pp)

-{

-  OutPt *pp2 = pp;

-  do

-  {

-    if (pp2->Pt == Pt) return true;

-    pp2 = pp2->Next;

-  }

-  while (pp2 != pp);

-  return false;

-}

-//------------------------------------------------------------------------------

-

-//See "The Point in Polygon Problem for Arbitrary Polygons" by Hormann & Agathos

-//http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.88.5498&rep=rep1&type=pdf

-int PointInPolygon(const IntPoint &pt, const Path &path)

-{

-  //returns 0 if false, +1 if true, -1 if pt ON polygon boundary

-  int result = 0;

-  size_t cnt = path.size();

-  if (cnt < 3) return 0;

-  IntPoint ip = path[0];

-  for(size_t i = 1; i <= cnt; ++i)

-  {

-    IntPoint ipNext = (i == cnt ? path[0] : path[i]);

-    if (ipNext.y == pt.y)

-    {

-        if ((ipNext.x == pt.x) || (ip.y == pt.y && 

-          ((ipNext.x > pt.x) == (ip.x < pt.x)))) return -1;

-    }

-    if ((ip.y < pt.y) != (ipNext.y < pt.y))

-    {

-      if (ip.x >= pt.x)

-      {

-        if (ipNext.x > pt.x) result = 1 - result;

-        else

-        {

-          double d = (double)(ip.x - pt.x) * (ipNext.y - pt.y) - 

-            (double)(ipNext.x - pt.x) * (ip.y - pt.y);

-          if (!d) return -1;

-          if ((d > 0) == (ipNext.y > ip.y)) result = 1 - result;

-        }

-      } else

-      {

-        if (ipNext.x > pt.x)

-        {

-          double d = (double)(ip.x - pt.x) * (ipNext.y - pt.y) - 

-            (double)(ipNext.x - pt.x) * (ip.y - pt.y);

-          if (!d) return -1;

-          if ((d > 0) == (ipNext.y > ip.y)) result = 1 - result;

-        }

-      }

-    }

-    ip = ipNext;

-  } 

-  return result;

-}

-//------------------------------------------------------------------------------

-

-int PointInPolygon (const IntPoint &pt, OutPt *op)

-{

-  //returns 0 if false, +1 if true, -1 if pt ON polygon boundary

-  int result = 0;

-  OutPt* startOp = op;

-  for(;;)

-  {

-    if (op->Next->Pt.y == pt.y)

-    {

-        if ((op->Next->Pt.x == pt.x) || (op->Pt.y == pt.y && 

-          ((op->Next->Pt.x > pt.x) == (op->Pt.x < pt.x)))) return -1;

-    }

-    if ((op->Pt.y < pt.y) != (op->Next->Pt.y < pt.y))

-    {

-      if (op->Pt.x >= pt.x)

-      {

-        if (op->Next->Pt.x > pt.x) result = 1 - result;

-        else

-        {

-          double d = (double)(op->Pt.x - pt.x) * (op->Next->Pt.y - pt.y) - 

-            (double)(op->Next->Pt.x - pt.x) * (op->Pt.y - pt.y);

-          if (!d) return -1;

-          if ((d > 0) == (op->Next->Pt.y > op->Pt.y)) result = 1 - result;

-        }

-      } else

-      {

-        if (op->Next->Pt.x > pt.x)

-        {

-          double d = (double)(op->Pt.x - pt.x) * (op->Next->Pt.y - pt.y) - 

-            (double)(op->Next->Pt.x - pt.x) * (op->Pt.y - pt.y);

-          if (!d) return -1;

-          if ((d > 0) == (op->Next->Pt.y > op->Pt.y)) result = 1 - result;

-        }

-      }

-    } 

-    op = op->Next;

-    if (startOp == op) break;

-  } 

-  return result;

-}

-//------------------------------------------------------------------------------

-

-bool Poly2ContainsPoly1(OutPt *OutPt1, OutPt *OutPt2)

-{

-  OutPt* op = OutPt1;

-  do

-  {

-    //nb: PointInPolygon returns 0 if false, +1 if true, -1 if pt on polygon

-    int res = PointInPolygon(op->Pt, OutPt2);

-    if (res >= 0) return res > 0;

-    op = op->Next; 

-  }

-  while (op != OutPt1);

-  return true; 

-}

-//----------------------------------------------------------------------

-

-bool SlopesEqual(const TEdge &e1, const TEdge &e2, bool UseFullInt64Range)

-{

-#ifndef use_int32

-  if (UseFullInt64Range)

-    return Int128Mul(e1.Top.y - e1.Bot.y, e2.Top.x - e2.Bot.x) == 

-    Int128Mul(e1.Top.x - e1.Bot.x, e2.Top.y - e2.Bot.y);

-  else 

-#endif

-    return (e1.Top.y - e1.Bot.y) * (e2.Top.x - e2.Bot.x) == 

-    (e1.Top.x - e1.Bot.x) * (e2.Top.y - e2.Bot.y);

-}

-//------------------------------------------------------------------------------

-

-bool SlopesEqual(const IntPoint pt1, const IntPoint pt2,

-  const IntPoint pt3, bool UseFullInt64Range)

-{

-#ifndef use_int32

-  if (UseFullInt64Range)

-    return Int128Mul(pt1.y-pt2.y, pt2.x-pt3.x) == Int128Mul(pt1.x-pt2.x, pt2.y-pt3.y);

-  else 

-#endif

-    return (pt1.y-pt2.y)*(pt2.x-pt3.x) == (pt1.x-pt2.x)*(pt2.y-pt3.y);

-}

-//------------------------------------------------------------------------------

-

-bool SlopesEqual(const IntPoint pt1, const IntPoint pt2,

-  const IntPoint pt3, const IntPoint pt4, bool UseFullInt64Range)

-{

-#ifndef use_int32

-  if (UseFullInt64Range)

-    return Int128Mul(pt1.y-pt2.y, pt3.x-pt4.x) == Int128Mul(pt1.x-pt2.x, pt3.y-pt4.y);

-  else 

-#endif

-    return (pt1.y-pt2.y)*(pt3.x-pt4.x) == (pt1.x-pt2.x)*(pt3.y-pt4.y);

-}

-//------------------------------------------------------------------------------

-

-inline bool IsHorizontal(TEdge &e)

-{

-  return e.Dx == HORIZONTAL;

-}

-//------------------------------------------------------------------------------

-

-inline double GetDx(const IntPoint pt1, const IntPoint pt2)

-{

-  return (pt1.y == pt2.y) ?

-    HORIZONTAL : (double)(pt2.x - pt1.x) / (pt2.y - pt1.y);

-}

-//---------------------------------------------------------------------------

-

-inline void SetDx(TEdge &e)

-{

-  cInt dy  = (e.Top.y - e.Bot.y);

-  if (dy == 0) e.Dx = HORIZONTAL;

-  else e.Dx = (double)(e.Top.x - e.Bot.x) / dy;

-}

-//---------------------------------------------------------------------------

-

-inline void SwapSides(TEdge &Edge1, TEdge &Edge2)

-{

-  EdgeSide Side =  Edge1.Side;

-  Edge1.Side = Edge2.Side;

-  Edge2.Side = Side;

-}

-//------------------------------------------------------------------------------

-

-inline void SwapPolyIndexes(TEdge &Edge1, TEdge &Edge2)

-{

-  int OutIdx =  Edge1.OutIdx;

-  Edge1.OutIdx = Edge2.OutIdx;

-  Edge2.OutIdx = OutIdx;

-}

-//------------------------------------------------------------------------------

-

-inline cInt TopX(TEdge &edge, const cInt currentY)

-{

-  return ( currentY == edge.Top.y ) ?

-    edge.Top.x : edge.Bot.x + Round(edge.Dx *(currentY - edge.Bot.y));

-}

-//------------------------------------------------------------------------------

-

-void IntersectPoint(TEdge &Edge1, TEdge &Edge2, IntPoint &ip)

-{

-#ifdef use_xyz  

-  ip.Z = 0;

-#endif

-

-  double b1, b2;

-  if (Edge1.Dx == Edge2.Dx)

-  {

-    ip.y = Edge1.Curr.y;

-    ip.x = TopX(Edge1, ip.y);

-    return;

-  }

-  else if (Edge1.Dx == 0.0)

-  {

-    ip.x = Edge1.Bot.x;

-    if (IsHorizontal(Edge2))

-      ip.y = Edge2.Bot.y;

-    else

-    {

-      b2 = Edge2.Bot.y - (Edge2.Bot.x / Edge2.Dx);

-      if (Edge2.Bot.x == Edge1.Bot.x) ip.y = Round(ip.x / Edge2.Dx + b2);

-      else if (Edge2.Bot.x < Edge1.Bot.x) ip.y = Round((ip.x - 0.5) / Edge2.Dx + b2);

-      else ip.y = Round((ip.x + 0.5) / Edge2.Dx + b2);

-    }

-  }

-  else if (Edge2.Dx == 0.0)

-  {

-    ip.x = Edge2.Bot.x;

-    if (IsHorizontal(Edge1))

-      ip.y = Edge1.Bot.y;

-    else

-    {

-      b1 = Edge1.Bot.y - (Edge1.Bot.x / Edge1.Dx);

-      if (Edge1.Bot.x == Edge2.Bot.x) ip.y = Round(ip.x / Edge1.Dx + b1);

-      else if (Edge1.Bot.x < Edge2.Bot.x) ip.y = Round((ip.x - 0.5) / Edge1.Dx + b1);

-      else ip.y = Round((ip.x + 0.5) / Edge1.Dx + b1);

-    }

-  } 

-  else 

-  {

-    b1 = Edge1.Bot.x - Edge1.Bot.y * Edge1.Dx;

-    b2 = Edge2.Bot.x - Edge2.Bot.y * Edge2.Dx;

-    double q = (b2-b1) / (Edge1.Dx - Edge2.Dx);

-    ip.y = Round(q);

-    if (std::fabs(Edge1.Dx) < std::fabs(Edge2.Dx))

-      ip.x = Round(Edge1.Dx * q + b1);

-    else 

-      ip.x = Round(Edge2.Dx * q + b2);

-    // the idea is simply to looking closer

-    // towards the origins of the lines (Edge1.Bot and Edge2.Bot)

-    // until we do not find pixels that both lines travel through

-    bool keep_searching = false;

-    double by1 = Edge1.Bot.y - (Edge1.Bot.x / Edge1.Dx);

-    double by2 = Edge2.Bot.y - (Edge2.Bot.x / Edge2.Dx);

-    double bx1 = Edge1.Bot.x - (Edge1.Bot.y * Edge1.Dx);

-    double bx2 = Edge2.Bot.x - (Edge2.Bot.y * Edge2.Dx);

-    do

-    {

-        keep_searching = false;

-        cInt y1 = ip.y;

-        cInt y2 = ip.y;

-        if (Edge1.Bot.x > ip.x)

-        {

-            if (Edge1.Bot.y >= ip.y)

-            {

-                y1 = std::floor(((ip.x + 0.5) / Edge1.Dx + by1) + 0.5);

-            }

-            else

-            {

-                y1 = std::ceil(((ip.x + 0.5) / Edge1.Dx + by1) - 0.5);

-            }

-        }

-        else if (Edge1.Bot.x < ip.x)

-        {

-            if (Edge1.Bot.y >= ip.y)

-            {

-                y1 = std::floor(((ip.x - 0.5) / Edge1.Dx + by1) + 0.5);

-            }

-            else

-            {

-                y1 = std::ceil(((ip.x - 0.5) / Edge1.Dx + by1) - 0.5);

-            }

-        }

-        else if (Edge1.Bot.y > ip.y)

-        {

-            if (Edge2.Bot.y >= Edge1.Bot.y)

-            {

-                y1 = Edge1.Bot.y;

-            }

-            else

-            {

-                y1 = Edge2.Bot.y;

-            }

-        }

-        else if (Edge1.Bot.y < ip.y)

-        {

-            if (Edge2.Bot.y <= Edge1.Bot.y)

-            {

-                y1 = Edge1.Bot.y;

-            }

-            else

-            {

-                y1 = Edge2.Bot.y;

-            }

-        }

-        if (ip.y >= Edge1.Bot.y && y1 < Edge1.Bot.y) y1 = Edge1.Bot.y;

-        else if (ip.y <= Edge1.Bot.y && y1 > Edge1.Bot.y) y1 = Edge1.Bot.y;

-        if (Edge2.Bot.x > ip.x)

-        {

-            if (Edge2.Bot.y >= ip.y)

-            {

-                y2 = std::floor(((ip.x + 0.5) / Edge2.Dx + by2) + 0.5);

-            }

-            else

-            {

-                y2 = std::ceil(((ip.x + 0.5) / Edge2.Dx + by2) - 0.5);

-            }

-        }

-        else if (Edge2.Bot.x < ip.x)

-        {

-            if (Edge2.Bot.y >= ip.y)

-            {

-                y2 = std::floor(((ip.x - 0.5) / Edge2.Dx + by2) + 0.5);

-            }

-            else

-            {

-                y2 = std::ceil(((ip.x - 0.5) / Edge2.Dx + by2) - 0.5);

-            }

-        }

-        else if (Edge2.Bot.y > ip.y)

-        {

-            if (Edge1.Bot.y >= Edge2.Bot.y)

-            {

-                y2 = Edge2.Bot.y;

-            }

-            else

-            {

-                y2 = Edge1.Bot.y;

-            }

-        }

-        else if (Edge2.Bot.y < ip.y)

-        {

-            if (Edge1.Bot.y <= Edge2.Bot.y)

-            {

-                y2 = Edge2.Bot.y;

-            }

-            else

-            {

-                y2 = Edge1.Bot.y;

-            }

-        }

-        if (ip.y >= Edge2.Bot.y && y2 < Edge2.Bot.y) y2 = Edge2.Bot.y;

-        else if (ip.y <= Edge2.Bot.y && y2 > Edge2.Bot.y) y2 = Edge2.Bot.y;

-        cInt x1 = ip.x;

-        cInt x2 = ip.x;

-        if (Edge1.Bot.y > ip.y)

-        {

-            if (Edge1.Bot.x >= ip.x)

-            {

-                x1 = std::floor(((ip.y + 0.5) * Edge1.Dx + bx1) + 0.5);

-            }

-            else

-            {

-                x1 = std::ceil(((ip.y + 0.5) * Edge1.Dx + bx1) - 0.5);

-            }

-        }

-        else if (Edge1.Bot.y < ip.y)

-        {

-            if (Edge1.Bot.x >= ip.x)

-            {

-                x1 = std::floor(((ip.y - 0.5) * Edge1.Dx + bx1) + 0.5);

-            }

-            else

-            {

-                x1 = std::ceil(((ip.y - 0.5) * Edge1.Dx + bx1) - 0.5);

-            }

-        }

-        else if (Edge1.Bot.x > ip.x)

-        {

-            if (Edge2.Bot.x >= Edge1.Bot.x)

-            {

-                x1 = Edge1.Bot.x;

-            }

-            else

-            {

-                x1 = Edge2.Bot.x;

-            }

-        }

-        else if (Edge1.Bot.x < ip.x)

-        {

-            if (Edge2.Bot.x <= Edge1.Bot.x)

-            {

-                x1 = Edge1.Bot.x;

-            }

-            else

-            {

-                x1 = Edge2.Bot.x;

-            }

-        }

-        if (ip.x >= Edge1.Bot.x && x1 < Edge1.Bot.x) x1 = Edge1.Bot.x;

-        else if (ip.x <= Edge1.Bot.x && x1 > Edge1.Bot.x) x1 = Edge1.Bot.x;

-        if (Edge2.Bot.y > ip.y)

-        {

-            if (Edge2.Bot.x >= ip.x)

-            {

-                x2 = std::floor(((ip.y + 0.5) * Edge2.Dx + bx2) + 0.5);

-            }

-            else

-            {

-                x2 = std::ceil(((ip.y + 0.5) * Edge2.Dx + bx2) - 0.5);

-            }

-        }

-        else if (Edge2.Bot.y < ip.y)

-        {

-            if (Edge2.Bot.x >= ip.x)

-            {

-                x2 = std::floor(((ip.y - 0.5) * Edge2.Dx + bx2) + 0.5);

-            }

-            else

-            {

-                x2 = std::ceil(((ip.y - 0.5) * Edge2.Dx + bx2) - 0.5);

-            }

-        }

-        else if (Edge2.Bot.x > ip.x)

-        {

-            if (Edge1.Bot.x >= Edge2.Bot.x)

-            {

-                x2 = Edge2.Bot.x;

-            }

-            else

-            {

-                x2 = Edge1.Bot.x;

-            }

-        }

-        else if (Edge2.Bot.x < ip.x)

-        {

-            if (Edge1.Bot.x <= Edge2.Bot.x)

-            {

-                x2 = Edge2.Bot.x;

-            }

-            else

-            {

-                x2 = Edge1.Bot.x;

-            }

-        }

-        if (ip.x >= Edge2.Bot.x && x2 < Edge2.Bot.x) x2 = Edge2.Bot.x;

-        else if (ip.x <= Edge2.Bot.x && x2 > Edge2.Bot.x) x2 = Edge2.Bot.x;

-        if (y1 > ip.y && y2 > ip.y)

-        {

-            ip.y = std::min(y1,y2);

-            keep_searching = true;

-        }

-        else if (y1 < ip.y && y2 < ip.y)

-        {

-            ip.y = std::max(y1,y2);

-            keep_searching = true;

-        } 

-        if (x1 > ip.x && x2 > ip.x)

-        {

-            ip.x = std::min(x1,x2);

-            keep_searching = true;

-        }

-        else if (x1 < ip.x && x2 < ip.x)

-        {

-            ip.x = std::max(x1,x2);

-            keep_searching = true;

-        }

-    }

-    while (keep_searching);

-  }

-

-  if (ip.y < Edge1.Top.y || ip.y < Edge2.Top.y) 

-  {

-    if (Edge1.Top.y > Edge2.Top.y)

-      ip.y = Edge1.Top.y;

-    else

-      ip.y = Edge2.Top.y;

-    if (std::fabs(Edge1.Dx) < std::fabs(Edge2.Dx))

-      ip.x = TopX(Edge1, ip.y);

-    else

-      ip.x = TopX(Edge2, ip.y);

-  } 

-  //finally, don't allow 'ip' to be BELOW curr.y (ie bottom of scanbeam) ...

-  if (ip.y > Edge1.Curr.y)

-  {

-    ip.y = Edge1.Curr.y;

-    //use the more vertical edge to derive X ...

-    if (std::fabs(Edge1.Dx) > std::fabs(Edge2.Dx))

-      ip.x = TopX(Edge2, ip.y); else

-      ip.x = TopX(Edge1, ip.y);

-  }

-}

-//------------------------------------------------------------------------------

-

-void ReversePolyPtLinks(OutPt *pp)

-{

-  if (!pp) return;

-  OutPt *pp1, *pp2;

-  pp1 = pp;

-  do {

-  pp2 = pp1->Next;

-  pp1->Next = pp1->Prev;

-  pp1->Prev = pp2;

-  pp1 = pp2;

-  } while( pp1 != pp );

-}

-//------------------------------------------------------------------------------

-

-void DisposeOutPts(OutPt*& pp)

-{

-  if (pp == 0) return;

-    pp->Prev->Next = 0;

-  while( pp )

-  {

-    OutPt *tmpPp = pp;

-    pp = pp->Next;

-    delete tmpPp;

-  }

-}

-//------------------------------------------------------------------------------

-

-inline void InitEdge(TEdge* e, TEdge* eNext, TEdge* ePrev, const IntPoint& Pt)

-{

-  std::memset(e, 0, sizeof(TEdge));

-  e->Next = eNext;

-  e->Prev = ePrev;

-  e->Curr = Pt;

-  e->OutIdx = Unassigned;

-}

-//------------------------------------------------------------------------------

-

-void InitEdge2(TEdge& e, PolyType Pt)

-{

-  if (e.Curr.y >= e.Next->Curr.y)

-  {

-    e.Bot = e.Curr;

-    e.Top = e.Next->Curr;

-  } else

-  {

-    e.Top = e.Curr;

-    e.Bot = e.Next->Curr;

-  }

-  SetDx(e);

-  e.PolyTyp = Pt;

-}

-//------------------------------------------------------------------------------

-

-TEdge* RemoveEdge(TEdge* e)

-{

-  //removes e from double_linked_list (but without removing from memory)

-  e->Prev->Next = e->Next;

-  e->Next->Prev = e->Prev;

-  TEdge* result = e->Next;

-  e->Prev = 0; //flag as removed (see ClipperBase.Clear)

-  return result;

-}

-//------------------------------------------------------------------------------

-

-inline void ReverseHorizontal(TEdge &e)

-{

-  //swap horizontal edges' Top and Bottom x's so they follow the natural

-  //progression of the bounds - ie so their xbots will align with the

-  //adjoining lower edge. [Helpful in the ProcessHorizontal() method.]

-  std::swap(e.Top.x, e.Bot.x);

-#ifdef use_xyz  

-  std::swap(e.Top.Z, e.Bot.Z);

-#endif

-}

-//------------------------------------------------------------------------------

-

-void SwapPoints(IntPoint &pt1, IntPoint &pt2)

-{

-  IntPoint tmp = pt1;

-  pt1 = pt2;

-  pt2 = tmp;

-}

-//------------------------------------------------------------------------------

-

-bool GetOverlapSegment(IntPoint pt1a, IntPoint pt1b, IntPoint pt2a,

-  IntPoint pt2b, IntPoint &pt1, IntPoint &pt2)

-{

-  //precondition: segments are Collinear.

-  if (Abs(pt1a.x - pt1b.x) > Abs(pt1a.y - pt1b.y))

-  {

-    if (pt1a.x > pt1b.x) SwapPoints(pt1a, pt1b);

-    if (pt2a.x > pt2b.x) SwapPoints(pt2a, pt2b);

-    if (pt1a.x > pt2a.x) pt1 = pt1a; else pt1 = pt2a;

-    if (pt1b.x < pt2b.x) pt2 = pt1b; else pt2 = pt2b;

-    return pt1.x < pt2.x;

-  } else

-  {

-    if (pt1a.y < pt1b.y) SwapPoints(pt1a, pt1b);

-    if (pt2a.y < pt2b.y) SwapPoints(pt2a, pt2b);

-    if (pt1a.y < pt2a.y) pt1 = pt1a; else pt1 = pt2a;

-    if (pt1b.y > pt2b.y) pt2 = pt1b; else pt2 = pt2b;

-    return pt1.y > pt2.y;

-  }

-}

-//------------------------------------------------------------------------------

-

-bool FirstIsBottomPt(const OutPt* btmPt1, const OutPt* btmPt2)

-{

-  OutPt *p = btmPt1->Prev;

-  while ((p->Pt == btmPt1->Pt) && (p != btmPt1)) p = p->Prev;

-  double dx1p = std::fabs(GetDx(btmPt1->Pt, p->Pt));

-  p = btmPt1->Next;

-  while ((p->Pt == btmPt1->Pt) && (p != btmPt1)) p = p->Next;

-  double dx1n = std::fabs(GetDx(btmPt1->Pt, p->Pt));

-

-  p = btmPt2->Prev;

-  while ((p->Pt == btmPt2->Pt) && (p != btmPt2)) p = p->Prev;

-  double dx2p = std::fabs(GetDx(btmPt2->Pt, p->Pt));

-  p = btmPt2->Next;

-  while ((p->Pt == btmPt2->Pt) && (p != btmPt2)) p = p->Next;

-  double dx2n = std::fabs(GetDx(btmPt2->Pt, p->Pt));

-

-  if (std::max(dx1p, dx1n) == std::max(dx2p, dx2n) &&

-    std::min(dx1p, dx1n) == std::min(dx2p, dx2n))

-      return Area(btmPt1) > 0; //if otherwise identical use orientation

-  else

-    return (dx1p >= dx2p && dx1p >= dx2n) || (dx1n >= dx2p && dx1n >= dx2n);

-}

-//------------------------------------------------------------------------------

-

-OutPt* GetBottomPt(OutPt *pp)

-{

-  OutPt* dups = 0;

-  OutPt* p = pp->Next;

-  while (p != pp)

-  {

-    if (p->Pt.y > pp->Pt.y)

-    {

-      pp = p;

-      dups = 0;

-    }

-    else if (p->Pt.y == pp->Pt.y && p->Pt.x <= pp->Pt.x)

-    {

-      if (p->Pt.x < pp->Pt.x)

-      {

-        dups = 0;

-        pp = p;

-      } else

-      {

-        if (p->Next != pp && p->Prev != pp) dups = p;

-      }

-    }

-    p = p->Next;

-  }

-  if (dups)

-  {

-    //there appears to be at least 2 vertices at BottomPt so ...

-    while (dups != p)

-    {

-      if (!FirstIsBottomPt(p, dups)) pp = dups;

-      dups = dups->Next;

-      while (dups->Pt != pp->Pt) dups = dups->Next;

-    }

-  }

-  return pp;

-}

-//------------------------------------------------------------------------------

-

-bool Pt2IsBetweenPt1AndPt3(const IntPoint pt1,

-  const IntPoint pt2, const IntPoint pt3)

-{

-  if ((pt1 == pt3) || (pt1 == pt2) || (pt3 == pt2))

-    return false;

-  else if (pt1.x != pt3.x)

-    return (pt2.x > pt1.x) == (pt2.x < pt3.x);

-  else

-    return (pt2.y > pt1.y) == (pt2.y < pt3.y);

-}

-//------------------------------------------------------------------------------

-

-bool HorzSegmentsOverlap(cInt seg1a, cInt seg1b, cInt seg2a, cInt seg2b)

-{

-  if (seg1a > seg1b) std::swap(seg1a, seg1b);

-  if (seg2a > seg2b) std::swap(seg2a, seg2b);

-  return (seg1a < seg2b) && (seg2a < seg1b);

-}

-

-//------------------------------------------------------------------------------

-// ClipperBase class methods ...

-//------------------------------------------------------------------------------

-

-ClipperBase::ClipperBase() //constructor

-{

-  m_CurrentLM = m_MinimaList.begin(); //begin() == end() here

-  m_UseFullRange = false;

-}

-//------------------------------------------------------------------------------

-

-ClipperBase::~ClipperBase() //destructor

-{

-  Clear();

-}

-//------------------------------------------------------------------------------

-

-void RangeTest(const IntPoint& Pt, bool& useFullRange)

-{

-  if (useFullRange)

-  {

-    if (Pt.x > hiRange || Pt.y > hiRange || -Pt.x > hiRange || -Pt.y > hiRange)

-    {

-      std::stringstream s;

-      s << "Coordinate outside allowed range: ";

-      s << std::fixed << Pt.x << " " << Pt.y << " " << -Pt.x << " " << -Pt.y;

-      throw clipperException(s.str().c_str());

-    }

-  }

-  else if (Pt.x > loRange|| Pt.y > loRange || -Pt.x > loRange || -Pt.y > loRange) 

-  {

-    useFullRange = true;

-    RangeTest(Pt, useFullRange);

-  }

-}

-//------------------------------------------------------------------------------

-

-TEdge* FindNextLocMin(TEdge* E)

-{

-  for (;;)

-  {

-    while (E->Bot != E->Prev->Bot || E->Curr == E->Top) E = E->Next;

-    if (!IsHorizontal(*E) && !IsHorizontal(*E->Prev)) break;

-    while (IsHorizontal(*E->Prev)) E = E->Prev;

-    TEdge* E2 = E;

-    while (IsHorizontal(*E)) E = E->Next;

-    if (E->Top.y == E->Prev->Bot.y) continue; //ie just an intermediate horz.

-    if (E2->Prev->Bot.x < E->Bot.x) E = E2;

-    break;

-  }

-  return E;

-}

-//------------------------------------------------------------------------------

-

-TEdge* ClipperBase::ProcessBound(TEdge* E, bool NextIsForward)

-{

-  TEdge *Result = E;

-  TEdge *Horz = 0;

-

-  if (E->OutIdx == Skip)

-  {

-    //if edges still remain in the current bound beyond the skip edge then

-    //create another LocMin and call ProcessBound once more

-    if (NextIsForward)

-    {

-      while (E->Top.y == E->Next->Bot.y) E = E->Next;

-      //don't include top horizontals when parsing a bound a second time,

-      //they will be contained in the opposite bound ...

-      while (E != Result && IsHorizontal(*E)) E = E->Prev;

-    }

-    else

-    {

-      while (E->Top.y == E->Prev->Bot.y) E = E->Prev;

-      while (E != Result && IsHorizontal(*E)) E = E->Next;

-    }

-

-    if (E == Result)

-    {

-      if (NextIsForward) Result = E->Next;

-      else Result = E->Prev;

-    }

-    else

-    {

-      //there are more edges in the bound beyond result starting with E

-      if (NextIsForward)

-        E = Result->Next;

-      else

-        E = Result->Prev;

-      MinimaList::value_type locMin;

-      locMin.y = E->Bot.y;

-      locMin.LeftBound = 0;

-      locMin.RightBound = E;

-      E->WindDelta = 0;

-      Result = ProcessBound(E, NextIsForward);

-      m_MinimaList.push_back(locMin);

-    }

-    return Result;

-  }

-

-  TEdge *EStart;

-

-  if (IsHorizontal(*E))

-  {

-    //We need to be careful with open paths because this may not be a

-    //true local minima (ie E may be following a skip edge).

-    //Also, consecutive horz. edges may start heading left before going right.

-    if (NextIsForward) 

-      EStart = E->Prev;

-    else 

-      EStart = E->Next;

-    if (IsHorizontal(*EStart)) //ie an adjoining horizontal skip edge

-      {

-        if (EStart->Bot.x != E->Bot.x && EStart->Top.x != E->Bot.x)

-          ReverseHorizontal(*E);

-      }

-      else if (EStart->Bot.x != E->Bot.x)

-        ReverseHorizontal(*E);

-  }

-  

-  EStart = E;

-  if (NextIsForward)

-  {

-    while (Result->Top.y == Result->Next->Bot.y && Result->Next->OutIdx != Skip)

-      Result = Result->Next;

-    if (IsHorizontal(*Result) && Result->Next->OutIdx != Skip)

-    {

-      //nb: at the top of a bound, horizontals are added to the bound

-      //only when the preceding edge attaches to the horizontal's left vertex

-      //unless a Skip edge is encountered when that becomes the top divide

-      Horz = Result;

-      while (IsHorizontal(*Horz->Prev)) Horz = Horz->Prev;

-      if (Horz->Prev->Top.x > Result->Next->Top.x) Result = Horz->Prev;

-    }

-    while (E != Result) 

-    {

-      E->NextInLML = E->Next;

-      if (IsHorizontal(*E) && E != EStart &&

-        E->Bot.x != E->Prev->Top.x) ReverseHorizontal(*E);

-      E = E->Next;

-    }

-    if (IsHorizontal(*E) && E != EStart && E->Bot.x != E->Prev->Top.x) 

-      ReverseHorizontal(*E);

-    Result = Result->Next; //move to the edge just beyond current bound

-  } else

-  {

-    while (Result->Top.y == Result->Prev->Bot.y && Result->Prev->OutIdx != Skip) 

-      Result = Result->Prev;

-    if (IsHorizontal(*Result) && Result->Prev->OutIdx != Skip)

-    {

-      Horz = Result;

-      while (IsHorizontal(*Horz->Next)) Horz = Horz->Next;

-      if (Horz->Next->Top.x == Result->Prev->Top.x ||

-          Horz->Next->Top.x > Result->Prev->Top.x) Result = Horz->Next;

-    }

-

-    while (E != Result)

-    {

-      E->NextInLML = E->Prev;

-      if (IsHorizontal(*E) && E != EStart && E->Bot.x != E->Next->Top.x) 

-        ReverseHorizontal(*E);

-      E = E->Prev;

-    }

-    if (IsHorizontal(*E) && E != EStart && E->Bot.x != E->Next->Top.x) 

-      ReverseHorizontal(*E);

-    Result = Result->Prev; //move to the edge just beyond current bound

-  }

-

-  return Result;

-}

-//------------------------------------------------------------------------------

-

-bool ClipperBase::AddPath(const Path &pg, PolyType PolyTyp, bool Closed)

-{

-#ifdef use_lines

-  if (!Closed && PolyTyp == ptClip)

-    throw clipperException("AddPath: Open paths must be subject.");

-#else

-  if (!Closed)

-    throw clipperException("AddPath: Open paths have been disabled.");

-#endif

-

-  int highI = (int)pg.size() -1;

-  if (Closed) while (highI > 0 && (pg[highI] == pg[0])) --highI;

-  while (highI > 0 && (pg[highI] == pg[highI -1])) --highI;

-  if ((Closed && highI < 2) || (!Closed && highI < 1)) return false;

-

-  //create a new edge array ...

-  TEdge *edges = new TEdge [highI +1];

-

-  bool IsFlat = true;

-  //1. Basic (first) edge initialization ...

-  try

-  {

-    edges[1].Curr = pg[1];

-    RangeTest(pg[0], m_UseFullRange);

-    RangeTest(pg[highI], m_UseFullRange);

-    InitEdge(&edges[0], &edges[1], &edges[highI], pg[0]);

-    InitEdge(&edges[highI], &edges[0], &edges[highI-1], pg[highI]);

-    for (int i = highI - 1; i >= 1; --i)

-    {

-      RangeTest(pg[i], m_UseFullRange);

-      InitEdge(&edges[i], &edges[i+1], &edges[i-1], pg[i]);

-    }

-  }

-  catch(std::exception const&)

-  {

-    delete [] edges;

-    throw; //range test fails

-  }

-  TEdge *eStart = &edges[0];

-

-  //2. Remove duplicate vertices, and (when closed) collinear edges ...

-  TEdge *E = eStart, *eLoopStop = eStart;

-  for (;;)

-  {

-    //nb: allows matching start and end points when not Closed ...

-    if (E->Curr == E->Next->Curr && (Closed || E->Next != eStart))

-    {

-      if (E == E->Next) break;

-      if (E == eStart) eStart = E->Next;

-      E = RemoveEdge(E);

-      eLoopStop = E;

-      continue;

-    }

-    if (E->Prev == E->Next) 

-      break; //only two vertices

-    else if (Closed &&

-      SlopesEqual(E->Prev->Curr, E->Curr, E->Next->Curr, m_UseFullRange) && 

-      (!m_PreserveCollinear ||

-      !Pt2IsBetweenPt1AndPt3(E->Prev->Curr, E->Curr, E->Next->Curr)))

-    {

-      //Collinear edges are allowed for open paths but in closed paths

-      //the default is to merge adjacent collinear edges into a single edge.

-      //However, if the PreserveCollinear property is enabled, only overlapping

-      //collinear edges (ie spikes) will be removed from closed paths.

-      if (E == eStart) eStart = E->Next;

-      E = RemoveEdge(E);

-      E = E->Prev;

-      eLoopStop = E;

-      continue;

-    }

-    E = E->Next;

-    if ((E == eLoopStop) || (!Closed && E->Next == eStart)) break;

-  }

-

-  if ((!Closed && (E == E->Next)) || (Closed && (E->Prev == E->Next)))

-  {

-    delete [] edges;

-    return false;

-  }

-

-  if (!Closed)

-  { 

-    m_HasOpenPaths = true;

-    eStart->Prev->OutIdx = Skip;

-  }

-

-  //3. Do second stage of edge initialization ...

-  E = eStart;

-  do

-  {

-    InitEdge2(*E, PolyTyp);

-    E = E->Next;

-    if (IsFlat && E->Curr.y != eStart->Curr.y) IsFlat = false;

-  }

-  while (E != eStart);

-

-  //4. Finally, add edge bounds to LocalMinima list ...

-

-  //Totally flat paths must be handled differently when adding them

-  //to LocalMinima list to avoid endless loops etc ...

-  if (IsFlat) 

-  {

-    if (Closed) 

-    {

-      delete [] edges;

-      return false;

-    }

-    E->Prev->OutIdx = Skip;

-    MinimaList::value_type locMin;

-    locMin.y = E->Bot.y;

-    locMin.LeftBound = 0;

-    locMin.RightBound = E;

-    locMin.RightBound->Side = esRight;

-    locMin.RightBound->WindDelta = 0;

-    for (;;)

-    {

-      if (E->Bot.x != E->Prev->Top.x) ReverseHorizontal(*E);

-      if (E->Next->OutIdx == Skip) break;

-      E->NextInLML = E->Next;

-      E = E->Next;

-    }

-    m_MinimaList.push_back(locMin);

-    m_edges.push_back(edges);

-	  return true;

-  }

-

-  m_edges.push_back(edges);

-  bool leftBoundIsForward;

-  TEdge* EMin = 0;

-

-  //workaround to avoid an endless loop in the while loop below when

-  //open paths have matching start and end points ...

-  if (E->Prev->Bot == E->Prev->Top) E = E->Next;

-

-  for (;;)

-  {

-    E = FindNextLocMin(E);

-    if (E == EMin) break;

-    else if (!EMin) EMin = E;

-

-    //E and E.Prev now share a local minima (left aligned if horizontal).

-    //Compare their slopes to find which starts which bound ...

-    MinimaList::value_type locMin;

-    locMin.y = E->Bot.y;

-    if (E->Dx < E->Prev->Dx) 

-    {

-      locMin.LeftBound = E->Prev;

-      locMin.RightBound = E;

-      leftBoundIsForward = false; //Q.nextInLML = Q.prev

-    } else

-    {

-      locMin.LeftBound = E;

-      locMin.RightBound = E->Prev;

-      leftBoundIsForward = true; //Q.nextInLML = Q.next

-    }

-

-    if (!Closed) locMin.LeftBound->WindDelta = 0;

-    else if (locMin.LeftBound->Next == locMin.RightBound)

-      locMin.LeftBound->WindDelta = -1;

-    else locMin.LeftBound->WindDelta = 1;

-    locMin.RightBound->WindDelta = -locMin.LeftBound->WindDelta;

-

-    E = ProcessBound(locMin.LeftBound, leftBoundIsForward);

-    if (E->OutIdx == Skip) E = ProcessBound(E, leftBoundIsForward);

-

-    TEdge* E2 = ProcessBound(locMin.RightBound, !leftBoundIsForward);

-    if (E2->OutIdx == Skip) E2 = ProcessBound(E2, !leftBoundIsForward);

-

-    if (locMin.LeftBound->OutIdx == Skip)

-      locMin.LeftBound = 0;

-    else if (locMin.RightBound->OutIdx == Skip)

-      locMin.RightBound = 0;

-    m_MinimaList.push_back(locMin);

-    if (!leftBoundIsForward) E = E2;

-  }

-  return true;

-}

-//------------------------------------------------------------------------------

-

-bool ClipperBase::AddPaths(const Paths &ppg, PolyType PolyTyp, bool Closed)

-{

-  bool result = false;

-  for (Paths::size_type i = 0; i < ppg.size(); ++i)

-    if (AddPath(ppg[i], PolyTyp, Closed)) result = true;

-  return result;

-}

-//------------------------------------------------------------------------------

-

-void ClipperBase::Clear()

-{

-  DisposeLocalMinimaList();

-  for (EdgeList::size_type i = 0; i < m_edges.size(); ++i)

-  {

-    TEdge* edges = m_edges[i];

-    delete [] edges;

-  }

-  m_edges.clear();

-  m_UseFullRange = false;

-  m_HasOpenPaths = false;

-}

-//------------------------------------------------------------------------------

-

-void ClipperBase::Reset()

-{

-  m_CurrentLM = m_MinimaList.begin();

-  if (m_CurrentLM == m_MinimaList.end()) return; //ie nothing to process

-  std::stable_sort(m_MinimaList.begin(), m_MinimaList.end(), LocMinSorter());

-

-  m_Scanbeam = ScanbeamList(); //clears/resets priority_queue

-  //reset all edges ...

-  for (MinimaList::iterator lm = m_MinimaList.begin(); lm != m_MinimaList.end(); ++lm)

-  {

-    InsertScanbeam(lm->y);

-    TEdge* e = lm->LeftBound;

-    if (e)

-    {

-      e->Curr = e->Bot;

-      e->Side = esLeft;

-      e->OutIdx = Unassigned;

-    }

-

-    e = lm->RightBound;

-    if (e)

-    {

-      e->Curr = e->Bot;

-      e->Side = esRight;

-      e->OutIdx = Unassigned;

-    }

-  }

-  m_ActiveEdges = 0;

-  m_CurrentLM = m_MinimaList.begin();

-}

-//------------------------------------------------------------------------------

-

-void ClipperBase::DisposeLocalMinimaList()

-{

-  m_MinimaList.clear();

-  m_CurrentLM = m_MinimaList.begin();

-}

-//------------------------------------------------------------------------------

-

-bool ClipperBase::PopLocalMinima(cInt Y, const LocalMinimum *&locMin)

-{

-  if (m_CurrentLM == m_MinimaList.end() || (*m_CurrentLM).y != Y) return false;

-  locMin = &(*m_CurrentLM);

-  ++m_CurrentLM;

-  return true;

-}

-//------------------------------------------------------------------------------

-

-IntRect ClipperBase::GetBounds()

-{

-  IntRect result;

-  MinimaList::iterator lm = m_MinimaList.begin();

-  if (lm == m_MinimaList.end())

-  {

-    result.left = result.top = result.right = result.bottom = 0;

-    return result;

-  }

-  result.left = lm->LeftBound->Bot.x;

-  result.top = lm->LeftBound->Bot.y;

-  result.right = lm->LeftBound->Bot.x;

-  result.bottom = lm->LeftBound->Bot.y;

-  while (lm != m_MinimaList.end())

-  {

-    //todo - needs fixing for open paths

-    result.bottom = std::max(result.bottom, lm->LeftBound->Bot.y);

-    TEdge* e = lm->LeftBound;

-    for (;;) {

-      TEdge* bottomE = e;

-      while (e->NextInLML)

-      {

-        if (e->Bot.x < result.left) result.left = e->Bot.x;

-        if (e->Bot.x > result.right) result.right = e->Bot.x;

-        e = e->NextInLML;

-      }

-      result.left = std::min(result.left, e->Bot.x);

-      result.right = std::max(result.right, e->Bot.x);

-      result.left = std::min(result.left, e->Top.x);

-      result.right = std::max(result.right, e->Top.x);

-      result.top = std::min(result.top, e->Top.y);

-      if (bottomE == lm->LeftBound) e = lm->RightBound;

-      else break;

-    }

-    ++lm;

-  }

-  return result;

-}

-//------------------------------------------------------------------------------

-

-void ClipperBase::InsertScanbeam(const cInt Y)

-{

-  m_Scanbeam.push(Y);

-}

-//------------------------------------------------------------------------------

-

-bool ClipperBase::PopScanbeam(cInt &Y)

-{

-  if (m_Scanbeam.empty()) return false;

-  Y = m_Scanbeam.top();

-  m_Scanbeam.pop();

-  while (!m_Scanbeam.empty() && Y == m_Scanbeam.top()) { m_Scanbeam.pop(); } // Pop duplicates.

-  return true;

-}

-//------------------------------------------------------------------------------

-

-void ClipperBase::DisposeAllOutRecs(){

-  for (PolyOutList::size_type i = 0; i < m_PolyOuts.size(); ++i)

-    DisposeOutRec(i);

-  m_PolyOuts.clear();

-}

-//------------------------------------------------------------------------------

-

-void ClipperBase::DisposeOutRec(PolyOutList::size_type index)

-{

-  OutRec *outRec = m_PolyOuts[index];

-  if (outRec->Pts) DisposeOutPts(outRec->Pts);

-  delete outRec;

-  m_PolyOuts[index] = 0;

-}

-//------------------------------------------------------------------------------

-

-void ClipperBase::DeleteFromAEL(TEdge *e)

-{

-  TEdge* AelPrev = e->PrevInAEL;

-  TEdge* AelNext = e->NextInAEL;

-  if (!AelPrev &&  !AelNext && (e != m_ActiveEdges)) return; //already deleted

-  if (AelPrev) AelPrev->NextInAEL = AelNext;

-  else m_ActiveEdges = AelNext;

-  if (AelNext) AelNext->PrevInAEL = AelPrev;

-  e->NextInAEL = 0;

-  e->PrevInAEL = 0;

-}

-//------------------------------------------------------------------------------

-

-OutRec* ClipperBase::CreateOutRec()

-{

-  OutRec* result = new OutRec;

-  result->IsHole = false;

-  result->IsOpen = false;

-  result->FirstLeft = 0;

-  result->Pts = 0;

-  result->BottomPt = 0;

-  result->PolyNd = 0;

-  m_PolyOuts.push_back(result);

-  result->Idx = (int)m_PolyOuts.size() - 1;

-  return result;

-}

-//------------------------------------------------------------------------------

-

-void ClipperBase::SwapPositionsInAEL(TEdge *Edge1, TEdge *Edge2)

-{

-  //check that one or other edge hasn't already been removed from AEL ...

-  if (Edge1->NextInAEL == Edge1->PrevInAEL ||

-    Edge2->NextInAEL == Edge2->PrevInAEL) return;

-

-  if (Edge1->NextInAEL == Edge2)

-  {

-    TEdge* Next = Edge2->NextInAEL;

-    if (Next) Next->PrevInAEL = Edge1;

-    TEdge* Prev = Edge1->PrevInAEL;

-    if (Prev) Prev->NextInAEL = Edge2;

-    Edge2->PrevInAEL = Prev;

-    Edge2->NextInAEL = Edge1;

-    Edge1->PrevInAEL = Edge2;

-    Edge1->NextInAEL = Next;

-  }

-  else if (Edge2->NextInAEL == Edge1)

-  {

-    TEdge* Next = Edge1->NextInAEL;

-    if (Next) Next->PrevInAEL = Edge2;

-    TEdge* Prev = Edge2->PrevInAEL;

-    if (Prev) Prev->NextInAEL = Edge1;

-    Edge1->PrevInAEL = Prev;

-    Edge1->NextInAEL = Edge2;

-    Edge2->PrevInAEL = Edge1;

-    Edge2->NextInAEL = Next;

-  }

-  else

-  {

-    TEdge* Next = Edge1->NextInAEL;

-    TEdge* Prev = Edge1->PrevInAEL;

-    Edge1->NextInAEL = Edge2->NextInAEL;

-    if (Edge1->NextInAEL) Edge1->NextInAEL->PrevInAEL = Edge1;

-    Edge1->PrevInAEL = Edge2->PrevInAEL;

-    if (Edge1->PrevInAEL) Edge1->PrevInAEL->NextInAEL = Edge1;

-    Edge2->NextInAEL = Next;

-    if (Edge2->NextInAEL) Edge2->NextInAEL->PrevInAEL = Edge2;

-    Edge2->PrevInAEL = Prev;

-    if (Edge2->PrevInAEL) Edge2->PrevInAEL->NextInAEL = Edge2;

-  }

-

-  if (!Edge1->PrevInAEL) m_ActiveEdges = Edge1;

-  else if (!Edge2->PrevInAEL) m_ActiveEdges = Edge2;

-}

-//------------------------------------------------------------------------------

-

-void ClipperBase::UpdateEdgeIntoAEL(TEdge *&e)

-{

-  if (!e->NextInLML) 

-    throw clipperException("UpdateEdgeIntoAEL: invalid call");

-

-  e->NextInLML->OutIdx = e->OutIdx;

-  TEdge* AelPrev = e->PrevInAEL;

-  TEdge* AelNext = e->NextInAEL;

-  if (AelPrev) AelPrev->NextInAEL = e->NextInLML;

-  else m_ActiveEdges = e->NextInLML;

-  if (AelNext) AelNext->PrevInAEL = e->NextInLML;

-  e->NextInLML->Side = e->Side;

-  e->NextInLML->WindDelta = e->WindDelta;

-  e->NextInLML->WindCnt = e->WindCnt;

-  e->NextInLML->WindCnt2 = e->WindCnt2;

-  e = e->NextInLML;

-  e->Curr = e->Bot;

-  e->PrevInAEL = AelPrev;

-  e->NextInAEL = AelNext;

-  if (!IsHorizontal(*e)) InsertScanbeam(e->Top.y);

-}

-//------------------------------------------------------------------------------

-

-bool ClipperBase::LocalMinimaPending()

-{

-  return (m_CurrentLM != m_MinimaList.end());

-}

-

-//------------------------------------------------------------------------------

-// TClipper methods ...

-//------------------------------------------------------------------------------

-

-Clipper::Clipper(int initOptions) : ClipperBase() //constructor

-{

-  m_ExecuteLocked = false;

-  m_UseFullRange = false;

-  m_ReverseOutput = ((initOptions & ioReverseSolution) != 0);

-  m_StrictSimple = ((initOptions & ioStrictlySimple) != 0);

-  m_PreserveCollinear = ((initOptions & ioPreserveCollinear) != 0);

-  m_HasOpenPaths = false;

-#ifdef use_xyz  

-  m_ZFill = 0;

-#endif

-}

-//------------------------------------------------------------------------------

-

-#ifdef use_xyz  

-void Clipper::ZFillFunction(ZFillCallback zFillFunc)

-{  

-  m_ZFill = zFillFunc;

-}

-//------------------------------------------------------------------------------

-#endif

-

-bool Clipper::Execute(ClipType clipType, Paths &solution, PolyFillType fillType)

-{

-    return Execute(clipType, solution, fillType, fillType);

-}

-//------------------------------------------------------------------------------

-

-bool Clipper::Execute(ClipType clipType, PolyTree &polytree, PolyFillType fillType)

-{

-    return Execute(clipType, polytree, fillType, fillType);

-}

-//------------------------------------------------------------------------------

-

-bool Clipper::Execute(ClipType clipType, Paths &solution,

-    PolyFillType subjFillType, PolyFillType clipFillType)

-{

-  if( m_ExecuteLocked ) return false;

-  if (m_HasOpenPaths)

-    throw clipperException("Error: PolyTree struct is needed for open path clipping.");

-  m_ExecuteLocked = true;

-  solution.resize(0);

-  m_SubjFillType = subjFillType;

-  m_ClipFillType = clipFillType;

-  m_ClipType = clipType;

-  m_UsingPolyTree = false;

-  bool succeeded = ExecuteInternal();

-  if (succeeded) BuildResult(solution);

-  DisposeAllOutRecs();

-  m_ExecuteLocked = false;

-  return succeeded;

-}

-//------------------------------------------------------------------------------

-

-bool Clipper::Execute(ClipType clipType, PolyTree& polytree,

-    PolyFillType subjFillType, PolyFillType clipFillType)

-{

-  if( m_ExecuteLocked ) return false;

-  m_ExecuteLocked = true;

-  m_SubjFillType = subjFillType;

-  m_ClipFillType = clipFillType;

-  m_ClipType = clipType;

-  m_UsingPolyTree = true;

-  bool succeeded = ExecuteInternal();

-  if (succeeded) BuildResult2(polytree);

-  DisposeAllOutRecs();

-  m_ExecuteLocked = false;

-  return succeeded;

-}

-//------------------------------------------------------------------------------

-

-void Clipper::FixHoleLinkage(OutRec &outrec)

-{

-  //skip OutRecs that (a) contain outermost polygons or

-  //(b) already have the correct owner/child linkage ...

-  if (!outrec.FirstLeft ||                

-      (outrec.IsHole != outrec.FirstLeft->IsHole &&

-      outrec.FirstLeft->Pts)) return;

-

-  OutRec* orfl = outrec.FirstLeft;

-  while (orfl && ((orfl->IsHole == outrec.IsHole) || !orfl->Pts))

-      orfl = orfl->FirstLeft;

-  outrec.FirstLeft = orfl;

-}

-//------------------------------------------------------------------------------

-

-bool Clipper::ExecuteInternal()

-{

-  bool succeeded = true;

-  try {

-    Reset();

-    m_Maxima = MaximaList();

-    m_SortedEdges = 0;

-

-    succeeded = true;

-    cInt botY, topY;

-    if (!PopScanbeam(botY)) return false;

-    InsertLocalMinimaIntoAEL(botY);

-    while (PopScanbeam(topY) || LocalMinimaPending())

-    {

-      ProcessHorizontals();

-	    ClearGhostJoins();

-      if (!ProcessIntersections(topY))

-      {

-        succeeded = false;

-        break;

-      }

-      ProcessEdgesAtTopOfScanbeam(topY);

-      botY = topY;

-      InsertLocalMinimaIntoAEL(botY);

-    }

-  }

-  catch(std::exception const&) 

-  {

-    succeeded = false;

-  }

-

-  if (succeeded)

-  {

-    //fix orientations ...

-    for (PolyOutList::size_type i = 0; i < m_PolyOuts.size(); ++i)

-    {

-      OutRec *outRec = m_PolyOuts[i];

-      if (!outRec->Pts || outRec->IsOpen) continue;

-      if ((outRec->IsHole ^ m_ReverseOutput) == (Area(*outRec) > 0))

-        ReversePolyPtLinks(outRec->Pts);

-    }

-

-    if (!m_Joins.empty()) JoinCommonEdges();

-

-    //unfortunately FixupOutPolygon() must be done after JoinCommonEdges()

-    for (PolyOutList::size_type i = 0; i < m_PolyOuts.size(); ++i)

-    {

-      OutRec *outRec = m_PolyOuts[i];

-      if (!outRec->Pts) continue;

-      if (outRec->IsOpen)

-        FixupOutPolyline(*outRec);

-      else

-        FixupOutPolygon(*outRec);

-    }

-

-    if (m_StrictSimple) 

-    {

-        DoSimplePolygons();

-        m_StrictSimple = false;

-        for (PolyOutList::size_type i = 0; i < m_PolyOuts.size(); ++i)

-        {

-          OutRec *outRec = m_PolyOuts[i];

-          if (!outRec->Pts || outRec->IsOpen)

-          { 

-              continue; 

-          }

-          FixupOutPolygon(*outRec);

-        }

-        m_StrictSimple = true;

-    }

-  }

-

-  ClearJoins();

-  ClearGhostJoins();

-  return succeeded;

-}

-//------------------------------------------------------------------------------

-

-void Clipper::SetWindingCount(TEdge &edge)

-{

-  TEdge *e = edge.PrevInAEL;

-  //find the edge of the same polytype that immediately preceeds 'edge' in AEL

-  while (e  && ((e->PolyTyp != edge.PolyTyp) || (e->WindDelta == 0))) e = e->PrevInAEL;

-  if (!e)

-  {

-    if (edge.WindDelta == 0)

-    {

-      PolyFillType pft = (edge.PolyTyp == ptSubject ? m_SubjFillType : m_ClipFillType);

-      edge.WindCnt = (pft == pftNegative ? -1 : 1);

-    }

-    else

-      edge.WindCnt = edge.WindDelta;

-    edge.WindCnt2 = 0;

-    e = m_ActiveEdges; //ie get ready to calc WindCnt2

-  }   

-  else if (edge.WindDelta == 0 && m_ClipType != ctUnion)

-  {

-    edge.WindCnt = 1;

-    edge.WindCnt2 = e->WindCnt2;

-    e = e->NextInAEL; //ie get ready to calc WindCnt2

-  }

-  else if (IsEvenOddFillType(edge))

-  {

-    //EvenOdd filling ...

-    if (edge.WindDelta == 0)

-    {

-      //are we inside a subj polygon ...

-      bool Inside = true;

-      TEdge *e2 = e->PrevInAEL;

-      while (e2)

-      {

-        if (e2->PolyTyp == e->PolyTyp && e2->WindDelta != 0) 

-          Inside = !Inside;

-        e2 = e2->PrevInAEL;

-      }

-      edge.WindCnt = (Inside ? 0 : 1);

-    }

-    else

-    {

-      edge.WindCnt = edge.WindDelta;

-    }

-    edge.WindCnt2 = e->WindCnt2;

-    e = e->NextInAEL; //ie get ready to calc WindCnt2

-  } 

-  else

-  {

-    //nonZero, Positive or Negative filling ...

-    if (e->WindCnt * e->WindDelta < 0)

-    {

-      //prev edge is 'decreasing' WindCount (WC) toward zero

-      //so we're outside the previous polygon ...

-      if (Abs(e->WindCnt) > 1)

-      {

-        //outside prev poly but still inside another.

-        //when reversing direction of prev poly use the same WC 

-        if (e->WindDelta * edge.WindDelta < 0) edge.WindCnt = e->WindCnt;

-        //otherwise continue to 'decrease' WC ...

-        else edge.WindCnt = e->WindCnt + edge.WindDelta;

-      } 

-      else

-        //now outside all polys of same polytype so set own WC ...

-        edge.WindCnt = (edge.WindDelta == 0 ? 1 : edge.WindDelta);

-    } else

-    {

-      //prev edge is 'increasing' WindCount (WC) away from zero

-      //so we're inside the previous polygon ...

-      if (edge.WindDelta == 0) 

-        edge.WindCnt = (e->WindCnt < 0 ? e->WindCnt - 1 : e->WindCnt + 1);

-      //if wind direction is reversing prev then use same WC

-      else if (e->WindDelta * edge.WindDelta < 0) edge.WindCnt = e->WindCnt;

-      //otherwise add to WC ...

-      else edge.WindCnt = e->WindCnt + edge.WindDelta;

-    }

-    edge.WindCnt2 = e->WindCnt2;

-    e = e->NextInAEL; //ie get ready to calc WindCnt2

-  }

-

-  //update WindCnt2 ...

-  if (IsEvenOddAltFillType(edge))

-  {

-    //EvenOdd filling ...

-    while (e != &edge)

-    {

-      if (e->WindDelta != 0)

-        edge.WindCnt2 = (edge.WindCnt2 == 0 ? 1 : 0);

-      e = e->NextInAEL;

-    }

-  } else

-  {

-    //nonZero, Positive or Negative filling ...

-    while ( e != &edge )

-    {

-      edge.WindCnt2 += e->WindDelta;

-      e = e->NextInAEL;

-    }

-  }

-}

-//------------------------------------------------------------------------------

-

-bool Clipper::IsEvenOddFillType(const TEdge& edge) const

-{

-  if (edge.PolyTyp == ptSubject)

-    return m_SubjFillType == pftEvenOdd; else

-    return m_ClipFillType == pftEvenOdd;

-}

-//------------------------------------------------------------------------------

-

-bool Clipper::IsEvenOddAltFillType(const TEdge& edge) const

-{

-  if (edge.PolyTyp == ptSubject)

-    return m_ClipFillType == pftEvenOdd; else

-    return m_SubjFillType == pftEvenOdd;

-}

-//------------------------------------------------------------------------------

-

-bool Clipper::IsContributing(const TEdge& edge) const

-{

-  PolyFillType pft, pft2;

-  if (edge.PolyTyp == ptSubject)

-  {

-    pft = m_SubjFillType;

-    pft2 = m_ClipFillType;

-  } else

-  {

-    pft = m_ClipFillType;

-    pft2 = m_SubjFillType;

-  }

-

-  switch(pft)

-  {

-    case pftEvenOdd: 

-      //return false if a subj line has been flagged as inside a subj polygon

-      if (edge.WindDelta == 0 && edge.WindCnt != 1) return false;

-      break;

-    case pftNonZero:

-      if (Abs(edge.WindCnt) != 1) return false;

-      break;

-    case pftPositive: 

-      if (edge.WindCnt != 1) return false;

-      break;

-    default: //pftNegative

-      if (edge.WindCnt != -1) return false;

-  }

-

-  switch(m_ClipType)

-  {

-    case ctIntersection:

-      switch(pft2)

-      {

-        case pftEvenOdd: 

-        case pftNonZero: 

-          return (edge.WindCnt2 != 0);

-        case pftPositive: 

-          return (edge.WindCnt2 > 0);

-        default: 

-          return (edge.WindCnt2 < 0);

-      }

-      break;

-    case ctUnion:

-      switch(pft2)

-      {

-        case pftEvenOdd: 

-        case pftNonZero: 

-          return (edge.WindCnt2 == 0);

-        case pftPositive: 

-          return (edge.WindCnt2 <= 0);

-        default: 

-          return (edge.WindCnt2 >= 0);

-      }

-      break;

-    case ctDifference:

-      if (edge.PolyTyp == ptSubject)

-        switch(pft2)

-        {

-          case pftEvenOdd: 

-          case pftNonZero: 

-            return (edge.WindCnt2 == 0);

-          case pftPositive: 

-            return (edge.WindCnt2 <= 0);

-          default: 

-            return (edge.WindCnt2 >= 0);

-        }

-      else

-        switch(pft2)

-        {

-          case pftEvenOdd: 

-          case pftNonZero: 

-            return (edge.WindCnt2 != 0);

-          case pftPositive: 

-            return (edge.WindCnt2 > 0);

-          default: 

-            return (edge.WindCnt2 < 0);

-        }

-      break;

-    case ctXor:

-      if (edge.WindDelta == 0) //XOr always contributing unless open

-        switch(pft2)

-        {

-          case pftEvenOdd: 

-          case pftNonZero: 

-            return (edge.WindCnt2 == 0);

-          case pftPositive: 

-            return (edge.WindCnt2 <= 0);

-          default: 

-            return (edge.WindCnt2 >= 0);

-        }

-      else 

-        return true;

-      break;

-    default:

-      return true;

-  }

-}

-//------------------------------------------------------------------------------

-

-OutPt* Clipper::AddLocalMinPoly(TEdge *e1, TEdge *e2, const IntPoint &Pt)

-{

-  OutPt* result;

-  TEdge *e, *prevE;

-  if (IsHorizontal(*e2) || ( e1->Dx > e2->Dx ))

-  {

-    result = AddOutPt(e1, Pt);

-    e2->OutIdx = e1->OutIdx;

-    e1->Side = esLeft;

-    e2->Side = esRight;

-    e = e1;

-    if (e->PrevInAEL == e2)

-      prevE = e2->PrevInAEL; 

-    else

-      prevE = e->PrevInAEL;

-  } else

-  {

-    result = AddOutPt(e2, Pt);

-    e1->OutIdx = e2->OutIdx;

-    e1->Side = esRight;

-    e2->Side = esLeft;

-    e = e2;

-    if (e->PrevInAEL == e1)

-        prevE = e1->PrevInAEL;

-    else

-        prevE = e->PrevInAEL;

-  }

-

-  if (prevE && prevE->OutIdx >= 0)

-  {

-    cInt xPrev = TopX(*prevE, Pt.y);

-    cInt xE = TopX(*e, Pt.y);

-    if (xPrev == xE && (e->WindDelta != 0) && (prevE->WindDelta != 0) &&

-      SlopesEqual(IntPoint(xPrev, Pt.y), prevE->Top, IntPoint(xE, Pt.y), e->Top, m_UseFullRange))

-    {

-      OutPt* outPt = AddOutPt(prevE, Pt);

-      AddJoin(result, outPt, e->Top);

-    }

-  }

-  return result;

-}

-//------------------------------------------------------------------------------

-

-void Clipper::AddLocalMaxPoly(TEdge *e1, TEdge *e2, const IntPoint &Pt)

-{

-  AddOutPt( e1, Pt );

-  if (e2->WindDelta == 0) AddOutPt(e2, Pt);

-  if( e1->OutIdx == e2->OutIdx )

-  {

-    e1->OutIdx = Unassigned;

-    e2->OutIdx = Unassigned;

-  }

-  else if (e1->OutIdx < e2->OutIdx) 

-    AppendPolygon(e1, e2); 

-  else 

-    AppendPolygon(e2, e1);

-}

-//------------------------------------------------------------------------------

-

-void Clipper::AddEdgeToSEL(TEdge *edge)

-{

-  //SEL pointers in PEdge are reused to build a list of horizontal edges.

-  //However, we don't need to worry about order with horizontal edge processing.

-  if( !m_SortedEdges )

-  {

-    m_SortedEdges = edge;

-    edge->PrevInSEL = 0;

-    edge->NextInSEL = 0;

-  }

-  else

-  {

-    edge->NextInSEL = m_SortedEdges;

-    edge->PrevInSEL = 0;

-    m_SortedEdges->PrevInSEL = edge;

-    m_SortedEdges = edge;

-  }

-}

-//------------------------------------------------------------------------------

-

-bool Clipper::PopEdgeFromSEL(TEdge *&edge)

-{

-  if (!m_SortedEdges) return false;

-  edge = m_SortedEdges;

-  DeleteFromSEL(m_SortedEdges);

-  return true;

-}

-//------------------------------------------------------------------------------

-

-void Clipper::CopyAELToSEL()

-{

-  TEdge* e = m_ActiveEdges;

-  m_SortedEdges = e;

-  while ( e )

-  {

-    e->PrevInSEL = e->PrevInAEL;

-    e->NextInSEL = e->NextInAEL;

-    e = e->NextInAEL;

-  }

-}

-//------------------------------------------------------------------------------

-

-void Clipper::AddJoin(OutPt *op1, OutPt *op2, const IntPoint OffPt)

-{

-  Join* j = new Join;

-  j->OutPt1 = op1;

-  j->OutPt2 = op2;

-  j->OffPt = OffPt;

-  m_Joins.push_back(j);

-}

-//------------------------------------------------------------------------------

-

-void Clipper::ClearJoins()

-{

-  for (JoinList::size_type i = 0; i < m_Joins.size(); i++)

-    delete m_Joins[i];

-  m_Joins.resize(0);

-}

-//------------------------------------------------------------------------------

-

-void Clipper::ClearGhostJoins()

-{

-  for (JoinList::size_type i = 0; i < m_GhostJoins.size(); i++)

-    delete m_GhostJoins[i];

-  m_GhostJoins.resize(0);

-}

-//------------------------------------------------------------------------------

-

-void Clipper::AddGhostJoin(OutPt *op, const IntPoint OffPt)

-{

-  Join* j = new Join;

-  j->OutPt1 = op;

-  j->OutPt2 = 0;

-  j->OffPt = OffPt;

-  m_GhostJoins.push_back(j);

-}

-//------------------------------------------------------------------------------

-

-void Clipper::InsertLocalMinimaIntoAEL(const cInt botY)

-{

-  const LocalMinimum *lm;

-  while (PopLocalMinima(botY, lm))

-  {

-    TEdge* lb = lm->LeftBound;

-    TEdge* rb = lm->RightBound;

-    

-    OutPt *Op1 = 0;

-    if (!lb)

-    {

-      //nb: don't insert LB into either AEL or SEL

-      InsertEdgeIntoAEL(rb, 0);

-      SetWindingCount(*rb);

-      if (IsContributing(*rb))

-      {

-          Op1 = AddOutPt(rb, rb->Bot); 

-          TEdge* ePrev = rb->PrevInAEL;

-          if ((rb->OutIdx >= 0) && (rb->WindDelta != 0) && ePrev && (ePrev->OutIdx >= 0) &&

-            (ePrev->Curr.x == rb->Curr.x) && (ePrev->WindDelta != 0))

-          {

-            IntPoint pt = rb->Curr;

-            AddOutPt(ePrev, pt);

-          }

-          TEdge* eNext = rb->NextInAEL;

-          if ((rb->OutIdx >= 0) && (rb->WindDelta != 0) && eNext && (eNext->OutIdx >= 0) &&

-            (eNext->Curr.x == rb->Curr.x) && (eNext->WindDelta != 0))

-          {

-            IntPoint pt = rb->Curr;

-            AddOutPt(eNext, pt);

-          }

-      }

-    } 

-    else if (!rb)

-    {

-      InsertEdgeIntoAEL(lb, 0);

-      SetWindingCount(*lb);

-      if (IsContributing(*lb))

-      {

-          Op1 = AddOutPt(lb, lb->Bot);

-          TEdge* ePrev = lb->PrevInAEL;

-          if ((lb->OutIdx >= 0) && (lb->WindDelta != 0) && ePrev && (ePrev->OutIdx >= 0) &&

-            (ePrev->Curr.x == lb->Curr.x) && (ePrev->WindDelta != 0))

-          {

-            IntPoint pt = lb->Curr;

-            AddOutPt(ePrev, pt);

-          }

-          TEdge* eNext = lb->NextInAEL;

-          if ((lb->OutIdx >= 0) && (lb->WindDelta != 0) && eNext && (eNext->OutIdx >= 0) &&

-            (eNext->Curr.x == lb->Curr.x) && (eNext->WindDelta != 0))

-          {

-            IntPoint pt = lb->Curr;

-            AddOutPt(eNext, pt);

-          }

-      }

-      InsertScanbeam(lb->Top.y);

-    }

-    else

-    {

-      InsertEdgeIntoAEL(lb, 0);

-      InsertEdgeIntoAEL(rb, lb);

-      SetWindingCount( *lb );

-      rb->WindCnt = lb->WindCnt;

-      rb->WindCnt2 = lb->WindCnt2;

-      if (IsContributing(*lb))

-      {

-          Op1 = AddLocalMinPoly(lb, rb, lb->Bot);      

-          TEdge* ePrev = lb->PrevInAEL;

-          if ((lb->OutIdx >= 0) && (lb->WindDelta != 0) && ePrev && (ePrev->OutIdx >= 0) &&

-            (ePrev->Curr.x == lb->Curr.x) && (ePrev->WindDelta != 0))

-          {

-            IntPoint pt = lb->Curr;

-            AddOutPt(ePrev, pt);

-          }

-          TEdge* eNext = rb->NextInAEL;

-          if ((rb->OutIdx >= 0) && (rb->WindDelta != 0) && eNext && (eNext->OutIdx >= 0) &&

-            (eNext->Curr.x == rb->Curr.x) && (eNext->WindDelta != 0))

-          {

-            IntPoint pt = rb->Curr;

-            AddOutPt(eNext, pt);

-          }

-      }

-      InsertScanbeam(lb->Top.y);

-    }

-

-     if (rb)

-     {

-		 if (IsHorizontal(*rb))

-		 {

-			 AddEdgeToSEL(rb);

-			 if (rb->NextInLML) 

-				 InsertScanbeam(rb->NextInLML->Top.y);

-		 }

-		 else InsertScanbeam( rb->Top.y );

-     }

-

-    if (!lb || !rb) continue;

-

-    //if any output polygons share an edge, they'll need joining later ...

-    if (Op1 && IsHorizontal(*rb) && 

-      !m_GhostJoins.empty() && (rb->WindDelta != 0))

-    {

-      for (JoinList::size_type i = 0; i < m_GhostJoins.size(); ++i)

-      {

-        Join* jr = m_GhostJoins[i];

-        //if the horizontal Rb and a 'ghost' horizontal overlap, then convert

-        //the 'ghost' join to a real join ready for later ...

-        if (HorzSegmentsOverlap(jr->OutPt1->Pt.x, jr->OffPt.x, rb->Bot.x, rb->Top.x))

-          AddJoin(jr->OutPt1, Op1, jr->OffPt);

-      }

-    }

-

-    if (lb->OutIdx >= 0 && lb->PrevInAEL && 

-      lb->PrevInAEL->Curr.x == lb->Bot.x &&

-      lb->PrevInAEL->OutIdx >= 0 &&

-      SlopesEqual(lb->PrevInAEL->Bot, lb->PrevInAEL->Top, lb->Curr, lb->Top, m_UseFullRange) &&

-      (lb->WindDelta != 0) && (lb->PrevInAEL->WindDelta != 0))

-    {

-        OutPt *Op2 = AddOutPt(lb->PrevInAEL, lb->Bot);

-        AddJoin(Op1, Op2, lb->Top);

-    }

-

-    if(lb->NextInAEL != rb)

-    {

-

-      if (rb->OutIdx >= 0 && rb->PrevInAEL->OutIdx >= 0 &&

-        SlopesEqual(rb->PrevInAEL->Curr, rb->PrevInAEL->Top, rb->Curr, rb->Top, m_UseFullRange) &&

-        (rb->WindDelta != 0) && (rb->PrevInAEL->WindDelta != 0))

-      {

-          OutPt *Op2 = AddOutPt(rb->PrevInAEL, rb->Bot);

-          AddJoin(Op1, Op2, rb->Top);

-      }

-

-      TEdge* e = lb->NextInAEL;

-      if (e)

-      {

-        while( e != rb )

-        {

-          //nb: For calculating winding counts etc, IntersectEdges() assumes

-          //that param1 will be to the Right of param2 ABOVE the intersection ...

-          IntersectEdges(rb , e , lb->Curr); //order important here

-          e = e->NextInAEL;

-        }

-      }

-    }

-    

-  }

-}

-//------------------------------------------------------------------------------

-

-void Clipper::DeleteFromSEL(TEdge *e)

-{

-  TEdge* SelPrev = e->PrevInSEL;

-  TEdge* SelNext = e->NextInSEL;

-  if( !SelPrev &&  !SelNext && (e != m_SortedEdges) ) return; //already deleted

-  if( SelPrev ) SelPrev->NextInSEL = SelNext;

-  else m_SortedEdges = SelNext;

-  if( SelNext ) SelNext->PrevInSEL = SelPrev;

-  e->NextInSEL = 0;

-  e->PrevInSEL = 0;

-}

-//------------------------------------------------------------------------------

-

-#ifdef use_xyz

-void Clipper::SetZ(IntPoint& pt, TEdge& e1, TEdge& e2)

-{

-  if (pt.Z != 0 || !m_ZFill) return;

-  else if (pt == e1.Bot) pt.Z = e1.Bot.Z;

-  else if (pt == e1.Top) pt.Z = e1.Top.Z;

-  else if (pt == e2.Bot) pt.Z = e2.Bot.Z;

-  else if (pt == e2.Top) pt.Z = e2.Top.Z;

-  else (*m_ZFill)(e1.Bot, e1.Top, e2.Bot, e2.Top, pt); 

-}

-//------------------------------------------------------------------------------

-#endif

-

-void Clipper::IntersectEdges(TEdge *e1, TEdge *e2, IntPoint &Pt)

-{

-  bool e1Contributing = ( e1->OutIdx >= 0 );

-  bool e2Contributing = ( e2->OutIdx >= 0 );

-

-#ifdef use_xyz

-        SetZ(Pt, *e1, *e2);

-#endif

-

-#ifdef use_lines

-  //if either edge is on an OPEN path ...

-  if (e1->WindDelta == 0 || e2->WindDelta == 0)

-  {

-    //ignore subject-subject open path intersections UNLESS they

-    //are both open paths, AND they are both 'contributing maximas' ...

-	if (e1->WindDelta == 0 && e2->WindDelta == 0) return;

-

-    //if intersecting a subj line with a subj poly ...

-    else if (e1->PolyTyp == e2->PolyTyp && 

-      e1->WindDelta != e2->WindDelta && m_ClipType == ctUnion)

-    {

-      if (e1->WindDelta == 0)

-      {

-        if (e2Contributing)

-        {

-          AddOutPt(e1, Pt);

-          if (e1Contributing) e1->OutIdx = Unassigned;

-        }

-      }

-      else

-      {

-        if (e1Contributing)

-        {

-          AddOutPt(e2, Pt);

-          if (e2Contributing) e2->OutIdx = Unassigned;

-        }

-      }

-    }

-    else if (e1->PolyTyp != e2->PolyTyp)

-    {

-      //toggle subj open path OutIdx on/off when Abs(clip.WndCnt) == 1 ...

-      if ((e1->WindDelta == 0) && abs(e2->WindCnt) == 1 && 

-        (m_ClipType != ctUnion || e2->WindCnt2 == 0))

-      {

-        AddOutPt(e1, Pt);

-        if (e1Contributing) e1->OutIdx = Unassigned;

-      }

-      else if ((e2->WindDelta == 0) && (abs(e1->WindCnt) == 1) && 

-        (m_ClipType != ctUnion || e1->WindCnt2 == 0))

-      {

-        AddOutPt(e2, Pt);

-        if (e2Contributing) e2->OutIdx = Unassigned;

-      }

-    }

-    return;

-  }

-#endif

-

-  //update winding counts...

-  //assumes that e1 will be to the Right of e2 ABOVE the intersection

-  if ( e1->PolyTyp == e2->PolyTyp )

-  {

-    if ( IsEvenOddFillType( *e1) )

-    {

-      int oldE1WindCnt = e1->WindCnt;

-      e1->WindCnt = e2->WindCnt;

-      e2->WindCnt = oldE1WindCnt;

-    } else

-    {

-      if (e1->WindCnt + e2->WindDelta == 0 ) e1->WindCnt = -e1->WindCnt;

-      else e1->WindCnt += e2->WindDelta;

-      if ( e2->WindCnt - e1->WindDelta == 0 ) e2->WindCnt = -e2->WindCnt;

-      else e2->WindCnt -= e1->WindDelta;

-    }

-  } else

-  {

-    if (!IsEvenOddFillType(*e2)) e1->WindCnt2 += e2->WindDelta;

-    else e1->WindCnt2 = ( e1->WindCnt2 == 0 ) ? 1 : 0;

-    if (!IsEvenOddFillType(*e1)) e2->WindCnt2 -= e1->WindDelta;

-    else e2->WindCnt2 = ( e2->WindCnt2 == 0 ) ? 1 : 0;

-  }

-

-  PolyFillType e1FillType, e2FillType, e1FillType2, e2FillType2;

-  if (e1->PolyTyp == ptSubject)

-  {

-    e1FillType = m_SubjFillType;

-    e1FillType2 = m_ClipFillType;

-  } else

-  {

-    e1FillType = m_ClipFillType;

-    e1FillType2 = m_SubjFillType;

-  }

-  if (e2->PolyTyp == ptSubject)

-  {

-    e2FillType = m_SubjFillType;

-    e2FillType2 = m_ClipFillType;

-  } else

-  {

-    e2FillType = m_ClipFillType;

-    e2FillType2 = m_SubjFillType;

-  }

-

-  cInt e1Wc, e2Wc;

-  switch (e1FillType)

-  {

-    case pftPositive: e1Wc = e1->WindCnt; break;

-    case pftNegative: e1Wc = -e1->WindCnt; break;

-    default: e1Wc = Abs(e1->WindCnt);

-  }

-  switch(e2FillType)

-  {

-    case pftPositive: e2Wc = e2->WindCnt; break;

-    case pftNegative: e2Wc = -e2->WindCnt; break;

-    default: e2Wc = Abs(e2->WindCnt);

-  }

-

-  if ( e1Contributing && e2Contributing )

-  {

-    if ((e1Wc != 0 && e1Wc != 1) || (e2Wc != 0 && e2Wc != 1) ||

-      (e1->PolyTyp != e2->PolyTyp && m_ClipType != ctXor) )

-    {

-      AddLocalMaxPoly(e1, e2, Pt); 

-    }

-    else

-    {

-      AddOutPt(e1, Pt);

-      AddOutPt(e2, Pt);

-      SwapSides( *e1 , *e2 );

-      SwapPolyIndexes( *e1 , *e2 );

-    }

-  }

-  else if ( e1Contributing )

-  {

-    if (e2Wc == 0 || e2Wc == 1) 

-    {

-      AddOutPt(e1, Pt);

-      SwapSides(*e1, *e2);

-      SwapPolyIndexes(*e1, *e2);

-    }

-  }

-  else if ( e2Contributing )

-  {

-    if (e1Wc == 0 || e1Wc == 1) 

-    {

-      AddOutPt(e2, Pt);

-      SwapSides(*e1, *e2);

-      SwapPolyIndexes(*e1, *e2);

-    }

-  } 

-  else if ( (e1Wc == 0 || e1Wc == 1) && (e2Wc == 0 || e2Wc == 1))

-  {

-    //neither edge is currently contributing ...

-

-    cInt e1Wc2, e2Wc2;

-    switch (e1FillType2)

-    {

-      case pftPositive: e1Wc2 = e1->WindCnt2; break;

-      case pftNegative : e1Wc2 = -e1->WindCnt2; break;

-      default: e1Wc2 = Abs(e1->WindCnt2);

-    }

-    switch (e2FillType2)

-    {

-      case pftPositive: e2Wc2 = e2->WindCnt2; break;

-      case pftNegative: e2Wc2 = -e2->WindCnt2; break;

-      default: e2Wc2 = Abs(e2->WindCnt2);

-    }

-

-    if (e1->PolyTyp != e2->PolyTyp)

-    {

-      AddLocalMinPoly(e1, e2, Pt);

-    }

-    else if (e1Wc == 1 && e2Wc == 1)

-      switch( m_ClipType ) {

-        case ctIntersection:

-          if (e1Wc2 > 0 && e2Wc2 > 0)

-            AddLocalMinPoly(e1, e2, Pt);

-          break;

-        case ctUnion:

-          if ( e1Wc2 <= 0 && e2Wc2 <= 0 )

-            AddLocalMinPoly(e1, e2, Pt);

-          break;

-        case ctDifference:

-          if (((e1->PolyTyp == ptClip) && (e1Wc2 > 0) && (e2Wc2 > 0)) ||

-              ((e1->PolyTyp == ptSubject) && (e1Wc2 <= 0) && (e2Wc2 <= 0)))

-                AddLocalMinPoly(e1, e2, Pt);

-          break;

-        case ctXor:

-          AddLocalMinPoly(e1, e2, Pt);

-      }

-    else

-      SwapSides( *e1, *e2 );

-  }

-}

-//------------------------------------------------------------------------------

-

-void Clipper::SetHoleState(TEdge *e, OutRec *outrec)

-{

-  TEdge *e2 = e->PrevInAEL;

-  TEdge *eTmp = 0;

-  while (e2)

-  {

-    if (e2->OutIdx >= 0 && e2->WindDelta != 0)

-    {

-      if (!eTmp) eTmp = e2;

-      else if (eTmp->OutIdx == e2->OutIdx) eTmp = 0;        

-    }

-    e2 = e2->PrevInAEL;

-  }

-  if (!eTmp)

-  {

-    outrec->FirstLeft = 0;

-    outrec->IsHole = false;

-  }

-  else

-  {

-    outrec->FirstLeft = m_PolyOuts[eTmp->OutIdx];

-    outrec->IsHole = !outrec->FirstLeft->IsHole;

-  }

-}

-//------------------------------------------------------------------------------

-

-OutRec* GetLowermostRec(OutRec *outRec1, OutRec *outRec2)

-{

-  //work out which polygon fragment has the correct hole state ...

-  if (!outRec1->BottomPt) 

-    outRec1->BottomPt = GetBottomPt(outRec1->Pts);

-  if (!outRec2->BottomPt) 

-    outRec2->BottomPt = GetBottomPt(outRec2->Pts);

-  OutPt *OutPt1 = outRec1->BottomPt;

-  OutPt *OutPt2 = outRec2->BottomPt;

-  if (OutPt1->Pt.y > OutPt2->Pt.y) return outRec1;

-  else if (OutPt1->Pt.y < OutPt2->Pt.y) return outRec2;

-  else if (OutPt1->Pt.x < OutPt2->Pt.x) return outRec1;

-  else if (OutPt1->Pt.x > OutPt2->Pt.x) return outRec2;

-  else if (OutPt1->Next == OutPt1) return outRec2;

-  else if (OutPt2->Next == OutPt2) return outRec1;

-  else if (FirstIsBottomPt(OutPt1, OutPt2)) return outRec1;

-  else return outRec2;

-}

-//------------------------------------------------------------------------------

-

-bool OutRec1RightOfOutRec2(OutRec* outRec1, OutRec* outRec2)

-{

-  do

-  {

-    outRec1 = outRec1->FirstLeft;

-    if (outRec1 == outRec2) return true;

-  } while (outRec1);

-  return false;

-}

-//------------------------------------------------------------------------------

-

-OutRec* Clipper::GetOutRec(int Idx)

-{

-  OutRec* outrec = m_PolyOuts[Idx];

-  while (outrec != m_PolyOuts[outrec->Idx])

-    outrec = m_PolyOuts[outrec->Idx];

-  return outrec;

-}

-//------------------------------------------------------------------------------

-

-void Clipper::AppendPolygon(TEdge *e1, TEdge *e2)

-{

-  //get the start and ends of both output polygons ...

-  OutRec *outRec1 = m_PolyOuts[e1->OutIdx];

-  OutRec *outRec2 = m_PolyOuts[e2->OutIdx];

-

-  OutRec *holeStateRec;

-  if (OutRec1RightOfOutRec2(outRec1, outRec2))

-    holeStateRec = outRec2;

-  else if (OutRec1RightOfOutRec2(outRec2, outRec1))

-    holeStateRec = outRec1;

-  else 

-    holeStateRec = GetLowermostRec(outRec1, outRec2);

-

-  //get the start and ends of both output polygons and

-  //join e2 poly onto e1 poly and delete pointers to e2 ...

-

-  OutPt* p1_lft = outRec1->Pts;

-  OutPt* p1_rt = p1_lft->Prev;

-  OutPt* p2_lft = outRec2->Pts;

-  OutPt* p2_rt = p2_lft->Prev;

-

-  //join e2 poly onto e1 poly and delete pointers to e2 ...

-  if(  e1->Side == esLeft )

-  {

-    if(  e2->Side == esLeft )

-    {

-      //z y x a b c

-      ReversePolyPtLinks(p2_lft);

-      p2_lft->Next = p1_lft;

-      p1_lft->Prev = p2_lft;

-      p1_rt->Next = p2_rt;

-      p2_rt->Prev = p1_rt;

-      outRec1->Pts = p2_rt;

-    } else

-    {

-      //x y z a b c

-      p2_rt->Next = p1_lft;

-      p1_lft->Prev = p2_rt;

-      p2_lft->Prev = p1_rt;

-      p1_rt->Next = p2_lft;

-      outRec1->Pts = p2_lft;

-    }

-  } else

-  {

-    if(  e2->Side == esRight )

-    {

-      //a b c z y x

-      ReversePolyPtLinks(p2_lft);

-      p1_rt->Next = p2_rt;

-      p2_rt->Prev = p1_rt;

-      p2_lft->Next = p1_lft;

-      p1_lft->Prev = p2_lft;

-    } else

-    {

-      //a b c x y z

-      p1_rt->Next = p2_lft;

-      p2_lft->Prev = p1_rt;

-      p1_lft->Prev = p2_rt;

-      p2_rt->Next = p1_lft;

-    }

-  }

-

-  outRec1->BottomPt = 0;

-  if (holeStateRec == outRec2)

-  {

-    if (outRec2->FirstLeft != outRec1)

-      outRec1->FirstLeft = outRec2->FirstLeft;

-    outRec1->IsHole = outRec2->IsHole;

-  }

-  outRec2->Pts = 0;

-  outRec2->BottomPt = 0;

-  outRec2->FirstLeft = outRec1;

-

-  int OKIdx = e1->OutIdx;

-  int ObsoleteIdx = e2->OutIdx;

-

-  e1->OutIdx = Unassigned; //nb: safe because we only get here via AddLocalMaxPoly

-  e2->OutIdx = Unassigned;

-

-  TEdge* e = m_ActiveEdges;

-  while( e )

-  {

-    if( e->OutIdx == ObsoleteIdx )

-    {

-      e->OutIdx = OKIdx;

-      e->Side = e1->Side;

-      break;

-    }

-    e = e->NextInAEL;

-  }

-

-  outRec2->Idx = outRec1->Idx;

-}

-//------------------------------------------------------------------------------

-

-OutPt* Clipper::AddOutPt(TEdge *e, const IntPoint &pt)

-{

-  if(  e->OutIdx < 0 )

-  {

-    OutRec *outRec = CreateOutRec();

-    outRec->IsOpen = (e->WindDelta == 0);

-    OutPt* newOp = new OutPt;

-    outRec->Pts = newOp;

-    newOp->Idx = outRec->Idx;

-    newOp->Pt = pt;

-    newOp->Next = newOp;

-    newOp->Prev = newOp;

-    if (!outRec->IsOpen)

-      SetHoleState(e, outRec);

-    e->OutIdx = outRec->Idx;

-    return newOp;

-  } else

-  {

-    OutRec *outRec = m_PolyOuts[e->OutIdx];

-    //OutRec.Pts is the 'Left-most' point & OutRec.Pts.Prev is the 'Right-most'

-    OutPt* op = outRec->Pts;

-

-	bool ToFront = (e->Side == esLeft);

-	if (ToFront && (pt == op->Pt)) return op;

-    else if (!ToFront && (pt == op->Prev->Pt)) return op->Prev;

-

-    OutPt* newOp = new OutPt;

-    newOp->Idx = outRec->Idx;

-    newOp->Pt = pt;

-    newOp->Next = op;

-    newOp->Prev = op->Prev;

-    newOp->Prev->Next = newOp;

-    op->Prev = newOp;

-    if (ToFront) outRec->Pts = newOp;

-    return newOp;

-  }

-}

-//------------------------------------------------------------------------------

-

-OutPt* Clipper::GetLastOutPt(TEdge *e)

-{

-	OutRec *outRec = m_PolyOuts[e->OutIdx];

-	if (e->Side == esLeft)

-		return outRec->Pts;

-	else

-		return outRec->Pts->Prev;

-}

-//------------------------------------------------------------------------------

-

-void Clipper::ProcessHorizontals()

-{

-    m_Maxima.sort();

-    TEdge* horzEdge;

-    while (PopEdgeFromSEL(horzEdge))

-    {

-        ProcessHorizontal(horzEdge);

-    }

-    m_Maxima.clear();

-}

-//------------------------------------------------------------------------------

-

-inline bool IsMinima(TEdge *e)

-{

-  return e  && (e->Prev->NextInLML != e) && (e->Next->NextInLML != e);

-}

-//------------------------------------------------------------------------------

-

-inline bool IsMaxima(TEdge *e, const cInt Y)

-{

-  return e && e->Top.y == Y && !e->NextInLML;

-}

-//------------------------------------------------------------------------------

-

-inline bool IsIntermediate(TEdge *e, const cInt Y)

-{

-  return e->Top.y == Y && e->NextInLML;

-}

-//------------------------------------------------------------------------------

-

-TEdge *GetMaximaPair(TEdge *e)

-{

-  if ((e->Next->Top == e->Top) && !e->Next->NextInLML)

-    return e->Next;

-  else if ((e->Prev->Top == e->Top) && !e->Prev->NextInLML)

-    return e->Prev;

-  else return 0;

-}

-//------------------------------------------------------------------------------

-

-TEdge *GetMaximaPairEx(TEdge *e)

-{

-  //as GetMaximaPair() but returns 0 if MaxPair isn't in AEL (unless it's horizontal)

-  TEdge* result = GetMaximaPair(e);

-  if (result && (result->OutIdx == Skip ||

-    (result->NextInAEL == result->PrevInAEL && !IsHorizontal(*result)))) return 0;

-  return result;

-}

-//------------------------------------------------------------------------------

-

-void Clipper::SwapPositionsInSEL(TEdge *Edge1, TEdge *Edge2)

-{

-  if(  !( Edge1->NextInSEL ) &&  !( Edge1->PrevInSEL ) ) return;

-  if(  !( Edge2->NextInSEL ) &&  !( Edge2->PrevInSEL ) ) return;

-

-  if(  Edge1->NextInSEL == Edge2 )

-  {

-    TEdge* Next = Edge2->NextInSEL;

-    if( Next ) Next->PrevInSEL = Edge1;

-    TEdge* Prev = Edge1->PrevInSEL;

-    if( Prev ) Prev->NextInSEL = Edge2;

-    Edge2->PrevInSEL = Prev;

-    Edge2->NextInSEL = Edge1;

-    Edge1->PrevInSEL = Edge2;

-    Edge1->NextInSEL = Next;

-  }

-  else if(  Edge2->NextInSEL == Edge1 )

-  {

-    TEdge* Next = Edge1->NextInSEL;

-    if( Next ) Next->PrevInSEL = Edge2;

-    TEdge* Prev = Edge2->PrevInSEL;

-    if( Prev ) Prev->NextInSEL = Edge1;

-    Edge1->PrevInSEL = Prev;

-    Edge1->NextInSEL = Edge2;

-    Edge2->PrevInSEL = Edge1;

-    Edge2->NextInSEL = Next;

-  }

-  else

-  {

-    TEdge* Next = Edge1->NextInSEL;

-    TEdge* Prev = Edge1->PrevInSEL;

-    Edge1->NextInSEL = Edge2->NextInSEL;

-    if( Edge1->NextInSEL ) Edge1->NextInSEL->PrevInSEL = Edge1;

-    Edge1->PrevInSEL = Edge2->PrevInSEL;

-    if( Edge1->PrevInSEL ) Edge1->PrevInSEL->NextInSEL = Edge1;

-    Edge2->NextInSEL = Next;

-    if( Edge2->NextInSEL ) Edge2->NextInSEL->PrevInSEL = Edge2;

-    Edge2->PrevInSEL = Prev;

-    if( Edge2->PrevInSEL ) Edge2->PrevInSEL->NextInSEL = Edge2;

-  }

-

-  if( !Edge1->PrevInSEL ) m_SortedEdges = Edge1;

-  else if( !Edge2->PrevInSEL ) m_SortedEdges = Edge2;

-}

-//------------------------------------------------------------------------------

-

-TEdge* GetNextInAEL(TEdge *e, Direction dir)

-{

-  return dir == dLeftToRight ? e->NextInAEL : e->PrevInAEL;

-}

-//------------------------------------------------------------------------------

-

-void GetHorzDirection(TEdge& HorzEdge, Direction& Dir, cInt& Left, cInt& Right)

-{

-  if (HorzEdge.Bot.x < HorzEdge.Top.x)

-  {

-    Left = HorzEdge.Bot.x;

-    Right = HorzEdge.Top.x;

-    Dir = dLeftToRight;

-  } else

-  {

-    Left = HorzEdge.Top.x;

-    Right = HorzEdge.Bot.x;

-    Dir = dRightToLeft;

-  }

-}

-//------------------------------------------------------------------------

-

-/*******************************************************************************

-* Notes: Horizontal edges (HEs) at scanline intersections (ie at the Top or    *

-* Bottom of a scanbeam) are processed as if layered. The order in which HEs    *

-* are processed doesn't matter. HEs intersect with other HE Bot.xs only [#]    *

-* (or they could intersect with Top.xs only, ie EITHER Bot.xs OR Top.xs),      *

-* and with other non-horizontal edges [*]. Once these intersections are        *

-* processed, intermediate HEs then 'promote' the Edge above (NextInLML) into   *

-* the AEL. These 'promoted' edges may in turn intersect [%] with other HEs.    *

-*******************************************************************************/

-

-void Clipper::ProcessHorizontal(TEdge *horzEdge)

-{

-  Direction dir;

-  cInt horzLeft, horzRight;

-  bool IsOpen = (horzEdge->WindDelta == 0);

-

-  GetHorzDirection(*horzEdge, dir, horzLeft, horzRight);

-

-  TEdge* eLastHorz = horzEdge, *eMaxPair = 0;

-  while (eLastHorz->NextInLML && IsHorizontal(*eLastHorz->NextInLML)) 

-    eLastHorz = eLastHorz->NextInLML;

-  if (!eLastHorz->NextInLML)

-    eMaxPair = GetMaximaPair(eLastHorz);

-

-  MaximaList::const_iterator maxIt;

-  MaximaList::const_reverse_iterator maxRit;

-  if (!m_Maxima.empty())

-  {

-      //get the first maxima in range (X) ...

-      if (dir == dLeftToRight)

-      {

-          maxIt = m_Maxima.begin();

-          while (maxIt != m_Maxima.end() && *maxIt <= horzEdge->Bot.x) maxIt++;

-          if (maxIt != m_Maxima.end() && *maxIt >= eLastHorz->Top.x)

-              maxIt = m_Maxima.end();

-      }

-      else

-      {

-          maxRit = m_Maxima.rbegin();

-          while (maxRit != m_Maxima.rend() && *maxRit > horzEdge->Bot.x) maxRit++;

-          if (maxRit != m_Maxima.rend() && *maxRit <= eLastHorz->Top.x)

-              maxRit = m_Maxima.rend();

-      }

-  }

-

-  OutPt* op1 = 0;

-

-  for (;;) //loop through consec. horizontal edges

-  {

-		  

-    bool IsLastHorz = (horzEdge == eLastHorz);

-    TEdge* e = GetNextInAEL(horzEdge, dir);

-    while(e)

-    {

-

-        //this code block inserts extra coords into horizontal edges (in output

-        //polygons) whereever maxima touch these horizontal edges. This helps

-        //'simplifying' polygons (ie if the Simplify property is set).

-        if (!m_Maxima.empty())

-        {

-            if (dir == dLeftToRight)

-            {

-                while (maxIt != m_Maxima.end() && *maxIt < e->Curr.x) 

-                {

-                  if (horzEdge->OutIdx >= 0 && !IsOpen)

-                    AddOutPt(horzEdge, IntPoint(*maxIt, horzEdge->Bot.y));

-                  maxIt++;

-                }

-            }

-            else

-            {

-                while (maxRit != m_Maxima.rend() && *maxRit > e->Curr.x)

-                {

-                  if (horzEdge->OutIdx >= 0 && !IsOpen)

-                    AddOutPt(horzEdge, IntPoint(*maxRit, horzEdge->Bot.y));

-                  maxRit++;

-                }

-            }

-        };

-

-        if ((dir == dLeftToRight && e->Curr.x > horzRight) ||

-			(dir == dRightToLeft && e->Curr.x < horzLeft)) break;

-

-		//Also break if we've got to the end of an intermediate horizontal edge ...

-		//nb: Smaller Dx's are to the right of larger Dx's ABOVE the horizontal.

-		if (e->Curr.x == horzEdge->Top.x && horzEdge->NextInLML && 

-			e->Dx < horzEdge->NextInLML->Dx) break;

-

-    if (horzEdge->OutIdx >= 0 && !IsOpen)  //note: may be done multiple times

-		{

-            op1 = AddOutPt(horzEdge, e->Curr);

-			TEdge* eNextHorz = m_SortedEdges;

-			while (eNextHorz)

-			{

-				if (eNextHorz->OutIdx >= 0 &&

-					HorzSegmentsOverlap(horzEdge->Bot.x,

-					horzEdge->Top.x, eNextHorz->Bot.x, eNextHorz->Top.x))

-				{

-                    OutPt* op2 = GetLastOutPt(eNextHorz);

-                    AddJoin(op2, op1, eNextHorz->Top);

-				}

-				eNextHorz = eNextHorz->NextInSEL;

-			}

-			AddGhostJoin(op1, horzEdge->Bot);

-		}

-		

-		//OK, so far we're still in range of the horizontal Edge  but make sure

-        //we're at the last of consec. horizontals when matching with eMaxPair

-        if(e == eMaxPair && IsLastHorz)

-        {

-          if (horzEdge->OutIdx >= 0)

-            AddLocalMaxPoly(horzEdge, eMaxPair, horzEdge->Top);

-          DeleteFromAEL(horzEdge);

-          DeleteFromAEL(eMaxPair);

-          return;

-        }

-        

-		if(dir == dLeftToRight)

-        {

-          IntPoint Pt = IntPoint(e->Curr.x, horzEdge->Curr.y);

-          IntersectEdges(horzEdge, e, Pt);

-        }

-        else

-        {

-          IntPoint Pt = IntPoint(e->Curr.x, horzEdge->Curr.y);

-          IntersectEdges( e, horzEdge, Pt);

-        }

-        TEdge* eNext = GetNextInAEL(e, dir);

-        SwapPositionsInAEL( horzEdge, e );

-        e = eNext;

-    } //end while(e)

-

-	//Break out of loop if HorzEdge.NextInLML is not also horizontal ...

-	if (!horzEdge->NextInLML || !IsHorizontal(*horzEdge->NextInLML)) break;

-

-	UpdateEdgeIntoAEL(horzEdge);

-    if (horzEdge->OutIdx >= 0) AddOutPt(horzEdge, horzEdge->Bot);

-    GetHorzDirection(*horzEdge, dir, horzLeft, horzRight);

-

-  } //end for (;;)

-

-  if (horzEdge->OutIdx >= 0 && !op1)

-  {

-      op1 = GetLastOutPt(horzEdge);

-      TEdge* eNextHorz = m_SortedEdges;

-      while (eNextHorz)

-      {

-          if (eNextHorz->OutIdx >= 0 &&

-              HorzSegmentsOverlap(horzEdge->Bot.x,

-              horzEdge->Top.x, eNextHorz->Bot.x, eNextHorz->Top.x))

-          {

-              OutPt* op2 = GetLastOutPt(eNextHorz);

-              AddJoin(op2, op1, eNextHorz->Top);

-          }

-          eNextHorz = eNextHorz->NextInSEL;

-      }

-      AddGhostJoin(op1, horzEdge->Top);

-  }

-

-  if (horzEdge->NextInLML)

-  {

-    if(horzEdge->OutIdx >= 0)

-    {

-      op1 = AddOutPt( horzEdge, horzEdge->Top);

-      //When StrictlySimple and 'horzEdge' is being touched by another edge, then

-      //make sure both edges have a vertex here ...

-      if (m_StrictSimple)

-      {  

-        TEdge* ePrev = horzEdge->PrevInAEL;

-        if ((horzEdge->WindDelta != 0) && ePrev && (ePrev->OutIdx >= 0) &&

-          (ePrev->Curr.x == horzEdge->Top.x) && (ePrev->WindDelta != 0))

-        {

-          IntPoint pt = horzEdge->Top;

-          AddOutPt(ePrev, pt);

-        }

-        TEdge* eNext = horzEdge->NextInAEL;

-        if ((horzEdge->WindDelta != 0) && eNext && (eNext->OutIdx >= 0) &&

-          (eNext->Curr.x == horzEdge->Top.x) && (eNext->WindDelta != 0))

-        {

-          IntPoint pt = horzEdge->Top;

-          AddOutPt(eNext, pt);

-        }

-      }

-      UpdateEdgeIntoAEL(horzEdge);

-      if (horzEdge->WindDelta == 0) return;

-      //nb: HorzEdge is no longer horizontal here

-      TEdge* ePrev = horzEdge->PrevInAEL;

-      TEdge* eNext = horzEdge->NextInAEL;

-      if (ePrev && ePrev->Curr.x == horzEdge->Bot.x &&

-        ePrev->Curr.y == horzEdge->Bot.y && ePrev->WindDelta != 0 &&

-        (ePrev->OutIdx >= 0 && ePrev->Curr.y > ePrev->Top.y &&

-        SlopesEqual(*horzEdge, *ePrev, m_UseFullRange)))

-      {

-        OutPt* op2 = AddOutPt(ePrev, horzEdge->Bot);

-        AddJoin(op1, op2, horzEdge->Top);

-      }

-      else if (eNext && eNext->Curr.x == horzEdge->Bot.x &&

-        eNext->Curr.y == horzEdge->Bot.y && eNext->WindDelta != 0 &&

-        eNext->OutIdx >= 0 && eNext->Curr.y > eNext->Top.y &&

-        SlopesEqual(*horzEdge, *eNext, m_UseFullRange))

-      {

-        OutPt* op2 = AddOutPt(eNext, horzEdge->Bot);

-        AddJoin(op1, op2, horzEdge->Top);

-      }

-    }

-    else

-      UpdateEdgeIntoAEL(horzEdge); 

-  }

-  else

-  {

-    if (horzEdge->OutIdx >= 0) AddOutPt(horzEdge, horzEdge->Top);

-    DeleteFromAEL(horzEdge);

-  }

-}

-//------------------------------------------------------------------------------

-

-bool Clipper::ProcessIntersections(const cInt topY)

-{

-  if( !m_ActiveEdges ) return true;

-  try {

-    BuildIntersectList(topY);

-    size_t IlSize = m_IntersectList.size();

-    if (IlSize == 0) return true;

-    if (IlSize == 1 || FixupIntersectionOrder()) ProcessIntersectList();

-    else return false;

-  }

-  catch(std::exception const& ex) 

-  {

-    m_SortedEdges = 0;

-    DisposeIntersectNodes();

-    throw clipperException((std::string("ProcessIntersections error ") + ex.what()).c_str());

-  }

-  m_SortedEdges = 0;

-  return true;

-}

-//------------------------------------------------------------------------------

-

-void Clipper::DisposeIntersectNodes()

-{

-  for (size_t i = 0; i < m_IntersectList.size(); ++i )

-    delete m_IntersectList[i];

-  m_IntersectList.clear();

-}

-//------------------------------------------------------------------------------

-

-void Clipper::BuildIntersectList(const cInt topY)

-{

-  if ( !m_ActiveEdges ) return;

-

-  //prepare for sorting ...

-  TEdge* e = m_ActiveEdges;

-  m_SortedEdges = e;

-  while( e )

-  {

-    e->PrevInSEL = e->PrevInAEL;

-    e->NextInSEL = e->NextInAEL;

-    e->Curr.x = TopX( *e, topY );

-    e = e->NextInAEL;

-  }

-

-  //bubblesort ...

-  bool isModified;

-  do

-  {

-    isModified = false;

-    e = m_SortedEdges;

-    while( e->NextInSEL )

-    {

-      TEdge *eNext = e->NextInSEL;

-      IntPoint Pt;

-      if(e->Curr.x > eNext->Curr.x)

-      {

-        IntersectPoint(*e, *eNext, Pt);

-        if (Pt.y < topY) Pt = IntPoint(TopX(*e, topY), topY);

-        IntersectNode * newNode = new IntersectNode;

-        newNode->Edge1 = e;

-        newNode->Edge2 = eNext;

-        newNode->Pt = Pt;

-        m_IntersectList.push_back(newNode);

-

-        SwapPositionsInSEL(e, eNext);

-        isModified = true;

-      }

-      else

-        e = eNext;

-    }

-    if( e->PrevInSEL ) e->PrevInSEL->NextInSEL = 0;

-    else break;

-  }

-  while ( isModified );

-  m_SortedEdges = 0; //important

-}

-//------------------------------------------------------------------------------

-

-

-void Clipper::ProcessIntersectList()

-{

-  for (size_t i = 0; i < m_IntersectList.size(); ++i)

-  {

-    IntersectNode* iNode = m_IntersectList[i];

-    {

-      IntersectEdges( iNode->Edge1, iNode->Edge2, iNode->Pt);

-      SwapPositionsInAEL( iNode->Edge1 , iNode->Edge2 );

-    }

-    delete iNode;

-  }

-  m_IntersectList.clear();

-}

-//------------------------------------------------------------------------------

-

-bool IntersectListSort(IntersectNode* node1, IntersectNode* node2)

-{

-    if (node2->Pt.y != node1->Pt.y)

-    {

-        return node2->Pt.y < node1->Pt.y;

-    }

-    else

-    {

-        return (node2->Edge1->WindCnt2 + node2->Edge2->WindCnt2) > (node1->Edge1->WindCnt2 + node1->Edge2->WindCnt2);

-    }

-}

-//------------------------------------------------------------------------------

-

-inline bool EdgesAdjacent(const IntersectNode &inode)

-{

-  return (inode.Edge1->NextInSEL == inode.Edge2) ||

-    (inode.Edge1->PrevInSEL == inode.Edge2);

-}

-//------------------------------------------------------------------------------

-

-bool Clipper::FixupIntersectionOrder()

-{

-  //pre-condition: intersections are sorted Bottom-most first.

-  //Now it's crucial that intersections are made only between adjacent edges,

-  //so to ensure this the order of intersections may need adjusting ...

-  CopyAELToSEL();

-  std::stable_sort(m_IntersectList.begin(), m_IntersectList.end(), IntersectListSort);

-  size_t cnt = m_IntersectList.size();

-  for (size_t i = 0; i < cnt; ++i) 

-  {

-    if (!EdgesAdjacent(*m_IntersectList[i]))

-    {

-      size_t j = i + 1;

-      while (j < cnt && !EdgesAdjacent(*m_IntersectList[j])) j++;

-      if (j == cnt)  return false;

-      std::swap(m_IntersectList[i], m_IntersectList[j]);

-    }

-    SwapPositionsInSEL(m_IntersectList[i]->Edge1, m_IntersectList[i]->Edge2);

-  }

-  return true;

-}

-//------------------------------------------------------------------------------

-

-void Clipper::DoMaxima(TEdge *e)

-{

-  TEdge* eMaxPair = GetMaximaPairEx(e);

-  if (!eMaxPair)

-  {

-    if (e->OutIdx >= 0)

-    {

-      AddOutPt(e, e->Top);

-    }

-    DeleteFromAEL(e);

-    return;

-  }

-  

-  TEdge* ePrev = e->PrevInAEL;

-  if (ePrev && ePrev->Curr.x == e->Top.x && ePrev->Top != e->Top && ePrev->OutIdx >= 0 && 

-      ePrev->WindDelta != 0 &&  e->OutIdx >= 0 && e->WindDelta != 0)

-  {

-      IntPoint pt = e->Top;

-      AddOutPt(ePrev, pt);

-  }

-  TEdge* eNext = e->NextInAEL;

-  while(eNext && eNext != eMaxPair)

-  {

-    IntersectEdges(e, eNext, e->Top);

-    SwapPositionsInAEL(e, eNext);

-    eNext = e->NextInAEL;

-  }

-  eNext = eMaxPair->NextInAEL;

-  if (eNext && eNext->Curr.x == e->Top.x && eNext->Top != e->Top && eNext->OutIdx >= 0 && 

-      eNext->WindDelta != 0 &&  e->OutIdx >= 0 && e->WindDelta != 0)

-  {

-      IntPoint pt = e->Top;

-      AddOutPt(eNext, pt);

-  }

-

-  if(e->OutIdx == Unassigned && eMaxPair->OutIdx == Unassigned)

-  {

-    DeleteFromAEL(e);

-    DeleteFromAEL(eMaxPair);

-  }

-  else if( e->OutIdx >= 0 && eMaxPair->OutIdx >= 0 )

-  {

-      AddLocalMaxPoly(e, eMaxPair, e->Top);

-      DeleteFromAEL(e);

-      DeleteFromAEL(eMaxPair);

-  }

-#ifdef use_lines

-  else if (e->WindDelta == 0)

-  {

-    if (e->OutIdx >= 0) 

-    {

-      AddOutPt(e, e->Top);

-      e->OutIdx = Unassigned;

-    }

-    DeleteFromAEL(e);

-

-    if (eMaxPair->OutIdx >= 0)

-    {

-      AddOutPt(eMaxPair, e->Top);

-      eMaxPair->OutIdx = Unassigned;

-    }

-    DeleteFromAEL(eMaxPair);

-  } 

-#endif

-  else throw clipperException("DoMaxima error");

-}

-//------------------------------------------------------------------------------

-

-void Clipper::ProcessEdgesAtTopOfScanbeam(const cInt topY)

-{

-  TEdge* e = m_ActiveEdges;

-  MaximaList next_maxima;

-  while( e )

-  {

-    //1. process maxima, treating them as if they're 'bent' horizontal edges,

-    //   but exclude maxima with horizontal edges. nb: e can't be a horizontal.

-    bool IsMaximaEdge = IsMaxima(e, topY);

-

-    if(IsMaximaEdge)

-    {

-      TEdge* eMaxPair = GetMaximaPairEx(e);

-      IsMaximaEdge = (!eMaxPair || !IsHorizontal(*eMaxPair));

-    }

-

-    if(IsMaximaEdge)

-    {

-      if (m_StrictSimple)

-      {

-          m_Maxima.push_back(e->Top.x);

-          next_maxima.push_back(e->Top.x);

-      }

-      TEdge* ePrev = e->PrevInAEL;

-      DoMaxima(e);

-      if( !ePrev ) e = m_ActiveEdges;

-      else e = ePrev->NextInAEL;

-    }

-    else

-    {

-      //2. promote horizontal edges, otherwise update Curr.x and Curr.y ...

-      if (IsIntermediate(e, topY) && IsHorizontal(*e->NextInLML))

-      {

-        UpdateEdgeIntoAEL(e);

-        if (e->OutIdx >= 0)

-        {

-          AddOutPt(e, e->Bot);

-          if (m_StrictSimple) 

-          {

-              m_Maxima.push_back(e->Top.x);

-              m_Maxima.push_back(e->Bot.x);

-              next_maxima.push_back(e->Bot.x);

-          }

-        }

-        AddEdgeToSEL(e);

-      } 

-      else

-      {

-        e->Curr.x = TopX( *e, topY );

-        e->Curr.y = topY;

-      }

-

-      //When StrictlySimple and 'e' is being touched by another edge, then

-      //make sure both edges have a vertex here ...

-      if (m_StrictSimple && e->OutIdx >= 0 && e->WindDelta != 0)

-      {  

-        TEdge* ePrev = e->PrevInAEL;

-        while (ePrev && ePrev->Curr.x == e->Curr.x)

-        {

-          if (ePrev->OutIdx >= 0 && ePrev->WindDelta != 0 && 

-              !(e->Bot == ePrev->Bot && e->Top == ePrev->Top))

-          {

-            IntPoint pt = e->Curr;

-#ifdef use_xyz

-            SetZ(pt, *ePrev, *e);

-#endif

-            OutPt* op = AddOutPt(ePrev, pt);

-            OutPt* op2 = AddOutPt(e, pt);

-            AddJoin(op, op2, pt); //StrictlySimple (type-3) join

-          }

-          ePrev = ePrev->PrevInAEL;

-        }

-      }

-

-      e = e->NextInAEL;

-    }

-  }

-  if (m_StrictSimple)

-  {

-      MinimaList::iterator lm = m_CurrentLM;

-      while (lm != m_MinimaList.end() && lm->y == topY)

-      {

-          if (lm->LeftBound && lm->RightBound)

-          {

-              m_Maxima.push_back(lm->LeftBound->Bot.x);

-          }

-          ++lm;

-      }

-  }

-

-  //3. Process horizontals at the Top of the scanbeam ...

-  ProcessHorizontals();

-  if (m_StrictSimple && !next_maxima.empty())

-  {

-    m_Maxima.insert(m_Maxima.end(), next_maxima.begin(), next_maxima.end());

-  }

-

-  //4. Promote intermediate vertices ...

-  e = m_ActiveEdges;

-  while(e)

-  {

-    if(IsIntermediate(e, topY))

-    {

-      OutPt* op = 0;

-      if( e->OutIdx >= 0 ) 

-        op = AddOutPt(e, e->Top);

-      UpdateEdgeIntoAEL(e);

-

-      //if output polygons share an edge, they'll need joining later ...

-      TEdge* ePrev = e->PrevInAEL;

-      TEdge* eNext = e->NextInAEL;

-      if (ePrev && ePrev->Curr.x == e->Bot.x &&

-        ePrev->Curr.y == e->Bot.y && op &&

-        ePrev->OutIdx >= 0 && ePrev->Curr.y > ePrev->Top.y &&

-        SlopesEqual(e->Curr, e->Top, ePrev->Curr, ePrev->Top, m_UseFullRange) &&

-        (e->WindDelta != 0) && (ePrev->WindDelta != 0))

-      {

-        OutPt* op2 = AddOutPt(ePrev, e->Bot);

-        AddJoin(op, op2, e->Top);

-      }

-      else if (eNext && eNext->Curr.x == e->Bot.x &&

-        eNext->Curr.y == e->Bot.y && op &&

-        eNext->OutIdx >= 0 && eNext->Curr.y > eNext->Top.y &&

-        SlopesEqual(e->Curr, e->Top, eNext->Curr, eNext->Top, m_UseFullRange) &&

-        (e->WindDelta != 0) && (eNext->WindDelta != 0))

-      {

-        OutPt* op2 = AddOutPt(eNext, e->Bot);

-        AddJoin(op, op2, e->Top);

-      }

-    }

-    e = e->NextInAEL;

-  }

-}

-//------------------------------------------------------------------------------

-

-void Clipper::FixupOutPolyline(OutRec &outrec)

-{

-  OutPt *pp = outrec.Pts;

-  OutPt *lastPP = pp->Prev;

-  while (pp != lastPP)

-  {

-    pp = pp->Next;

-    if (pp->Pt == pp->Prev->Pt)

-    {

-      if (pp == lastPP) lastPP = pp->Prev;

-      OutPt *tmpPP = pp->Prev;

-      tmpPP->Next = pp->Next;

-      pp->Next->Prev = tmpPP;

-      delete pp;

-      pp = tmpPP;

-    }

-  }

-

-  if (pp == pp->Prev)

-  {

-    DisposeOutPts(pp);

-    outrec.Pts = 0;

-    return;

-  }

-}

-//------------------------------------------------------------------------------

-

-void Clipper::FixupOutPolygon(OutRec &outrec)

-{

-    //FixupOutPolygon() - removes duplicate points and simplifies consecutive

-    //parallel edges by removing the middle vertex.

-    OutPt *lastOK = 0;

-    outrec.BottomPt = 0;

-    OutPt *pp = outrec.Pts;

-    bool preserveCol = m_PreserveCollinear || m_StrictSimple;

-

-    for (;;)

-    {

-        if (pp->Prev == pp || pp->Prev == pp->Next)

-        {

-            DisposeOutPts(pp);

-            outrec.Pts = 0;

-            return;

-        }

-

-        //test for duplicate points and collinear edges ...

-        if ((pp->Pt == pp->Next->Pt) || (pp->Pt == pp->Prev->Pt) ||

-            (SlopesEqual(pp->Prev->Pt, pp->Pt, pp->Next->Pt, m_UseFullRange) &&

-            (!preserveCol || !Pt2IsBetweenPt1AndPt3(pp->Prev->Pt, pp->Pt, pp->Next->Pt))))

-        {

-            lastOK = 0;

-            OutPt *tmp = pp;

-            pp->Prev->Next = pp->Next;

-            pp->Next->Prev = pp->Prev;

-            pp = pp->Prev;

-            delete tmp;

-        }

-        else if (pp == lastOK) break;

-        else

-        {

-            if (!lastOK) lastOK = pp;

-            pp = pp->Next;

-        }

-    }

-    outrec.Pts = pp;

-}

-//------------------------------------------------------------------------------

-

-int PointCount(OutPt *Pts)

-{

-    if (!Pts) return 0;

-    int result = 0;

-    OutPt* p = Pts;

-    do

-    {

-        result++;

-        p = p->Next;

-    }

-    while (p != Pts);

-    return result;

-}

-

-//------------------------------------------------------------------------------

-

-void Clipper::BuildResult(Paths &polys)

-{

-  polys.reserve(m_PolyOuts.size());

-  for (PolyOutList::size_type i = 0; i < m_PolyOuts.size(); ++i)

-  {

-    if (!m_PolyOuts[i]->Pts) continue;

-    Path pg;

-    OutPt* p = m_PolyOuts[i]->Pts->Prev;

-    int cnt = PointCount(p);

-    if (cnt < 2) continue;

-    pg.reserve(cnt);

-    for (int j = 0; j < cnt; ++j)

-    {

-      pg.push_back(p->Pt);

-      p = p->Prev;

-    }

-    polys.push_back(pg);

-  }

-}

-//------------------------------------------------------------------------------

-

-void Clipper::BuildResult2(PolyTree& polytree)

-{

-    polytree.Clear();

-    polytree.AllNodes.reserve(m_PolyOuts.size());

-    //add each output polygon/contour to polytree ...

-    for (PolyOutList::size_type i = 0; i < m_PolyOuts.size(); i++)

-    {

-        OutRec* outRec = m_PolyOuts[i];

-        int cnt = PointCount(outRec->Pts);

-        if ((outRec->IsOpen && cnt < 2) || (!outRec->IsOpen && cnt < 3)) continue;

-        FixHoleLinkage(*outRec);

-        PolyNode* pn = new PolyNode();

-        //nb: polytree takes ownership of all the PolyNodes

-        polytree.AllNodes.push_back(pn);

-        outRec->PolyNd = pn;

-        pn->Parent = 0;

-        pn->Index = 0;

-        pn->Contour.reserve(cnt);

-        OutPt *op = outRec->Pts->Prev;

-        for (int j = 0; j < cnt; j++)

-        {

-            pn->Contour.push_back(op->Pt);

-            op = op->Prev;

-        }

-    }

-

-    //fixup PolyNode links etc ...

-    polytree.Childs.reserve(m_PolyOuts.size());

-    for (PolyOutList::size_type i = 0; i < m_PolyOuts.size(); i++)

-    {

-        OutRec* outRec = m_PolyOuts[i];

-        if (!outRec->PolyNd) continue;

-        if (outRec->IsOpen) 

-        {

-          outRec->PolyNd->m_IsOpen = true;

-          polytree.AddChild(*outRec->PolyNd);

-        }

-        else if (outRec->FirstLeft && outRec->FirstLeft->PolyNd) 

-          outRec->FirstLeft->PolyNd->AddChild(*outRec->PolyNd);

-        else

-          polytree.AddChild(*outRec->PolyNd);

-    }

-}

-//------------------------------------------------------------------------------

-

-void SwapIntersectNodes(IntersectNode &int1, IntersectNode &int2)

-{

-  //just swap the contents (because fIntersectNodes is a single-linked-list)

-  IntersectNode inode = int1; //gets a copy of Int1

-  int1.Edge1 = int2.Edge1;

-  int1.Edge2 = int2.Edge2;

-  int1.Pt = int2.Pt;

-  int2.Edge1 = inode.Edge1;

-  int2.Edge2 = inode.Edge2;

-  int2.Pt = inode.Pt;

-}

-//------------------------------------------------------------------------------

-

-inline bool E2InsertsBeforeE1(TEdge &e1, TEdge &e2)

-{

-  if (e2.Curr.x == e1.Curr.x) 

-  {

-    if (e2.Top.y > e1.Top.y)

-      return e2.Top.x < TopX(e1, e2.Top.y); 

-      else return e1.Top.x > TopX(e2, e1.Top.y);

-  } 

-  else return e2.Curr.x < e1.Curr.x;

-}

-//------------------------------------------------------------------------------

-

-bool GetOverlap(const cInt a1, const cInt a2, const cInt b1, const cInt b2, 

-    cInt& Left, cInt& Right)

-{

-  if (a1 < a2)

-  {

-    if (b1 < b2) {Left = std::max(a1,b1); Right = std::min(a2,b2);}

-    else {Left = std::max(a1,b2); Right = std::min(a2,b1);}

-  } 

-  else

-  {

-    if (b1 < b2) {Left = std::max(a2,b1); Right = std::min(a1,b2);}

-    else {Left = std::max(a2,b2); Right = std::min(a1,b1);}

-  }

-  return Left < Right;

-}

-//------------------------------------------------------------------------------

-

-inline void UpdateOutPtIdxs(OutRec& outrec)

-{  

-  OutPt* op = outrec.Pts;

-  do

-  {

-    op->Idx = outrec.Idx;

-    op = op->Prev;

-  }

-  while(op != outrec.Pts);

-}

-//------------------------------------------------------------------------------

-

-void Clipper::InsertEdgeIntoAEL(TEdge *edge, TEdge* startEdge)

-{

-  if(!m_ActiveEdges)

-  {

-    edge->PrevInAEL = 0;

-    edge->NextInAEL = 0;

-    m_ActiveEdges = edge;

-  }

-  else if(!startEdge && E2InsertsBeforeE1(*m_ActiveEdges, *edge))

-  {

-      edge->PrevInAEL = 0;

-      edge->NextInAEL = m_ActiveEdges;

-      m_ActiveEdges->PrevInAEL = edge;

-      m_ActiveEdges = edge;

-  } 

-  else

-  {

-    if(!startEdge) startEdge = m_ActiveEdges;

-    while(startEdge->NextInAEL  && 

-      !E2InsertsBeforeE1(*startEdge->NextInAEL , *edge))

-        startEdge = startEdge->NextInAEL;

-    edge->NextInAEL = startEdge->NextInAEL;

-    if(startEdge->NextInAEL) startEdge->NextInAEL->PrevInAEL = edge;

-    edge->PrevInAEL = startEdge;

-    startEdge->NextInAEL = edge;

-  }

-}

-//----------------------------------------------------------------------

-

-OutPt* DupOutPt(OutPt* outPt, bool InsertAfter)

-{

-  OutPt* result = new OutPt;

-  result->Pt = outPt->Pt;

-  result->Idx = outPt->Idx;

-  if (InsertAfter)

-  {

-    result->Next = outPt->Next;

-    result->Prev = outPt;

-    outPt->Next->Prev = result;

-    outPt->Next = result;

-  } 

-  else

-  {

-    result->Prev = outPt->Prev;

-    result->Next = outPt;

-    outPt->Prev->Next = result;

-    outPt->Prev = result;

-  }

-  return result;

-}

-//------------------------------------------------------------------------------

-

-bool JoinHorz(OutPt* op1, OutPt* op1b, OutPt* op2, OutPt* op2b,

-  const IntPoint Pt, bool DiscardLeft)

-{

-  Direction Dir1 = (op1->Pt.x > op1b->Pt.x ? dRightToLeft : dLeftToRight);

-  Direction Dir2 = (op2->Pt.x > op2b->Pt.x ? dRightToLeft : dLeftToRight);

-  if (Dir1 == Dir2) return false;

-

-  //When DiscardLeft, we want Op1b to be on the Left of Op1, otherwise we

-  //want Op1b to be on the Right. (And likewise with Op2 and Op2b.)

-  //So, to facilitate this while inserting Op1b and Op2b ...

-  //when DiscardLeft, make sure we're AT or RIGHT of Pt before adding Op1b,

-  //otherwise make sure we're AT or LEFT of Pt. (Likewise with Op2b.)

-  if (Dir1 == dLeftToRight) 

-  {

-    while (op1->Next->Pt.x <= Pt.x && 

-      op1->Next->Pt.x >= op1->Pt.x && op1->Next->Pt.y == Pt.y)  

-        op1 = op1->Next;

-    if (DiscardLeft && (op1->Pt.x != Pt.x)) op1 = op1->Next;

-    op1b = DupOutPt(op1, !DiscardLeft);

-    if (op1b->Pt != Pt) 

-    {

-      op1 = op1b;

-      op1->Pt = Pt;

-      op1b = DupOutPt(op1, !DiscardLeft);

-    }

-  } 

-  else

-  {

-    while (op1->Next->Pt.x >= Pt.x && 

-      op1->Next->Pt.x <= op1->Pt.x && op1->Next->Pt.y == Pt.y) 

-        op1 = op1->Next;

-    if (!DiscardLeft && (op1->Pt.x != Pt.x)) op1 = op1->Next;

-    op1b = DupOutPt(op1, DiscardLeft);

-    if (op1b->Pt != Pt)

-    {

-      op1 = op1b;

-      op1->Pt = Pt;

-      op1b = DupOutPt(op1, DiscardLeft);

-    }

-  }

-

-  if (Dir2 == dLeftToRight)

-  {

-    while (op2->Next->Pt.x <= Pt.x && 

-      op2->Next->Pt.x >= op2->Pt.x && op2->Next->Pt.y == Pt.y)

-        op2 = op2->Next;

-    if (DiscardLeft && (op2->Pt.x != Pt.x)) op2 = op2->Next;

-    op2b = DupOutPt(op2, !DiscardLeft);

-    if (op2b->Pt != Pt)

-    {

-      op2 = op2b;

-      op2->Pt = Pt;

-      op2b = DupOutPt(op2, !DiscardLeft);

-    };

-  } else

-  {

-    while (op2->Next->Pt.x >= Pt.x && 

-      op2->Next->Pt.x <= op2->Pt.x && op2->Next->Pt.y == Pt.y) 

-        op2 = op2->Next;

-    if (!DiscardLeft && (op2->Pt.x != Pt.x)) op2 = op2->Next;

-    op2b = DupOutPt(op2, DiscardLeft);

-    if (op2b->Pt != Pt)

-    {

-      op2 = op2b;

-      op2->Pt = Pt;

-      op2b = DupOutPt(op2, DiscardLeft);

-    };

-  };

-

-  if ((Dir1 == dLeftToRight) == DiscardLeft)

-  {

-    op1->Prev = op2;

-    op2->Next = op1;

-    op1b->Next = op2b;

-    op2b->Prev = op1b;

-  }

-  else

-  {

-    op1->Next = op2;

-    op2->Prev = op1;

-    op1b->Prev = op2b;

-    op2b->Next = op1b;

-  }

-  return true;

-}

-//------------------------------------------------------------------------------

-

-bool Clipper::JoinPoints(Join *j, OutRec* outRec1, OutRec* outRec2)

-{

-  OutPt *op1 = j->OutPt1, *op1b;

-  OutPt *op2 = j->OutPt2, *op2b;

-

-  //There are 3 kinds of joins for output polygons ...

-  //1. Horizontal joins where Join.OutPt1 & Join.OutPt2 are vertices anywhere

-  //along (horizontal) collinear edges (& Join.OffPt is on the same horizontal).

-  //2. Non-horizontal joins where Join.OutPt1 & Join.OutPt2 are at the same

-  //location at the Bottom of the overlapping segment (& Join.OffPt is above).

-  //3. StrictSimple joins where edges touch but are not collinear and where

-  //Join.OutPt1, Join.OutPt2 & Join.OffPt all share the same point.

-  bool isHorizontal = (j->OutPt1->Pt.y == j->OffPt.y);

-

-  if (isHorizontal  && (j->OffPt == j->OutPt1->Pt) &&

-  (j->OffPt == j->OutPt2->Pt))

-  {

-    if (outRec1 != outRec2)

-    {

-        // First Op1 Next and Op2 Prev

-        op1b = j->OutPt1->Next;

-        while (op1b != op1 && (op1b->Pt == j->OffPt)) 

-          op1b = op1b->Next;

-        op2b = j->OutPt2->Prev;

-        while (op2b != op2 && (op2b->Pt == j->OffPt)) 

-          op2b = op2b->Prev;

-        if (op1b->Pt == op2b->Pt)

-        {

-            OutPt* op1b_prev = op1b->Prev;

-            OutPt* op2b_next = op2b->Next;

-            op1b->Prev = op2b;

-            op2b->Next = op1b;

-            op1b_prev->Next = op2b_next;

-            op2b_next->Prev = op1b_prev;

-            return true;

-        }

-        

-        // Second Op1 Prev and Op2 Next

-        op2b = j->OutPt2->Next;

-        while (op2b != op2 && (op2b->Pt == j->OffPt)) 

-          op2b = op2b->Next;

-        op1b = j->OutPt1->Prev;

-        while (op1b != op1 && (op1b->Pt == j->OffPt)) 

-          op1b = op1b->Prev;

-        if (op2b->Pt == op1b->Pt)

-        {

-            OutPt* op2b_prev = op2b->Prev;

-            OutPt* op1b_next = op1b->Next;

-            op2b->Prev = op1b;

-            op1b->Next = op2b;

-            op2b_prev->Next = op1b_next;

-            op1b_next->Prev = op2b_prev;

-            return true;

-        }

-        return false;

-    }

-    //Strictly Simple join ...

-    op1b = j->OutPt1->Next;

-    while (op1b != op1 && (op1b->Pt == j->OffPt)) 

-      op1b = op1b->Next;

-    bool reverse1 = (op1b->Pt.y > j->OffPt.y);

-    op2b = j->OutPt2->Next;

-    while (op2b != op2 && (op2b->Pt == j->OffPt)) 

-      op2b = op2b->Next;

-    bool reverse2 = (op2b->Pt.y > j->OffPt.y);

-    if (reverse1 == reverse2) return false;

-    if (reverse1)

-    {

-      op1b = DupOutPt(op1, false);

-      op2b = DupOutPt(op2, true);

-      op1->Prev = op2;

-      op2->Next = op1;

-      op1b->Next = op2b;

-      op2b->Prev = op1b;

-      j->OutPt1 = op1;

-      j->OutPt2 = op1b;

-      return true;

-    } else

-    {

-      op1b = DupOutPt(op1, true);

-      op2b = DupOutPt(op2, false);

-      op1->Next = op2;

-      op2->Prev = op1;

-      op1b->Prev = op2b;

-      op2b->Next = op1b;

-      j->OutPt1 = op1;

-      j->OutPt2 = op1b;

-      return true;

-    }

-  } 

-  else if (isHorizontal)

-  {

-    //treat horizontal joins differently to non-horizontal joins since with

-    //them we're not yet sure where the overlapping is. OutPt1.Pt & OutPt2.Pt

-    //may be anywhere along the horizontal edge.

-    op1b = op1;

-    while (op1->Prev->Pt.y == op1->Pt.y && op1->Prev != op1b && op1->Prev != op2)

-      op1 = op1->Prev;

-    while (op1b->Next->Pt.y == op1b->Pt.y && op1b->Next != op1 && op1b->Next != op2)

-      op1b = op1b->Next;

-    if (op1b->Next == op1 || op1b->Next == op2) return false; //a flat 'polygon'

-

-    op2b = op2;

-    while (op2->Prev->Pt.y == op2->Pt.y && op2->Prev != op2b && op2->Prev != op1b)

-      op2 = op2->Prev;

-    while (op2b->Next->Pt.y == op2b->Pt.y && op2b->Next != op2 && op2b->Next != op1)

-      op2b = op2b->Next;

-    if (op2b->Next == op2 || op2b->Next == op1) return false; //a flat 'polygon'

-

-    cInt Left, Right;

-    //Op1 --> Op1b & Op2 --> Op2b are the extremites of the horizontal edges

-    if (!GetOverlap(op1->Pt.x, op1b->Pt.x, op2->Pt.x, op2b->Pt.x, Left, Right))

-      return false;

-

-    //DiscardLeftSide: when overlapping edges are joined, a spike will created

-    //which needs to be cleaned up. However, we don't want Op1 or Op2 caught up

-    //on the discard Side as either may still be needed for other joins ...

-    IntPoint Pt;

-    bool DiscardLeftSide;

-    if (op1->Pt.x >= Left && op1->Pt.x <= Right) 

-    {

-      Pt = op1->Pt; DiscardLeftSide = (op1->Pt.x > op1b->Pt.x);

-    } 

-    else if (op2->Pt.x >= Left&& op2->Pt.x <= Right) 

-    {

-      Pt = op2->Pt; DiscardLeftSide = (op2->Pt.x > op2b->Pt.x);

-    } 

-    else if (op1b->Pt.x >= Left && op1b->Pt.x <= Right)

-    {

-      Pt = op1b->Pt; DiscardLeftSide = op1b->Pt.x > op1->Pt.x;

-    } 

-    else

-    {

-      Pt = op2b->Pt; DiscardLeftSide = (op2b->Pt.x > op2->Pt.x);

-    }

-    j->OutPt1 = op1; j->OutPt2 = op2;

-    return JoinHorz(op1, op1b, op2, op2b, Pt, DiscardLeftSide);

-  } else

-  {

-    //nb: For non-horizontal joins ...

-    //    1. Jr.OutPt1.Pt.y == Jr.OutPt2.Pt.y

-    //    2. Jr.OutPt1.Pt > Jr.OffPt.y

-

-    //make sure the polygons are correctly oriented ...

-    op1b = op1->Next;

-    while ((op1b->Pt == op1->Pt) && (op1b != op1)) op1b = op1b->Next;

-    bool Reverse1 = ((op1b->Pt.y > op1->Pt.y) ||

-      !SlopesEqual(op1->Pt, op1b->Pt, j->OffPt, m_UseFullRange));

-    if (Reverse1)

-    {

-      op1b = op1->Prev;

-      while ((op1b->Pt == op1->Pt) && (op1b != op1)) op1b = op1b->Prev;

-      if ((op1b->Pt.y > op1->Pt.y) ||

-        !SlopesEqual(op1->Pt, op1b->Pt, j->OffPt, m_UseFullRange)) return false;

-    };

-    op2b = op2->Next;

-    while ((op2b->Pt == op2->Pt) && (op2b != op2))op2b = op2b->Next;

-    bool Reverse2 = ((op2b->Pt.y > op2->Pt.y) ||

-      !SlopesEqual(op2->Pt, op2b->Pt, j->OffPt, m_UseFullRange));

-    if (Reverse2)

-    {

-      op2b = op2->Prev;

-      while ((op2b->Pt == op2->Pt) && (op2b != op2)) op2b = op2b->Prev;

-      if ((op2b->Pt.y > op2->Pt.y) ||

-        !SlopesEqual(op2->Pt, op2b->Pt, j->OffPt, m_UseFullRange)) return false;

-    }

-

-    if ((op1b == op1) || (op2b == op2) || (op1b == op2b) ||

-      ((outRec1 == outRec2) && (Reverse1 == Reverse2))) return false;

-

-    if (Reverse1)

-    {

-      op1b = DupOutPt(op1, false);

-      op2b = DupOutPt(op2, true);

-      op1->Prev = op2;

-      op2->Next = op1;

-      op1b->Next = op2b;

-      op2b->Prev = op1b;

-      j->OutPt1 = op1;

-      j->OutPt2 = op1b;

-      return true;

-    } else

-    {

-      op1b = DupOutPt(op1, true);

-      op2b = DupOutPt(op2, false);

-      op1->Next = op2;

-      op2->Prev = op1;

-      op1b->Prev = op2b;

-      op2b->Next = op1b;

-      j->OutPt1 = op1;

-      j->OutPt2 = op1b;

-      return true;

-    }

-  }

-}

-//----------------------------------------------------------------------

-

-static OutRec* ParseFirstLeft(OutRec* FirstLeft)

-{

-  while (FirstLeft && !FirstLeft->Pts)

-    FirstLeft = FirstLeft->FirstLeft;

-  return FirstLeft;

-}

-//------------------------------------------------------------------------------

-

-void Clipper::FixupFirstLefts1(OutRec* OldOutRec, OutRec* NewOutRec)

-{ 

-  //tests if NewOutRec contains the polygon before reassigning FirstLeft

-  for (PolyOutList::size_type i = 0; i < m_PolyOuts.size(); ++i)

-  {

-    OutRec* outRec = m_PolyOuts[i];

-    OutRec* firstLeft = ParseFirstLeft(outRec->FirstLeft);

-    if (outRec->Pts  && firstLeft == OldOutRec)

-    {

-      if (Poly2ContainsPoly1(outRec->Pts, NewOutRec->Pts))

-      {

-        if (outRec->IsHole == NewOutRec->IsHole)

-        {

-          outRec->IsHole = !outRec->IsHole;

-          ReversePolyPtLinks(outRec->Pts);

-        }

-        outRec->FirstLeft = NewOutRec;

-      }

-    }

-  }

-}

-//----------------------------------------------------------------------

-

-void Clipper::FixupFirstLefts2(OutRec* InnerOutRec, OutRec* OuterOutRec)

-{

-  //A polygon has split into two such that one is now the inner of the other.

-  //It's possible that these polygons now wrap around other polygons, so check

-  //every polygon that's also contained by OuterOutRec's FirstLeft container

-  //(including 0) to see if they've become inner to the new inner polygon ...

-  for (PolyOutList::size_type i = 0; i < m_PolyOuts.size(); ++i)

-  {

-    OutRec* outRec = m_PolyOuts[i];

-

-    if (!outRec->Pts || outRec == OuterOutRec || outRec == InnerOutRec)

-      continue;

-    OutRec* firstLeft = ParseFirstLeft(outRec->FirstLeft);

-    if (firstLeft != InnerOutRec && firstLeft != OuterOutRec)

-      continue;

-    if (Poly2ContainsPoly1(outRec->Pts, InnerOutRec->Pts))

-    {

-        if (outRec->IsHole == InnerOutRec->IsHole)

-        {

-            outRec->IsHole = !outRec->IsHole;

-            ReversePolyPtLinks(outRec->Pts);

-        }

-        outRec->FirstLeft = InnerOutRec;

-    }

-    else

-    {

-        if (outRec->IsHole == OuterOutRec->IsHole)

-        {

-            if (Poly2ContainsPoly1(outRec->Pts, OuterOutRec->Pts))

-            {

-                outRec->FirstLeft = OuterOutRec;

-            }

-            else

-            {

-                outRec->FirstLeft = ParseFirstLeft(OuterOutRec->FirstLeft);

-            }

-        }

-        else

-        {

-            if (Area(outRec->Pts) == 0.0 && !Poly2ContainsPoly1(outRec->Pts, OuterOutRec->Pts))

-            {

-                outRec->IsHole = !outRec->IsHole;

-                outRec->FirstLeft = ParseFirstLeft(OuterOutRec->FirstLeft);

-                ReversePolyPtLinks(outRec->Pts);

-            }

-            else

-            {

-                outRec->FirstLeft = OuterOutRec;

-            }

-        }

-    }

-  }

-}

-//----------------------------------------------------------------------

-void Clipper::FixupFirstLefts3(OutRec* OldOutRec, OutRec* NewOutRec)

-{

-  //reassigns FirstLeft WITHOUT testing if NewOutRec contains the polygon

-  for (PolyOutList::size_type i = 0; i < m_PolyOuts.size(); ++i)

-  {

-    OutRec* outRec = m_PolyOuts[i];

-    // unused variable `firstLeft`: is this a bug? (dane)

-    //OutRec* firstLeft = ParseFirstLeft(outRec->FirstLeft);

-    if (outRec->Pts && outRec->FirstLeft == OldOutRec)

-      outRec->FirstLeft = NewOutRec;

-  }

-}

-//----------------------------------------------------------------------

-

-void Clipper::JoinCommonEdges()

-{

-  for (JoinList::size_type i = 0; i < m_Joins.size(); i++)

-  {

-    Join* join = m_Joins[i];

-

-    OutRec *outRec1 = GetOutRec(join->OutPt1->Idx);

-    OutRec *outRec2 = GetOutRec(join->OutPt2->Idx);

-

-    if (!outRec1->Pts || !outRec2->Pts) continue;

-    if (outRec1->IsOpen || outRec2->IsOpen) continue;

-

-    //get the polygon fragment with the correct hole state (FirstLeft)

-    //before calling JoinPoints() ...

-    OutRec *holeStateRec;

-    if (outRec1 == outRec2) holeStateRec = outRec1;

-    else if (OutRec1RightOfOutRec2(outRec1, outRec2)) holeStateRec = outRec2;

-    else if (OutRec1RightOfOutRec2(outRec2, outRec1)) holeStateRec = outRec1;

-    else holeStateRec = GetLowermostRec(outRec1, outRec2);

-

-    if (!JoinPoints(join, outRec1, outRec2)) continue;

-

-    if (outRec1 == outRec2)

-    {

-      //instead of joining two polygons, we've just created a new one by

-      //splitting one polygon into two.

-      outRec1->BottomPt = 0;

-      outRec2 = CreateOutRec();

-      if (PointCount(join->OutPt1) > PointCount(join->OutPt2))

-      {

-          outRec1->Pts = join->OutPt1;

-          outRec2->Pts = join->OutPt2;

-      }

-      else

-      {

-          outRec1->Pts = join->OutPt2;

-          outRec2->Pts = join->OutPt1;

-      }

-

-      //update all OutRec2.Pts Idx's ...

-      UpdateOutPtIdxs(*outRec2);

-

-      if (Poly2ContainsPoly1(outRec2->Pts, outRec1->Pts))

-      {

-        //outRec1 contains outRec2 ...

-        outRec2->IsHole = !outRec1->IsHole;

-        outRec2->FirstLeft = outRec1;

-

-        if (m_UsingPolyTree) FixupFirstLefts2(outRec2, outRec1);

-

-        if ((outRec2->IsHole ^ m_ReverseOutput) == (Area(*outRec2) > 0))

-          ReversePolyPtLinks(outRec2->Pts);

-            

-      } else if (Poly2ContainsPoly1(outRec1->Pts, outRec2->Pts))

-      {

-        //outRec2 contains outRec1 ...

-        outRec2->IsHole = outRec1->IsHole;

-        outRec1->IsHole = !outRec2->IsHole;

-        outRec2->FirstLeft = outRec1->FirstLeft;

-        outRec1->FirstLeft = outRec2;

-

-        if (m_UsingPolyTree) FixupFirstLefts2(outRec1, outRec2);

-

-        if ((outRec1->IsHole ^ m_ReverseOutput) == (Area(*outRec1) > 0))

-          ReversePolyPtLinks(outRec1->Pts);

-      } 

-      else

-      {

-        //the 2 polygons are completely separate ...

-        outRec2->IsHole = outRec1->IsHole;

-        outRec2->FirstLeft = outRec1->FirstLeft;

-

-        //fixup FirstLeft pointers that may need reassigning to OutRec2

-        if (m_UsingPolyTree) FixupFirstLefts1(outRec1, outRec2);

-      }

-     

-    } else

-    {

-      //joined 2 polygons together ...

-

-      outRec2->Pts = 0;

-      outRec2->BottomPt = 0;

-      outRec2->Idx = outRec1->Idx;

-

-      outRec1->IsHole = holeStateRec->IsHole;

-      if (holeStateRec == outRec2) 

-        outRec1->FirstLeft = outRec2->FirstLeft;

-      outRec2->FirstLeft = outRec1;

-

-      if (m_UsingPolyTree) FixupFirstLefts3(outRec2, outRec1);

-    }

-  }

-}

-

-//------------------------------------------------------------------------------

-// ClipperOffset support functions ...

-//------------------------------------------------------------------------------

-

-DoublePoint GetUnitNormal(const IntPoint &pt1, const IntPoint &pt2)

-{

-  if(pt2.x == pt1.x && pt2.y == pt1.y) 

-    return DoublePoint(0, 0);

-

-  double Dx = (double)(pt2.x - pt1.x);

-  double dy = (double)(pt2.y - pt1.y);

-  double f = 1 *1.0/ std::sqrt( Dx*Dx + dy*dy );

-  Dx *= f;

-  dy *= f;

-  return DoublePoint(dy, -Dx);

-}

-

-//------------------------------------------------------------------------------

-// ClipperOffset class

-//------------------------------------------------------------------------------

-

-ClipperOffset::ClipperOffset(double miterLimit, double arcTolerance)

-{

-  this->MiterLimit = miterLimit;

-  this->ArcTolerance = arcTolerance;

-  m_lowest.x = -1;

-}

-//------------------------------------------------------------------------------

-

-ClipperOffset::~ClipperOffset()

-{

-  Clear();

-}

-//------------------------------------------------------------------------------

-

-void ClipperOffset::Clear()

-{

-  for (int i = 0; i < m_polyNodes.ChildCount(); ++i)

-    delete m_polyNodes.Childs[i];

-  m_polyNodes.Childs.clear();

-  m_lowest.x = -1;

-}

-//------------------------------------------------------------------------------

-

-void ClipperOffset::AddPath(const Path& path, JoinType joinType, EndType endType)

-{

-  int highI = (int)path.size() - 1;

-  if (highI < 0) return;

-  PolyNode* newNode = new PolyNode();

-  newNode->m_jointype = joinType;

-  newNode->m_endtype = endType;

-

-  //strip duplicate points from path and also get index to the lowest point ...

-  if (endType == etClosedLine || endType == etClosedPolygon)

-    while (highI > 0 && path[0] == path[highI]) highI--;

-  newNode->Contour.reserve(highI + 1);

-  newNode->Contour.push_back(path[0]);

-  int j = 0, k = 0;

-  for (int i = 1; i <= highI; i++)

-    if (newNode->Contour[j] != path[i])

-    {

-      j++;

-      newNode->Contour.push_back(path[i]);

-      if (path[i].y > newNode->Contour[k].y ||

-        (path[i].y == newNode->Contour[k].y &&

-        path[i].x < newNode->Contour[k].x)) k = j;

-    }

-  if (endType == etClosedPolygon && j < 2)

-  {

-    delete newNode;

-    return;

-  }

-  m_polyNodes.AddChild(*newNode);

-

-  //if this path's lowest pt is lower than all the others then update m_lowest

-  if (endType != etClosedPolygon) return;

-  if (m_lowest.x < 0)

-    m_lowest = IntPoint(m_polyNodes.ChildCount() - 1, k);

-  else

-  {

-    IntPoint ip = m_polyNodes.Childs[(int)m_lowest.x]->Contour[(int)m_lowest.y];

-    if (newNode->Contour[k].y > ip.y ||

-      (newNode->Contour[k].y == ip.y &&

-      newNode->Contour[k].x < ip.x))

-      m_lowest = IntPoint(m_polyNodes.ChildCount() - 1, k);

-  }

-}

-//------------------------------------------------------------------------------

-

-void ClipperOffset::AddPaths(const Paths& paths, JoinType joinType, EndType endType)

-{

-  for (Paths::size_type i = 0; i < paths.size(); ++i)

-    AddPath(paths[i], joinType, endType);

-}

-//------------------------------------------------------------------------------

-

-void ClipperOffset::FixOrientations()

-{

-  //fixup orientations of all closed paths if the orientation of the

-  //closed path with the lowermost vertex is wrong ...

-  if (m_lowest.x >= 0 && 

-    !Orientation(m_polyNodes.Childs[(int)m_lowest.x]->Contour))

-  {

-    for (int i = 0; i < m_polyNodes.ChildCount(); ++i)

-    {

-      PolyNode& node = *m_polyNodes.Childs[i];

-      if (node.m_endtype == etClosedPolygon ||

-        (node.m_endtype == etClosedLine && Orientation(node.Contour)))

-          ReversePath(node.Contour);

-    }

-  } else

-  {

-    for (int i = 0; i < m_polyNodes.ChildCount(); ++i)

-    {

-      PolyNode& node = *m_polyNodes.Childs[i];

-      if (node.m_endtype == etClosedLine && !Orientation(node.Contour))

-        ReversePath(node.Contour);

-    }

-  }

-}

-//------------------------------------------------------------------------------

-

-void ClipperOffset::Execute(Paths& solution, double delta)

-{

-  solution.clear();

-  FixOrientations();

-  DoOffset(delta);

-  

-  //now clean up 'corners' ...

-  Clipper clpr;

-  clpr.AddPaths(m_destPolys, ptSubject, true);

-  if (delta > 0)

-  {

-    clpr.Execute(ctUnion, solution, pftPositive, pftPositive);

-  }

-  else

-  {

-    IntRect r = clpr.GetBounds();

-    Path outer(4);

-    outer[0] = IntPoint(r.left - 10, r.bottom + 10);

-    outer[1] = IntPoint(r.right + 10, r.bottom + 10);

-    outer[2] = IntPoint(r.right + 10, r.top - 10);

-    outer[3] = IntPoint(r.left - 10, r.top - 10);

-

-    clpr.AddPath(outer, ptSubject, true);

-    clpr.ReverseSolution(true);

-    clpr.Execute(ctUnion, solution, pftNegative, pftNegative);

-    if (!solution.empty()) solution.erase(solution.begin());

-  }

-}

-//------------------------------------------------------------------------------

-

-void ClipperOffset::Execute(PolyTree& solution, double delta)

-{

-  solution.Clear();

-  FixOrientations();

-  DoOffset(delta);

-

-  //now clean up 'corners' ...

-  Clipper clpr;

-  clpr.AddPaths(m_destPolys, ptSubject, true);

-  if (delta > 0)

-  {

-    clpr.Execute(ctUnion, solution, pftPositive, pftPositive);

-  }

-  else

-  {

-    IntRect r = clpr.GetBounds();

-    Path outer(4);

-    outer[0] = IntPoint(r.left - 10, r.bottom + 10);

-    outer[1] = IntPoint(r.right + 10, r.bottom + 10);

-    outer[2] = IntPoint(r.right + 10, r.top - 10);

-    outer[3] = IntPoint(r.left - 10, r.top - 10);

-

-    clpr.AddPath(outer, ptSubject, true);

-    clpr.ReverseSolution(true);

-    clpr.Execute(ctUnion, solution, pftNegative, pftNegative);

-    //remove the outer PolyNode rectangle ...

-    if (solution.ChildCount() == 1 && solution.Childs[0]->ChildCount() > 0)

-    {

-      PolyNode* outerNode = solution.Childs[0];

-      solution.Childs.reserve(outerNode->ChildCount());

-      solution.Childs[0] = outerNode->Childs[0];

-      solution.Childs[0]->Parent = outerNode->Parent;

-      for (int i = 1; i < outerNode->ChildCount(); ++i)

-        solution.AddChild(*outerNode->Childs[i]);

-    }

-    else

-      solution.Clear();

-  }

-}

-//------------------------------------------------------------------------------

-

-void ClipperOffset::DoOffset(double delta)

-{

-  m_destPolys.clear();

-  m_delta = delta;

-

-  //if Zero offset, just copy any CLOSED polygons to m_p and return ...

-  if (NEAR_ZERO(delta)) 

-  {

-    m_destPolys.reserve(m_polyNodes.ChildCount());

-    for (int i = 0; i < m_polyNodes.ChildCount(); i++)

-    {

-      PolyNode& node = *m_polyNodes.Childs[i];

-      if (node.m_endtype == etClosedPolygon)

-        m_destPolys.push_back(node.Contour);

-    }

-    return;

-  }

-

-  //see offset_triginometry3.svg in the documentation folder ...

-  if (MiterLimit > 2) m_miterLim = 2/(MiterLimit * MiterLimit);

-  else m_miterLim = 0.5;

-

-  double y;

-  if (ArcTolerance <= 0.0) y = def_arc_tolerance;

-  else if (ArcTolerance > std::fabs(delta) * def_arc_tolerance) 

-    y = std::fabs(delta) * def_arc_tolerance;

-  else y = ArcTolerance;

-  //see offset_triginometry2.svg in the documentation folder ...

-  double steps = pi / std::acos(1 - y / std::fabs(delta));

-  if (steps > std::fabs(delta) * pi) 

-    steps = std::fabs(delta) * pi;  //ie excessive precision check

-  m_sin = std::sin(two_pi / steps);

-  m_cos = std::cos(two_pi / steps);

-  m_StepsPerRad = steps / two_pi;

-  if (delta < 0.0) m_sin = -m_sin;

-

-  m_destPolys.reserve(m_polyNodes.ChildCount() * 2);

-  for (int i = 0; i < m_polyNodes.ChildCount(); i++)

-  {

-    PolyNode& node = *m_polyNodes.Childs[i];

-    m_srcPoly = node.Contour;

-

-    int len = (int)m_srcPoly.size();

-    if (len == 0 || (delta <= 0 && (len < 3 || node.m_endtype != etClosedPolygon)))

-        continue;

-

-    m_destPoly.clear();

-    if (len == 1)

-    {

-      if (node.m_jointype == jtRound)

-      {

-        double X = 1.0, Y = 0.0;

-        for (cInt j = 1; j <= steps; j++)

-        {

-          m_destPoly.push_back(IntPoint(

-            Round(m_srcPoly[0].x + X * delta),

-            Round(m_srcPoly[0].y + Y * delta)));

-          double X2 = X;

-          X = X * m_cos - m_sin * Y;

-          Y = X2 * m_sin + Y * m_cos;

-        }

-      }

-      else

-      {

-        double X = -1.0, Y = -1.0;

-        for (int j = 0; j < 4; ++j)

-        {

-          m_destPoly.push_back(IntPoint(

-            Round(m_srcPoly[0].x + X * delta),

-            Round(m_srcPoly[0].y + Y * delta)));

-          if (X < 0) X = 1;

-          else if (Y < 0) Y = 1;

-          else X = -1;

-        }

-      }

-      m_destPolys.push_back(m_destPoly);

-      continue;

-    }

-    //build m_normals ...

-    m_normals.clear();

-    m_normals.reserve(len);

-    for (int j = 0; j < len - 1; ++j)

-      m_normals.push_back(GetUnitNormal(m_srcPoly[j], m_srcPoly[j + 1]));

-    if (node.m_endtype == etClosedLine || node.m_endtype == etClosedPolygon)

-      m_normals.push_back(GetUnitNormal(m_srcPoly[len - 1], m_srcPoly[0]));

-    else

-      m_normals.push_back(DoublePoint(m_normals[len - 2]));

-

-    if (node.m_endtype == etClosedPolygon)

-    {

-      int k = len - 1;

-      for (int j = 0; j < len; ++j)

-        OffsetPoint(j, k, node.m_jointype);

-      m_destPolys.push_back(m_destPoly);

-    }

-    else if (node.m_endtype == etClosedLine)

-    {

-      int k = len - 1;

-      for (int j = 0; j < len; ++j)

-        OffsetPoint(j, k, node.m_jointype);

-      m_destPolys.push_back(m_destPoly);

-      m_destPoly.clear();

-      //re-build m_normals ...

-      DoublePoint n = m_normals[len -1];

-      for (int j = len - 1; j > 0; j--)

-        m_normals[j] = DoublePoint(-m_normals[j - 1].x, -m_normals[j - 1].y);

-      m_normals[0] = DoublePoint(-n.x, -n.y);

-      k = 0;

-      for (int j = len - 1; j >= 0; j--)

-        OffsetPoint(j, k, node.m_jointype);

-      m_destPolys.push_back(m_destPoly);

-    }

-    else

-    {

-      int k = 0;

-      for (int j = 1; j < len - 1; ++j)

-        OffsetPoint(j, k, node.m_jointype);

-

-      IntPoint pt1;

-      if (node.m_endtype == etOpenButt)

-      {

-        int j = len - 1;

-        pt1 = IntPoint((cInt)Round(m_srcPoly[j].x + m_normals[j].x *

-          delta), (cInt)Round(m_srcPoly[j].y + m_normals[j].y * delta));

-        m_destPoly.push_back(pt1);

-        pt1 = IntPoint((cInt)Round(m_srcPoly[j].x - m_normals[j].x *

-          delta), (cInt)Round(m_srcPoly[j].y - m_normals[j].y * delta));

-        m_destPoly.push_back(pt1);

-      }

-      else

-      {

-        int j = len - 1;

-        k = len - 2;

-        m_sinA = 0;

-        m_normals[j] = DoublePoint(-m_normals[j].x, -m_normals[j].y);

-        if (node.m_endtype == etOpenSquare)

-          DoSquare(j, k);

-        else

-          DoRound(j, k);

-      }

-

-      //re-build m_normals ...

-      for (int j = len - 1; j > 0; j--)

-        m_normals[j] = DoublePoint(-m_normals[j - 1].x, -m_normals[j - 1].y);

-      m_normals[0] = DoublePoint(-m_normals[1].x, -m_normals[1].y);

-

-      k = len - 1;

-      for (int j = k - 1; j > 0; --j) OffsetPoint(j, k, node.m_jointype);

-

-      if (node.m_endtype == etOpenButt)

-      {

-        pt1 = IntPoint((cInt)Round(m_srcPoly[0].x - m_normals[0].x * delta),

-          (cInt)Round(m_srcPoly[0].y - m_normals[0].y * delta));

-        m_destPoly.push_back(pt1);

-        pt1 = IntPoint((cInt)Round(m_srcPoly[0].x + m_normals[0].x * delta),

-          (cInt)Round(m_srcPoly[0].y + m_normals[0].y * delta));

-        m_destPoly.push_back(pt1);

-      }

-      else

-      {

-        k = 1;

-        m_sinA = 0;

-        if (node.m_endtype == etOpenSquare)

-          DoSquare(0, 1);

-        else

-          DoRound(0, 1);

-      }

-      m_destPolys.push_back(m_destPoly);

-    }

-  }

-}

-//------------------------------------------------------------------------------

-

-void ClipperOffset::OffsetPoint(int j, int& k, JoinType jointype)

-{

-  //cross product ...

-  m_sinA = (m_normals[k].x * m_normals[j].y - m_normals[j].x * m_normals[k].y);

-  if (std::fabs(m_sinA * m_delta) < 1.0) 

-  {

-    //dot product ...

-    double cosA = (m_normals[k].x * m_normals[j].x + m_normals[j].y * m_normals[k].y ); 

-    if (cosA > 0) // angle => 0 degrees

-    {

-      m_destPoly.push_back(IntPoint(Round(m_srcPoly[j].x + m_normals[k].x * m_delta),

-        Round(m_srcPoly[j].y + m_normals[k].y * m_delta)));

-      return; 

-    }

-    //else angle => 180 degrees   

-  }

-  else if (m_sinA > 1.0) m_sinA = 1.0;

-  else if (m_sinA < -1.0) m_sinA = -1.0;

-

-  if (m_sinA * m_delta < 0)

-  {

-    m_destPoly.push_back(IntPoint(Round(m_srcPoly[j].x + m_normals[k].x * m_delta),

-      Round(m_srcPoly[j].y + m_normals[k].y * m_delta)));

-    m_destPoly.push_back(m_srcPoly[j]);

-    m_destPoly.push_back(IntPoint(Round(m_srcPoly[j].x + m_normals[j].x * m_delta),

-      Round(m_srcPoly[j].y + m_normals[j].y * m_delta)));

-  }

-  else

-    switch (jointype)

-    {

-      case jtMiter:

-        {

-          double r = 1 + (m_normals[j].x * m_normals[k].x +

-            m_normals[j].y * m_normals[k].y);

-          if (r >= m_miterLim) DoMiter(j, k, r); else DoSquare(j, k);

-          break;

-        }

-      case jtSquare: DoSquare(j, k); break;

-      case jtRound: DoRound(j, k); break;

-    }

-  k = j;

-}

-//------------------------------------------------------------------------------

-

-void ClipperOffset::DoSquare(int j, int k)

-{

-  double dx = std::tan(std::atan2(m_sinA,

-      m_normals[k].x * m_normals[j].x + m_normals[k].y * m_normals[j].y) / 4);

-  m_destPoly.push_back(IntPoint(

-      Round(m_srcPoly[j].x + m_delta * (m_normals[k].x - m_normals[k].y * dx)),

-      Round(m_srcPoly[j].y + m_delta * (m_normals[k].y + m_normals[k].x * dx))));

-  m_destPoly.push_back(IntPoint(

-      Round(m_srcPoly[j].x + m_delta * (m_normals[j].x + m_normals[j].y * dx)),

-      Round(m_srcPoly[j].y + m_delta * (m_normals[j].y - m_normals[j].x * dx))));

-}

-//------------------------------------------------------------------------------

-

-void ClipperOffset::DoMiter(int j, int k, double r)

-{

-  double q = m_delta / r;

-  m_destPoly.push_back(IntPoint(Round(m_srcPoly[j].x + (m_normals[k].x + m_normals[j].x) * q),

-      Round(m_srcPoly[j].y + (m_normals[k].y + m_normals[j].y) * q)));

-}

-//------------------------------------------------------------------------------

-

-void ClipperOffset::DoRound(int j, int k)

-{

-  double a = std::atan2(m_sinA,

-  m_normals[k].x * m_normals[j].x + m_normals[k].y * m_normals[j].y);

-  int steps = std::max((int)Round(m_StepsPerRad * std::fabs(a)), 1);

-

-  double X = m_normals[k].x, Y = m_normals[k].y, X2;

-  for (int i = 0; i < steps; ++i)

-  {

-    m_destPoly.push_back(IntPoint(

-        Round(m_srcPoly[j].x + X * m_delta),

-        Round(m_srcPoly[j].y + Y * m_delta)));

-    X2 = X;

-    X = X * m_cos - m_sin * Y;

-    Y = X2 * m_sin + Y * m_cos;

-  }

-  m_destPoly.push_back(IntPoint(

-  Round(m_srcPoly[j].x + m_normals[j].x * m_delta),

-  Round(m_srcPoly[j].y + m_normals[j].y * m_delta)));

-}

-

-//------------------------------------------------------------------------------

-// Miscellaneous public functions

-//------------------------------------------------------------------------------

-

-bool SortOutPt(OutPt* op1, OutPt* op2)

-{ 

-    if (op1->Pt.y > op2->Pt.y)

-    {

-        return true;

-    }

-    else if (op1->Pt.y < op2->Pt.y)

-    {

-        return false;

-    }

-    else if (op1->Pt.x < op2->Pt.x)

-    {

-        return true;

-    }

-    else if (op1->Pt.x > op2->Pt.x)

-    {

-        return false;

-    }

-    else

-    {

-        return (op1->Idx < op2->Idx);

-    }

-}

-

-//-----------------------------------------------------------------------------

-

-struct OutPtIntersect

-{

-    OutPt * op1;

-    OutPt * op2;

-};

-

-//-----------------------------------------------------------------------------

-

-bool Clipper::FindIntersectLoop(std::unordered_multimap<int, OutPtIntersect> & dupeRec,

-                                std::list<std::pair<int, OutPtIntersect> > & iList,

-                                OutRec * outRec_parent,

-                                int idx_origin,

-                                int idx_search,

-                                std::set<int> & visited,

-                                OutPt * orig_pt,

-                                OutPt * prev_pt)

-{

-    auto range = dupeRec.equal_range(idx_search);

-    // Check for direct connection

-    for (auto it = range.first; it != range.second;)

-    {

-        OutRec * itRec1 = GetOutRec(it->second.op1->Idx);

-        OutRec * itRec2 = GetOutRec(it->second.op2->Idx);

-        if (itRec1->Idx != idx_search || (!itRec1->IsHole && !itRec2->IsHole))

-        {

-            it = dupeRec.erase(it);

-            continue;

-        }

-        if (itRec2->Idx == idx_origin && 

-            (outRec_parent == itRec2 || outRec_parent == ParseFirstLeft(itRec2->FirstLeft)) &&

-            prev_pt->Pt != it->second.op2->Pt &&

-            orig_pt->Pt != it->second.op2->Pt)

-        {

-            iList.emplace_front(idx_search, it->second);

-            return true;

-        }

-        ++it;

-    }

-    range = dupeRec.equal_range(idx_search);

-    visited.insert(idx_search);

-    // Check for connection through chain of other intersections

-    for (auto it = range.first; it != range.second && it != dupeRec.end() && it->first == idx_search; ++it)

-    {

-        OutRec * itRec = GetOutRec(it->second.op2->Idx);

-        if (visited.count(itRec->Idx) > 0 || 

-            (outRec_parent != itRec && outRec_parent != ParseFirstLeft(itRec->FirstLeft))

-            || prev_pt->Pt == it->second.op2->Pt)

-        {

-            continue;

-        }

-        if (FindIntersectLoop(dupeRec, iList, outRec_parent, idx_origin, itRec->Idx, visited, orig_pt, it->second.op2))

-        {

-            iList.emplace_front(idx_search, it->second);

-            return true;

-        }

-    }

-    return false;

-}

-

-//-----------------------------------------------------------------------------

-

-bool Clipper::FixIntersects(std::unordered_multimap<int, OutPtIntersect> & dupeRec,

-                            OutPt * op_j,

-                            OutPt * op_k,

-                            OutRec * outRec_j,

-                            OutRec * outRec_k)

-{

-    if (!outRec_j->IsHole && !outRec_k->IsHole) 

-    {

-        // Both are not holes, return nothing to do.

-        return false;

-    }

-    OutRec * outRec_origin;

-    OutRec * outRec_search;

-    OutRec * outRec_parent;

-    OutPt * op_origin_1;

-    OutPt * op_origin_2;

-    if (!outRec_j->IsHole)

-    {

-        outRec_origin = outRec_j;

-        outRec_parent = outRec_origin;

-        outRec_search = outRec_k;

-        op_origin_1 = op_j;

-        op_origin_2 = op_k;

-    }

-    else if (!outRec_k->IsHole)

-    {

-        outRec_origin = outRec_k;

-        outRec_parent = outRec_origin;

-        outRec_search = outRec_j;

-        op_origin_1 = op_k;

-        op_origin_2 = op_j;

-

-    }

-    else // both are holes

-    {

-        // Order doesn't matter

-        outRec_origin = outRec_j;

-        outRec_parent = ParseFirstLeft(outRec_origin->FirstLeft);

-        outRec_search = outRec_k;

-        op_origin_1 = op_j;

-        op_origin_2 = op_k;

-    }

-    if (outRec_parent != ParseFirstLeft(outRec_search->FirstLeft))

-    {

-        // The two holes do not have the same parent, do not add them

-        // simply return!

-        return false;

-    }

-    bool found = false;

-    std::list<std::pair<int, OutPtIntersect> > iList;

-    auto range = dupeRec.equal_range(outRec_search->Idx);

-    // Check for direct connection

-    for (auto it = range.first; it != range.second;)

-    {

-        OutRec * itRec1 = GetOutRec(it->second.op1->Idx);

-        OutRec * itRec2 = GetOutRec(it->second.op2->Idx);

-        if (outRec_search->Idx != itRec1->Idx || outRec_search->Idx == itRec2->Idx)

-        {

-            it = dupeRec.erase(it);

-            continue;

-        }

-        if (itRec2->Idx == outRec_origin->Idx)

-        {

-            found = true;

-            if (op_origin_1->Pt != it->second.op2->Pt)

-            {

-                iList.emplace_back(outRec_search->Idx, it->second);

-                break;

-            }

-        }

-        ++it;

-    }

-    if (!found)

-    {

-        range = dupeRec.equal_range(outRec_search->Idx);

-        std::set<int> visited;

-        visited.insert(outRec_search->Idx);

-        // Check for connection through chain of other intersections

-        for (auto it = range.first; it != range.second && it != dupeRec.end() && it->first == outRec_search->Idx; ++it)

-        {

-            OutRec * itRec = GetOutRec(it->second.op2->Idx);

-            if (itRec->Idx != outRec_search->Idx &&

-                op_origin_2->Pt != it->second.op2->Pt && 

-                (outRec_parent == itRec || outRec_parent == ParseFirstLeft(itRec->FirstLeft)) &&

-                FindIntersectLoop(dupeRec, iList, outRec_parent, outRec_origin->Idx, itRec->Idx, visited, op_origin_2, it->second.op2))

-            {

-                found = true;

-                iList.emplace_front(outRec_search->Idx, it->second);

-                break;

-            }

-        }

-    }

-    if (!found)

-    {

-        OutPtIntersect intPt_origin = { op_origin_1, op_origin_2 };

-        OutPtIntersect intPt_search = { op_origin_2, op_origin_1 };

-        dupeRec.emplace(outRec_origin->Idx, intPt_origin);

-        dupeRec.emplace(outRec_search->Idx, intPt_search);

-        return false;

-    }

-    

-    if (iList.empty())

-    {

-        return false;

-    }

-    if (outRec_origin->IsHole)

-    {

-        for (auto & iRing : iList)

-        {

-            OutRec * outRec_itr = GetOutRec(iRing.first);

-            if (!outRec_itr->IsHole)

-            {

-                // Make the hole the origin!

-                OutPt * op1 = op_origin_1;

-                op_origin_1 = iRing.second.op1;

-                iRing.second.op1 = op1;

-                OutPt * op2 = op_origin_2;

-                op_origin_2 = iRing.second.op2;

-                iRing.second.op2 = op2;

-                iRing.first = outRec_origin->Idx;

-                outRec_origin = outRec_itr;

-                outRec_parent = outRec_origin;

-                break;

-            }

-        }

-    }

-

-    // Switch 

-    OutPt * op_origin_1_next = op_origin_1->Next;

-    OutPt * op_origin_2_next = op_origin_2->Next;

-    op_origin_1->Next = op_origin_2_next;

-    op_origin_2->Next = op_origin_1_next;

-    op_origin_1_next->Prev = op_origin_2;

-    op_origin_2_next->Prev = op_origin_1;

-    

-    for (auto iRing : iList)

-    {

-        OutPt * op_search_1 = iRing.second.op1;

-        OutPt * op_search_2 = iRing.second.op2;

-        OutPt * op_search_1_next = op_search_1->Next;

-        OutPt * op_search_2_next = op_search_2->Next;

-        op_search_1->Next = op_search_2_next;

-        op_search_2->Next = op_search_1_next;

-        op_search_1_next->Prev = op_search_2;

-        op_search_2_next->Prev = op_search_1;

-    }

-

-    OutRec * outRec_new = CreateOutRec();

-    outRec_new->IsHole = false;

-    if (outRec_origin->IsHole && ((Area(op_origin_1) < 0) ^ m_ReverseOutput))

-    {

-        outRec_origin->Pts = op_origin_1;

-        outRec_new->Pts = op_origin_2;

-    }

-    else

-    {

-        outRec_origin->Pts = op_origin_2;

-        outRec_new->Pts = op_origin_1;

-    }

-

-    UpdateOutPtIdxs(*outRec_origin);

-    UpdateOutPtIdxs(*outRec_new);

-    

-    outRec_origin->BottomPt = 0;

-

-    std::list<std::pair<int, OutPtIntersect> > move_list;

-    for (auto iRing : iList)

-    {

-        OutRec * outRec_itr = GetOutRec(iRing.first);

-        outRec_itr->Pts = 0;

-        outRec_itr->BottomPt = 0;

-        outRec_itr->Idx = outRec_origin->Idx;

-        if (outRec_origin->IsHole)

-        {

-            outRec_itr->FirstLeft = ParseFirstLeft(outRec_origin->FirstLeft);

-        }

-        else

-        {

-            outRec_itr->FirstLeft = outRec_origin;

-        }

-        outRec_itr->IsHole = outRec_origin->IsHole;

-        if (m_UsingPolyTree) 

-        {

-            FixupFirstLefts3(outRec_itr, outRec_origin);

-        }

-    }

-    if (outRec_origin->IsHole)

-    {

-        outRec_new->FirstLeft = outRec_origin;

-    }

-    else

-    {

-        outRec_new->FirstLeft = outRec_origin->FirstLeft;

-    }

-    if (m_UsingPolyTree)

-    {

-        if (outRec_origin->IsHole)

-        {

-            FixupFirstLefts2(outRec_new, outRec_origin);

-        }

-        else

-        {

-            FixupFirstLefts1(outRec_origin, outRec_new);

-        }

-    }

-    for (auto iRing : iList)

-    {

-        auto range_itr = dupeRec.equal_range(iRing.first);

-        if (range_itr.first != range_itr.second)

-        {

-            for (auto it = range_itr.first; it != range_itr.second; ++it)

-            {

-                OutRec * itRec = GetOutRec(it->second.op1->Idx);

-                OutRec * itRec2 = GetOutRec(it->second.op2->Idx);

-                if (itRec == itRec2) 

-                {

-                    continue;

-                }

-                OutRec * flRec;

-                OutRec * flRec2;

-                if (itRec->IsHole)

-                {

-                    flRec = ParseFirstLeft(itRec->FirstLeft);

-                }

-                else

-                {

-                    flRec = itRec;

-                }

-                if (itRec2->IsHole)

-                {

-                    flRec2 = ParseFirstLeft(itRec2->FirstLeft);

-                }

-                else

-                {

-                    flRec2 = itRec2;

-                }

-                if ((itRec->IsHole || itRec2->IsHole) && (flRec == flRec2))

-                {

-                    move_list.emplace_back(itRec->Idx, it->second);

-                }

-            }

-            dupeRec.erase(iRing.first);

-        }

-    }

-    auto range_itr = dupeRec.equal_range(outRec_origin->Idx);

-    for (auto it = range_itr.first; it != range_itr.second;)

-    {

-        OutRec * itRec = GetOutRec(it->second.op1->Idx);

-        OutRec * itRec2 = GetOutRec(it->second.op2->Idx);

-        if (itRec == itRec2)

-        {

-            it = dupeRec.erase(it);

-            continue;

-        }

-        OutRec * flRec;

-        OutRec * flRec2;

-        if (itRec->IsHole)

-        {

-            flRec = ParseFirstLeft(itRec->FirstLeft);

-        }

-        else

-        {

-            flRec = itRec;

-        }

-        if (itRec2->IsHole)

-        {

-            flRec2 = ParseFirstLeft(itRec2->FirstLeft);

-        }

-        else

-        {

-            flRec2 = itRec2;

-        }

-        if (itRec->Idx != outRec_origin->Idx)

-        {

-            if ((itRec->IsHole || itRec2->IsHole) && (flRec == flRec2))

-            {

-                move_list.emplace_back(itRec->Idx, it->second);

-            }

-            it = dupeRec.erase(it);

-        }

-        else

-        {

-            if ((itRec->IsHole || itRec2->IsHole) && (flRec == flRec2))

-            {

-                ++it;

-            }

-            else

-            {

-                it = dupeRec.erase(it);

-            }

-        }

-    }

-

-    if (!move_list.empty())

-    {

-        dupeRec.insert(move_list.begin(), move_list.end());

-    }

-    return true;

-}

-

-//-----------------------------------------------------------------------------

-

-void Clipper::DoSimplePolygons()

-{

-    std::vector < OutPt*> m_OutPts;

-    {

-        PolyOutList::size_type i = 0;

-        while (i < m_PolyOuts.size()) 

-        {

-            OutRec* outrec = m_PolyOuts[i++];

-            OutPt* op = outrec->Pts;

-            if (!op || outrec->IsOpen) continue;

-            do

-            {

-                m_OutPts.push_back(op);

-                op = op->Next;

-            }

-            while (op != outrec->Pts);

-        }

-    }

-    std::stable_sort(m_OutPts.begin(), m_OutPts.end(), SortOutPt);

-    std::unordered_multimap<int, OutPtIntersect> dupeRec;

-    dupeRec.reserve(m_PolyOuts.size());

-    std::size_t count = 0;

-    for (std::size_t i = 1; i < m_OutPts.size(); ++i)

-    {

-        if (m_OutPts[i]->Pt == m_OutPts[i-1]->Pt) 

-        {

-            ++count;

-            continue;

-        }

-        if (count > 0)

-        {

-            for (std::size_t j = (i - count - 1); j < i; ++j)

-            {

-                if (m_OutPts[j]->Idx < 0) continue;

-                OutRec * outRec_j = GetOutRec(m_OutPts[j]->Idx);

-                int idx_j = outRec_j->Idx;

-                for (std::size_t k = j + 1; k < i; ++k)

-                {

-                    if (m_OutPts[k]->Idx < 0) continue;

-                    OutRec * outRec_k = GetOutRec(m_OutPts[k]->Idx);

-                    int idx_k = outRec_k->Idx;

-                    if (idx_k == idx_j)

-                    {

-                        OutPt * op = m_OutPts[j];

-                        OutPt * op2 = m_OutPts[k];

-                        OutRec * outrec = outRec_j;

-                        if (op != op2 && op2->Next != op && op2->Prev != op) 

-                        {

-                            //split the polygon into two ...

-                            OutPt* op3 = op->Prev;

-                            OutPt* op4 = op2->Prev;

-                            op->Prev = op4;

-                            op4->Next = op;

-                            op2->Prev = op3;

-                            op3->Next = op2;

-

-                            OutRec* outrec2 = CreateOutRec();

-                            if (PointCount(op) > PointCount(op2))

-                            {

-                                outrec->Pts = op;

-                                outrec2->Pts = op2;

-                            }

-                            else

-                            {

-                                outrec->Pts = op2;

-                                outrec2->Pts = op;

-                            }

-                            UpdateOutPtIdxs(*outrec);

-                            UpdateOutPtIdxs(*outrec2);

-                            if (Poly2ContainsPoly1(outrec2->Pts, outrec->Pts))

-                            {

-                                //OutRec2 is contained by OutRec1 ...

-                                outrec2->IsHole = !outrec->IsHole;

-                                outrec2->FirstLeft = outrec;

-                                if (m_UsingPolyTree) 

-                                {

-                                    FixupFirstLefts2(outrec2, outrec);

-                                }

-                                auto range = dupeRec.equal_range(idx_j);

-                                std::list<std::pair<int, OutPtIntersect> > move_list;

-                                for (auto it = range.first; it != range.second;)

-                                {

-                                    OutRec * itRec = GetOutRec(it->second.op1->Idx);

-                                    OutRec * itRec2 = GetOutRec(it->second.op2->Idx);

-                                    OutRec * flRec;

-                                    OutRec * flRec2;

-                                    if (itRec->IsHole)

-                                    {

-                                        flRec = ParseFirstLeft(itRec->FirstLeft);

-                                    }

-                                    else

-                                    {

-                                        flRec = itRec;

-                                    }

-                                    if (itRec2->IsHole)

-                                    {

-                                        flRec2 = ParseFirstLeft(itRec2->FirstLeft);

-                                    }

-                                    else

-                                    {

-                                        flRec2 = itRec2;

-                                    }

-                                    if (itRec->Idx != idx_j)

-                                    {

-                                        if ((itRec->IsHole || itRec2->IsHole) && (flRec == flRec2))

-                                        {

-                                            move_list.emplace_back(itRec->Idx, it->second);

-                                        }

-                                        it = dupeRec.erase(it);

-                                    }

-                                    else

-                                    {

-                                        if ((itRec->IsHole || itRec2->IsHole) && (flRec == flRec2))

-                                        {

-                                            ++it;

-                                        }

-                                        else

-                                        {

-                                            it = dupeRec.erase(it);

-                                        }

-                                    }

-                                }

-                                if (!move_list.empty())

-                                {

-                                    dupeRec.insert(move_list.begin(), move_list.end());

-                                }

-                                if (!outrec->IsHole)

-                                {

-                                    OutPtIntersect intPt1 = { outrec->Pts, outrec2->Pts };

-                                    OutPtIntersect intPt2 = { outrec2->Pts, outrec->Pts };

-                                    dupeRec.emplace(outrec->Idx, intPt1);

-                                    dupeRec.emplace(outrec2->Idx, intPt2);

-                                }

-                            }

-                            else if (Poly2ContainsPoly1(outrec->Pts, outrec2->Pts))

-                            {

-                                //OutRec1 is contained by OutRec2 ...

-                                outrec2->IsHole = outrec->IsHole;

-                                outrec->IsHole = !outrec2->IsHole;

-                                outrec2->FirstLeft = outrec->FirstLeft;

-                                outrec->FirstLeft = outrec2;

-                                if (m_UsingPolyTree)

-                                {

-                                    FixupFirstLefts2(outrec, outrec2);

-                                }

-                                auto range = dupeRec.equal_range(idx_j);

-                                std::list<std::pair<int, OutPtIntersect> > move_list;

-                                for (auto it = range.first; it != range.second;)

-                                {

-                                    OutRec * itRec = GetOutRec(it->second.op1->Idx);

-                                    OutRec * itRec2 = GetOutRec(it->second.op2->Idx);

-                                    OutRec * flRec;

-                                    OutRec * flRec2;

-                                    if (itRec->IsHole)

-                                    {

-                                        flRec = ParseFirstLeft(itRec->FirstLeft);

-                                    }

-                                    else

-                                    {

-                                        flRec = itRec;

-                                    }

-                                    if (itRec2->IsHole)

-                                    {

-                                        flRec2 = ParseFirstLeft(itRec2->FirstLeft);

-                                    }

-                                    else

-                                    {

-                                        flRec2 = itRec2;

-                                    }

-                                    if (itRec->Idx != idx_j)

-                                    {

-                                        if ((itRec->IsHole || itRec2->IsHole) && (flRec == flRec2))

-                                        {

-                                            move_list.emplace_back(itRec->Idx, it->second);

-                                        }

-                                        it = dupeRec.erase(it);

-                                    }

-                                    else

-                                    {

-                                        if ((itRec->IsHole || itRec2->IsHole) && (flRec == flRec2))

-                                        {

-                                            ++it;

-                                        }

-                                        else

-                                        {

-                                            it = dupeRec.erase(it);

-                                        }

-                                    }

-                                }

-                                if (!move_list.empty())

-                                {

-                                    dupeRec.insert(move_list.begin(), move_list.end());

-                                }

-                                if (!outrec2->IsHole)

-                                {

-                                    OutPtIntersect intPt1 = { outrec->Pts, outrec2->Pts };

-                                    OutPtIntersect intPt2 = { outrec2->Pts, outrec->Pts };

-                                    dupeRec.emplace(outrec->Idx, intPt1);

-                                    dupeRec.emplace(outrec2->Idx, intPt2);

-                                }

-                            }

-                            else

-                            {

-                                //the 2 polygons are separate ...

-                                outrec2->IsHole = outrec->IsHole;

-                                outrec2->FirstLeft = outrec->FirstLeft;

-                                if (m_UsingPolyTree)

-                                {

-                                    FixupFirstLefts1(outrec, outrec2);

-                                }

-                                auto range = dupeRec.equal_range(idx_j);

-                                std::list<std::pair<int, OutPtIntersect> > move_list;

-                                for (auto it = range.first; it != range.second;)

-                                {

-                                    OutRec * itRec = GetOutRec(it->second.op1->Idx);

-                                    OutRec * itRec2 = GetOutRec(it->second.op2->Idx);

-                                    OutRec * flRec;

-                                    OutRec * flRec2;

-                                    if (itRec->IsHole)

-                                    {

-                                        flRec = ParseFirstLeft(itRec->FirstLeft);

-                                    }

-                                    else

-                                    {

-                                        flRec = itRec;

-                                    }

-                                    if (itRec2->IsHole)

-                                    {

-                                        flRec2 = ParseFirstLeft(itRec2->FirstLeft);

-                                    }

-                                    else

-                                    {

-                                        flRec2 = itRec2;

-                                    }

-                                    if (itRec->Idx != idx_j)

-                                    {

-                                        if ((itRec->IsHole || itRec2->IsHole) && (flRec == flRec2))

-                                        {

-                                            move_list.emplace_back(itRec->Idx, it->second);

-                                        }

-                                        it = dupeRec.erase(it);

-                                    }

-                                    else

-                                    {

-                                        if ((itRec->IsHole || itRec2->IsHole) && (flRec == flRec2))

-                                        {

-                                            ++it;

-                                        }

-                                        else

-                                        {

-                                            it = dupeRec.erase(it);

-                                        }

-                                    }

-                                }

-                                if (!move_list.empty())

-                                {

-                                    dupeRec.insert(move_list.begin(), move_list.end());

-                                }

-                                if (outrec2->IsHole)

-                                {

-                                    OutPtIntersect intPt1 = { outrec->Pts, outrec2->Pts };

-                                    OutPtIntersect intPt2 = { outrec2->Pts, outrec->Pts };

-                                    dupeRec.emplace(outrec->Idx, intPt1);

-                                    dupeRec.emplace(outrec2->Idx, intPt2);

-                                }

-                            }

-                            outRec_j = GetOutRec(m_OutPts[j]->Idx);

-                            idx_j = outRec_j->Idx;

-                        }

-                        continue;

-                    }

-                    if (FixIntersects(dupeRec, m_OutPts[j], m_OutPts[k], outRec_j, outRec_k))

-                    {

-                        outRec_j = GetOutRec(m_OutPts[j]->Idx);

-                        idx_j = outRec_j->Idx;

-                    }

-                }

-            }

-            count = 0;

-        }

-    }

-}

-//------------------------------------------------------------------------------

-

-void ReversePath(Path& p)

-{

-  std::reverse(p.begin(), p.end());

-}

-//------------------------------------------------------------------------------

-

-void ReversePaths(Paths& p)

-{

-  for (Paths::size_type i = 0; i < p.size(); ++i)

-    ReversePath(p[i]);

-}

-//------------------------------------------------------------------------------

-

-void SimplifyPolygon(const Path &in_poly, Paths &out_polys, PolyFillType fillType)

-{

-  Clipper c;

-  c.StrictlySimple(true);

-  c.AddPath(in_poly, ptSubject, true);

-  c.Execute(ctUnion, out_polys, fillType, fillType);

-}

-//------------------------------------------------------------------------------

-

-void SimplifyPolygons(const Paths &in_polys, Paths &out_polys, PolyFillType fillType)

-{

-  Clipper c;

-  c.StrictlySimple(true);

-  c.AddPaths(in_polys, ptSubject, true);

-  c.Execute(ctUnion, out_polys, fillType, fillType);

-}

-//------------------------------------------------------------------------------

-

-void SimplifyPolygons(Paths &polys, PolyFillType fillType)

-{

-  SimplifyPolygons(polys, polys, fillType);

-}

-//------------------------------------------------------------------------------

-

-inline double DistanceSqrd(const IntPoint& pt1, const IntPoint& pt2)

-{

-  double Dx = ((double)pt1.x - pt2.x);

-  double dy = ((double)pt1.y - pt2.y);

-  return (Dx*Dx + dy*dy);

-}

-//------------------------------------------------------------------------------

-

-double DistanceFromLineSqrd(

-  const IntPoint& pt, const IntPoint& ln1, const IntPoint& ln2)

-{

-  //The equation of a line in general form (Ax + By + C = 0)

-  //given 2 points (x¹,y¹) & (x²,y²) is ...

-  //(y¹ - y²)x + (x² - x¹)y + (y² - y¹)x¹ - (x² - x¹)y¹ = 0

-  //A = (y¹ - y²); B = (x² - x¹); C = (y² - y¹)x¹ - (x² - x¹)y¹

-  //perpendicular distance of point (x³,y³) = (Ax³ + By³ + C)/Sqrt(A² + B²)

-  //see http://en.wikipedia.org/wiki/Perpendicular_distance

-  double A = double(ln1.y - ln2.y);

-  double B = double(ln2.x - ln1.x);

-  double C = A * ln1.x  + B * ln1.y;

-  C = A * pt.x + B * pt.y - C;

-  return (C * C) / (A * A + B * B);

-}

-//---------------------------------------------------------------------------

-

-bool SlopesNearCollinear(const IntPoint& pt1, 

-    const IntPoint& pt2, const IntPoint& pt3, double distSqrd)

-{

-  //this function is more accurate when the point that's geometrically

-  //between the other 2 points is the one that's tested for distance.

-  //ie makes it more likely to pick up 'spikes' ...

-	if (Abs(pt1.x - pt2.x) > Abs(pt1.y - pt2.y))

-	{

-    if ((pt1.x > pt2.x) == (pt1.x < pt3.x))

-      return DistanceFromLineSqrd(pt1, pt2, pt3) < distSqrd;

-    else if ((pt2.x > pt1.x) == (pt2.x < pt3.x))

-      return DistanceFromLineSqrd(pt2, pt1, pt3) < distSqrd;

-		else

-	    return DistanceFromLineSqrd(pt3, pt1, pt2) < distSqrd;

-	}

-	else

-	{

-    if ((pt1.y > pt2.y) == (pt1.y < pt3.y))

-      return DistanceFromLineSqrd(pt1, pt2, pt3) < distSqrd;

-    else if ((pt2.y > pt1.y) == (pt2.y < pt3.y))

-      return DistanceFromLineSqrd(pt2, pt1, pt3) < distSqrd;

-		else

-      return DistanceFromLineSqrd(pt3, pt1, pt2) < distSqrd;

-	}

-}

-//------------------------------------------------------------------------------

-

-bool PointsAreClose(IntPoint pt1, IntPoint pt2, double distSqrd)

-{

-    double Dx = (double)pt1.x - pt2.x;

-    double dy = (double)pt1.y - pt2.y;

-    return ((Dx * Dx) + (dy * dy) <= distSqrd);

-}

-//------------------------------------------------------------------------------

-

-OutPt* ExcludeOp(OutPt* op)

-{

-  OutPt* result = op->Prev;

-  result->Next = op->Next;

-  op->Next->Prev = result;

-  result->Idx = 0;

-  return result;

-}

-//------------------------------------------------------------------------------

-

-void CleanPolygon(const Path& in_poly, Path& out_poly, double distance)

-{

-  //distance = proximity in units/pixels below which vertices

-  //will be stripped. Default ~= sqrt(2).

-  

-  size_t size = in_poly.size();

-  

-  if (size == 0) 

-  {

-    out_poly.clear();

-    return;

-  }

-

-  OutPt* outPts = new OutPt[size];

-  for (size_t i = 0; i < size; ++i)

-  {

-    outPts[i].Pt = in_poly[i];

-    outPts[i].Next = &outPts[(i + 1) % size];

-    outPts[i].Next->Prev = &outPts[i];

-    outPts[i].Idx = 0;

-  }

-

-  double distSqrd = distance * distance;

-  OutPt* op = &outPts[0];

-  while (op->Idx == 0 && op->Next != op->Prev) 

-  {

-    if (PointsAreClose(op->Pt, op->Prev->Pt, distSqrd))

-    {

-      op = ExcludeOp(op);

-      size--;

-    } 

-    else if (PointsAreClose(op->Prev->Pt, op->Next->Pt, distSqrd))

-    {

-      ExcludeOp(op->Next);

-      op = ExcludeOp(op);

-      size -= 2;

-    }

-    else if (SlopesNearCollinear(op->Prev->Pt, op->Pt, op->Next->Pt, distSqrd))

-    {

-      op = ExcludeOp(op);

-      size--;

-    }

-    else

-    {

-      op->Idx = 1;

-      op = op->Next;

-    }

-  }

-

-  if (size < 3) size = 0;

-  out_poly.resize(size);

-  for (size_t i = 0; i < size; ++i)

-  {

-    out_poly[i] = op->Pt;

-    op = op->Next;

-  }

-  delete [] outPts;

-}

-//------------------------------------------------------------------------------

-

-void CleanPolygon(Path& poly, double distance)

-{

-  CleanPolygon(poly, poly, distance);

-}

-//------------------------------------------------------------------------------

-

-void CleanPolygons(const Paths& in_polys, Paths& out_polys, double distance)

-{

-  out_polys.resize(in_polys.size());

-  for (Paths::size_type i = 0; i < in_polys.size(); ++i)

-    CleanPolygon(in_polys[i], out_polys[i], distance);

-}

-//------------------------------------------------------------------------------

-

-void CleanPolygons(Paths& polys, double distance)

-{

-  CleanPolygons(polys, polys, distance);

-}

-//------------------------------------------------------------------------------

-

-void Minkowski(const Path& poly, const Path& path, 

-  Paths& solution, bool isSum, bool isClosed)

-{

-  int delta = (isClosed ? 1 : 0);

-  size_t polyCnt = poly.size();

-  size_t pathCnt = path.size();

-  Paths pp;

-  pp.reserve(pathCnt);

-  if (isSum)

-    for (size_t i = 0; i < pathCnt; ++i)

-    {

-      Path p;

-      p.reserve(polyCnt);

-      for (size_t j = 0; j < poly.size(); ++j)

-        p.push_back(IntPoint(path[i].x + poly[j].x, path[i].y + poly[j].y));

-      pp.push_back(p);

-    }

-  else

-    for (size_t i = 0; i < pathCnt; ++i)

-    {

-      Path p;

-      p.reserve(polyCnt);

-      for (size_t j = 0; j < poly.size(); ++j)

-        p.push_back(IntPoint(path[i].x - poly[j].x, path[i].y - poly[j].y));

-      pp.push_back(p);

-    }

-

-  solution.clear();

-  solution.reserve((pathCnt + delta) * (polyCnt + 1));

-  for (size_t i = 0; i < pathCnt - 1 + delta; ++i)

-    for (size_t j = 0; j < polyCnt; ++j)

-    {

-      Path quad;

-      quad.reserve(4);

-      quad.push_back(pp[i % pathCnt][j % polyCnt]);

-      quad.push_back(pp[(i + 1) % pathCnt][j % polyCnt]);

-      quad.push_back(pp[(i + 1) % pathCnt][(j + 1) % polyCnt]);

-      quad.push_back(pp[i % pathCnt][(j + 1) % polyCnt]);

-      if (!Orientation(quad)) ReversePath(quad);

-      solution.push_back(quad);

-    }

-}

-//------------------------------------------------------------------------------

-

-void MinkowskiSum(const Path& pattern, const Path& path, Paths& solution, bool pathIsClosed)

-{

-  Minkowski(pattern, path, solution, true, pathIsClosed);

-  Clipper c;

-  c.AddPaths(solution, ptSubject, true);

-  c.Execute(ctUnion, solution, pftNonZero, pftNonZero);

-}

-//------------------------------------------------------------------------------

-

-void TranslatePath(const Path& input, Path& output, const IntPoint delta)

-{

-  //precondition: input != output

-  output.resize(input.size());

-  for (size_t i = 0; i < input.size(); ++i)

-    output[i] = IntPoint(input[i].x + delta.x, input[i].y + delta.y);

-}

-//------------------------------------------------------------------------------

-

-void MinkowskiSum(const Path& pattern, const Paths& paths, Paths& solution, bool pathIsClosed)

-{

-  Clipper c;

-  for (size_t i = 0; i < paths.size(); ++i)

-  {

-    Paths tmp;

-    Minkowski(pattern, paths[i], tmp, true, pathIsClosed);

-    c.AddPaths(tmp, ptSubject, true);

-    if (pathIsClosed)

-    {

-      Path tmp2;

-      TranslatePath(paths[i], tmp2, pattern[0]);

-      c.AddPath(tmp2, ptClip, true);

-    }

-  }

-    c.Execute(ctUnion, solution, pftNonZero, pftNonZero);

-}

-//------------------------------------------------------------------------------

-

-void MinkowskiDiff(const Path& poly1, const Path& poly2, Paths& solution)

-{

-  Minkowski(poly1, poly2, solution, false, true);

-  Clipper c;

-  c.AddPaths(solution, ptSubject, true);

-  c.Execute(ctUnion, solution, pftNonZero, pftNonZero);

-}

-//------------------------------------------------------------------------------

-

-enum NodeType {ntAny, ntOpen, ntClosed};

-

-void AddPolyNodeToPaths(const PolyNode& polynode, NodeType nodetype, Paths& paths)

-{

-  bool match = true;

-  if (nodetype == ntClosed) match = !polynode.IsOpen();

-  else if (nodetype == ntOpen) return;

-

-  if (!polynode.Contour.empty() && match)

-    paths.push_back(polynode.Contour);

-  for (int i = 0; i < polynode.ChildCount(); ++i)

-    AddPolyNodeToPaths(*polynode.Childs[i], nodetype, paths);

-}

-//------------------------------------------------------------------------------

-

-void PolyTreeToPaths(const PolyTree& polytree, Paths& paths)

-{

-  paths.resize(0); 

-  paths.reserve(polytree.Total());

-  AddPolyNodeToPaths(polytree, ntAny, paths);

-}

-//------------------------------------------------------------------------------

-

-void ClosedPathsFromPolyTree(const PolyTree& polytree, Paths& paths)

-{

-  paths.resize(0); 

-  paths.reserve(polytree.Total());

-  AddPolyNodeToPaths(polytree, ntClosed, paths);

-}

-//------------------------------------------------------------------------------

-

-void OpenPathsFromPolyTree(PolyTree& polytree, Paths& paths)

-{

-  paths.resize(0); 

-  paths.reserve(polytree.Total());

-  //Open paths are top level only, so ...

-  for (int i = 0; i < polytree.ChildCount(); ++i)

-    if (polytree.Childs[i]->IsOpen())

-      paths.push_back(polytree.Childs[i]->Contour);

-}

-//------------------------------------------------------------------------------

-

-std::ostream& operator <<(std::ostream &s, const IntPoint &p)

-{

-  s << "(" << p.x << "," << p.y << ")";

-  return s;

-}

-//------------------------------------------------------------------------------

-

-std::ostream& operator <<(std::ostream &s, const Path &p)

-{

-  if (p.empty()) return s;

-  Path::size_type last = p.size() -1;

-  for (Path::size_type i = 0; i < last; i++)

-    s << "(" << p[i].x << "," << p[i].y << "), ";

-  s << "(" << p[last].x << "," << p[last].y << ")\n";

-  return s;

-}

-//------------------------------------------------------------------------------

-

-std::ostream& operator <<(std::ostream &s, const Paths &p)

-{

-  for (Paths::size_type i = 0; i < p.size(); i++)

-    s << p[i];

-  s << "\n";

-  return s;

-}

-//------------------------------------------------------------------------------

-

-} //ClipperLib namespace

diff --git a/src/clipper/clipper.hpp b/src/clipper/clipper.hpp
deleted file mode 100644
index 661aeb33e6..0000000000
--- a/src/clipper/clipper.hpp
+++ /dev/null
@@ -1,450 +0,0 @@
-/*******************************************************************************

-*                                                                              *

-* Author    :  Angus Johnson                                                   *

-* Version   :  6.4.0                                                           *

-* Date      :  2 July 2015                                                     *

-* Website   :  http://www.angusj.com                                           *

-* Copyright :  Angus Johnson 2010-2015                                         *

-*                                                                              *

-* License:                                                                     *

-* Use, modification & distribution is subject to Boost Software License Ver 1. *

-* http://www.boost.org/LICENSE_1_0.txt                                         *

-*                                                                              *

-* Attributions:                                                                *

-* The code in this library is an extension of Bala Vatti's clipping algorithm: *

-* "A generic solution to polygon clipping"                                     *

-* Communications of the ACM, Vol 35, Issue 7 (July 1992) pp 56-63.             *

-* http://portal.acm.org/citation.cfm?id=129906                                 *

-*                                                                              *

-* Computer graphics and geometric modeling: implementation and algorithms      *

-* By Max K. Agoston                                                            *

-* Springer; 1 edition (January 4, 2005)                                        *

-* http://books.google.com/books?q=vatti+clipping+agoston                       *

-*                                                                              *

-* See also:                                                                    *

-* "Polygon Offsetting by Computing Winding Numbers"                            *

-* Paper no. DETC2005-85513 pp. 565-575                                         *

-* ASME 2005 International Design Engineering Technical Conferences             *

-* and Computers and Information in Engineering Conference (IDETC/CIE2005)      *

-* September 24-28, 2005 , Long Beach, California, USA                          *

-* http://www.me.berkeley.edu/~mcmains/pubs/DAC05OffsetPolygon.pdf              *

-*                                                                              *

-*******************************************************************************/

-

-#ifndef clipper_hpp

-#define clipper_hpp

-

-#define CLIPPER_VERSION "6.2.6"

-

-//use_int32: When enabled 32bit ints are used instead of 64bit ints. This

-//improve performance but coordinate values are limited to the range +/- 46340

-//#define use_int32

-

-//use_xyz: adds a Z member to IntPoint. Adds a minor cost to perfomance.

-//#define use_xyz

-

-//use_lines: Enables line clipping. Adds a very minor cost to performance.

-//#define use_lines

-  

-//use_deprecated: Enables temporary support for the obsolete functions

-//#define use_deprecated  

-

-#include <vector>

-#include <list>

-#include <set>

-#include <stdexcept>

-#include <cstring>

-#include <cstdlib>

-#include <ostream>

-#include <functional>

-#include <queue>

-#include <unordered_map>

-#if defined(CLIPPER_IMPL_INCLUDE)

-#include CLIPPER_IMPL_INCLUDE

-#endif

-

-namespace ClipperLib {

-

-enum ClipType { ctIntersection, ctUnion, ctDifference, ctXor };

-enum PolyType { ptSubject, ptClip };

-//By far the most widely used winding rules for polygon filling are

-//EvenOdd & NonZero (GDI, GDI+, XLib, OpenGL, Cairo, AGG, Quartz, SVG, Gr32)

-//Others rules include Positive, Negative and ABS_GTR_EQ_TWO (only in OpenGL)

-//see http://glprogramming.com/red/chapter11.html

-enum PolyFillType { pftEvenOdd, pftNonZero, pftPositive, pftNegative };

-

-#ifdef use_int32

-  typedef int cInt;

-  static cInt const loRange = 0x7FFF;

-  static cInt const hiRange = 0x7FFF;

-#else

-  typedef std::int64_t cInt;

-  static cInt const loRange = 0x3FFFFFFF;

-  static cInt const hiRange = 0x3FFFFFFFFFFFFFFFLL;

-  typedef signed long long long64;     //used by Int128 class

-  typedef unsigned long long ulong64;

-

-#endif

-

-#if defined(CLIPPER_INTPOINT_IMPL)

-

-typedef CLIPPER_INTPOINT_IMPL IntPoint;

-

-#else

-

-struct IntPoint {

-  cInt x;

-  cInt y;

-#ifdef use_xyz

-  cInt Z;

-  IntPoint(cInt _x = 0, cInt _y = 0, cInt z = 0): x(_x), y(_y), Z(z) {};

-#else

-  IntPoint(cInt _x = 0, cInt _y = 0): x(_x), y(_y) {};

-#endif

-

-  friend inline bool operator== (const IntPoint& a, const IntPoint& b)

-  {

-    return a.x == b.x && a.y == b.y;

-  }

-  friend inline bool operator!= (const IntPoint& a, const IntPoint& b)

-  {

-    return a.x != b.x  || a.y != b.y; 

-  }

-};

-#endif

-

-//------------------------------------------------------------------------------

-

-#if defined(CLIPPER_PATH_IMPL)

-

-typedef CLIPPER_PATH_IMPL Path;

-

-#else

-

-typedef std::vector< IntPoint > Path;

-

-#endif

-

-

-#if defined(CLIPPER_PATHS_IMPL)

-

-typedef CLIPPER_PATHS_IMPL Paths;

-

-#else

-

-typedef std::vector< Path > Paths;

-

-#endif

-

-

-

-inline Path& operator <<(Path& poly, const IntPoint& p) {poly.push_back(p); return poly;}

-inline Paths& operator <<(Paths& polys, const Path& p) {polys.push_back(p); return polys;}

-

-std::ostream& operator <<(std::ostream &s, const IntPoint &p);

-std::ostream& operator <<(std::ostream &s, const Path &p);

-std::ostream& operator <<(std::ostream &s, const Paths &p);

-

-struct DoublePoint

-{

-  double x;

-  double y;

-  DoublePoint(double _x = 0, double _y = 0) : x(_x), y(_y) {}

-  DoublePoint(IntPoint ip) : x((double)ip.x), y((double)ip.y) {}

-};

-//------------------------------------------------------------------------------

-

-#ifdef use_xyz

-typedef void (*ZFillCallback)(IntPoint& e1bot, IntPoint& e1top, IntPoint& e2bot, IntPoint& e2top, IntPoint& pt);

-#endif

-

-enum InitOptions {ioReverseSolution = 1, ioStrictlySimple = 2, ioPreserveCollinear = 4};

-enum JoinType {jtSquare, jtRound, jtMiter};

-enum EndType {etClosedPolygon, etClosedLine, etOpenButt, etOpenSquare, etOpenRound};

-

-class PolyNode;

-typedef std::vector< PolyNode* > PolyNodes;

-

-class PolyNode 

-{ 

-public:

-    PolyNode();

-    virtual ~PolyNode(){};

-    Path Contour;

-    PolyNodes Childs;

-    PolyNode* Parent;

-    PolyNode* GetNext() const;

-    bool IsHole() const;

-    bool IsOpen() const;

-    int ChildCount() const;

-private:

-    unsigned Index; //node index in Parent.Childs

-    bool m_IsOpen;

-    JoinType m_jointype;

-    EndType m_endtype;

-    PolyNode* GetNextSiblingUp() const;

-    void AddChild(PolyNode& child);

-    friend class Clipper; //to access Index

-    friend class ClipperOffset; 

-};

-

-class PolyTree: public PolyNode

-{ 

-public:

-    ~PolyTree(){Clear();};

-    PolyNode* GetFirst() const;

-    void Clear();

-    int Total() const;

-private:

-    PolyNodes AllNodes;

-    friend class Clipper; //to access AllNodes

-};

-

-bool Orientation(const Path &poly);

-double Area(const Path &poly);

-int PointInPolygon(const IntPoint &pt, const Path &path);

-

-void SimplifyPolygon(const Path &in_poly, Paths &out_polys, PolyFillType fillType = pftEvenOdd);

-void SimplifyPolygons(const Paths &in_polys, Paths &out_polys, PolyFillType fillType = pftEvenOdd);

-void SimplifyPolygons(Paths &polys, PolyFillType fillType = pftEvenOdd);

-

-void CleanPolygon(const Path& in_poly, Path& out_poly, double distance = 1.415);

-void CleanPolygon(Path& poly, double distance = 1.415);

-void CleanPolygons(const Paths& in_polys, Paths& out_polys, double distance = 1.415);

-void CleanPolygons(Paths& polys, double distance = 1.415);

-

-void MinkowskiSum(const Path& pattern, const Path& path, Paths& solution, bool pathIsClosed);

-void MinkowskiSum(const Path& pattern, const Paths& paths, Paths& solution, bool pathIsClosed);

-void MinkowskiDiff(const Path& poly1, const Path& poly2, Paths& solution);

-

-void PolyTreeToPaths(const PolyTree& polytree, Paths& paths);

-void ClosedPathsFromPolyTree(const PolyTree& polytree, Paths& paths);

-void OpenPathsFromPolyTree(PolyTree& polytree, Paths& paths);

-

-void ReversePath(Path& p);

-void ReversePaths(Paths& p);

-

-struct IntRect { cInt left; cInt top; cInt right; cInt bottom; };

-

-//enums that are used internally ...

-enum EdgeSide { esLeft = 1, esRight = 2};

-

-//forward declarations (for stuff used internally) ...

-struct TEdge;

-struct IntersectNode;

-struct LocalMinimum;

-struct OutPt;

-struct OutRec;

-struct Join;

-struct OutPtIntersect;

-

-typedef std::vector < OutRec* > PolyOutList;

-typedef std::vector < TEdge* > EdgeList;

-typedef std::vector < Join* > JoinList;

-typedef std::vector < IntersectNode* > IntersectList;

-

-//------------------------------------------------------------------------------

-

-//ClipperBase is the ancestor to the Clipper class. It should not be

-//instantiated directly. This class simply abstracts the conversion of sets of

-//polygon coordinates into edge objects that are stored in a LocalMinima list.

-class ClipperBase

-{

-public:

-  ClipperBase();

-  virtual ~ClipperBase();

-  virtual bool AddPath(const Path &pg, PolyType PolyTyp, bool Closed);

-  bool AddPaths(const Paths &ppg, PolyType PolyTyp, bool Closed);

-  virtual void Clear();

-  IntRect GetBounds();

-  bool PreserveCollinear() {return m_PreserveCollinear;};

-  void PreserveCollinear(bool value) {m_PreserveCollinear = value;};

-protected:

-  void DisposeLocalMinimaList();

-  TEdge* AddBoundsToLML(TEdge *e, bool IsClosed);

-  virtual void Reset();

-  TEdge* ProcessBound(TEdge* E, bool IsClockwise);

-  void InsertScanbeam(const cInt Y);

-  bool PopScanbeam(cInt &Y);

-  bool LocalMinimaPending();

-  bool PopLocalMinima(cInt Y, const LocalMinimum *&locMin);

-  OutRec* CreateOutRec();

-  void DisposeAllOutRecs();

-  void DisposeOutRec(PolyOutList::size_type index);

-  void SwapPositionsInAEL(TEdge *edge1, TEdge *edge2);

-  void DeleteFromAEL(TEdge *e);

-  void UpdateEdgeIntoAEL(TEdge *&e);

-

-  typedef std::vector<LocalMinimum> MinimaList;

-  MinimaList::iterator m_CurrentLM;

-  MinimaList           m_MinimaList;

-

-  bool              m_UseFullRange;

-  EdgeList          m_edges;

-  bool              m_PreserveCollinear;

-  bool              m_HasOpenPaths;

-  PolyOutList       m_PolyOuts;

-  TEdge           *m_ActiveEdges;

-

-  typedef std::priority_queue<cInt> ScanbeamList;

-  ScanbeamList     m_Scanbeam;

-};

-//------------------------------------------------------------------------------

-

-class Clipper : public virtual ClipperBase

-{

-public:

-  Clipper(int initOptions = 0);

-  bool Execute(ClipType clipType,

-      Paths &solution,

-      PolyFillType fillType = pftEvenOdd);

-  bool Execute(ClipType clipType,

-      Paths &solution,

-      PolyFillType subjFillType,

-      PolyFillType clipFillType);

-  bool Execute(ClipType clipType,

-      PolyTree &polytree,

-      PolyFillType fillType = pftEvenOdd);

-  bool Execute(ClipType clipType,

-      PolyTree &polytree,

-      PolyFillType subjFillType,

-      PolyFillType clipFillType);

-  bool ReverseSolution() { return m_ReverseOutput; };

-  void ReverseSolution(bool value) {m_ReverseOutput = value;};

-  bool StrictlySimple() {return m_StrictSimple;};

-  void StrictlySimple(bool value) {m_StrictSimple = value;};

-  //set the callback function for z value filling on intersections (otherwise Z is 0)

-#ifdef use_xyz

-  void ZFillFunction(ZFillCallback zFillFunc);

-#endif

-protected:

-  virtual bool ExecuteInternal();

-private:

-  JoinList         m_Joins;

-  JoinList         m_GhostJoins;

-  IntersectList    m_IntersectList;

-  ClipType         m_ClipType;

-  typedef std::list<cInt> MaximaList;

-  MaximaList       m_Maxima;

-  TEdge           *m_SortedEdges;

-  bool             m_ExecuteLocked;

-  PolyFillType     m_ClipFillType;

-  PolyFillType     m_SubjFillType;

-  bool             m_ReverseOutput;

-  bool             m_UsingPolyTree; 

-  bool             m_StrictSimple;

-#ifdef use_xyz

-  ZFillCallback   m_ZFill; //custom callback 

-#endif

-  void SetWindingCount(TEdge& edge);

-  bool IsEvenOddFillType(const TEdge& edge) const;

-  bool IsEvenOddAltFillType(const TEdge& edge) const;

-  void InsertLocalMinimaIntoAEL(const cInt botY);

-  void InsertEdgeIntoAEL(TEdge *edge, TEdge* startEdge);

-  void AddEdgeToSEL(TEdge *edge);

-  bool PopEdgeFromSEL(TEdge *&edge);

-  void CopyAELToSEL();

-  void DeleteFromSEL(TEdge *e);

-  void SwapPositionsInSEL(TEdge *edge1, TEdge *edge2);

-  bool IsContributing(const TEdge& edge) const;

-  bool IsTopHorz(const cInt XPos);

-  void DoMaxima(TEdge *e);

-  void ProcessHorizontals();

-  void ProcessHorizontal(TEdge *horzEdge);

-  void AddLocalMaxPoly(TEdge *e1, TEdge *e2, const IntPoint &pt);

-  OutPt* AddLocalMinPoly(TEdge *e1, TEdge *e2, const IntPoint &pt);

-  OutRec* GetOutRec(int idx);

-  void AppendPolygon(TEdge *e1, TEdge *e2);

-  void IntersectEdges(TEdge *e1, TEdge *e2, IntPoint &pt);

-  OutPt* AddOutPt(TEdge *e, const IntPoint &pt);

-  OutPt* GetLastOutPt(TEdge *e);

-  bool ProcessIntersections(const cInt topY);

-  void BuildIntersectList(const cInt topY);

-  void ProcessIntersectList();

-  void ProcessEdgesAtTopOfScanbeam(const cInt topY);

-  void BuildResult(Paths& polys);

-  void BuildResult2(PolyTree& polytree);

-  void SetHoleState(TEdge *e, OutRec *outrec);

-  void DisposeIntersectNodes();

-  bool FixupIntersectionOrder();

-  void FixupOutPolygon(OutRec &outrec);

-  void FixupOutPolyline(OutRec &outrec);

-  bool IsHole(TEdge *e);

-  bool FindOwnerFromSplitRecs(OutRec &outRec, OutRec *&currOrfl);

-  void FixHoleLinkage(OutRec &outrec);

-  void AddJoin(OutPt *op1, OutPt *op2, const IntPoint offPt);

-  void ClearJoins();

-  void ClearGhostJoins();

-  void AddGhostJoin(OutPt *op, const IntPoint offPt);

-  bool JoinPoints(Join *j, OutRec* outRec1, OutRec* outRec2);

-  void JoinCommonEdges();

-  void DoSimplePolygons();

-  bool FindIntersectLoop(std::unordered_multimap<int, OutPtIntersect> & dupeRec,

-                         std::list<std::pair<int, OutPtIntersect> > & iList,

-                         OutRec * outRec_parent,

-                         int idx_origin,

-                         int idx_prev,

-                         std::set<int> & visited,

-                         OutPt * orig_pt, 

-                         OutPt * prev_pt);

-  bool FixIntersects(std::unordered_multimap<int, OutPtIntersect> & dupeRec,

-                     OutPt * op_j,

-                     OutPt * op_k,

-                     OutRec * outRec_j,

-                     OutRec * outRec_k);

-  void FixupFirstLefts1(OutRec* OldOutRec, OutRec* NewOutRec);

-  void FixupFirstLefts2(OutRec* InnerOutRec, OutRec* OuterOutRec);

-  void FixupFirstLefts3(OutRec* OldOutRec, OutRec* NewOutRec);

-#ifdef use_xyz

-  void SetZ(IntPoint& pt, TEdge& e1, TEdge& e2);

-#endif

-};

-//------------------------------------------------------------------------------

-

-class ClipperOffset 

-{

-public:

-  ClipperOffset(double miterLimit = 2.0, double roundPrecision = 0.25);

-  ~ClipperOffset();

-  void AddPath(const Path& path, JoinType joinType, EndType endType);

-  void AddPaths(const Paths& paths, JoinType joinType, EndType endType);

-  void Execute(Paths& solution, double delta);

-  void Execute(PolyTree& solution, double delta);

-  void Clear();

-  double MiterLimit;

-  double ArcTolerance;

-private:

-  Paths m_destPolys;

-  Path m_srcPoly;

-  Path m_destPoly;

-  std::vector<DoublePoint> m_normals;

-  double m_delta, m_sinA, m_sin, m_cos;

-  double m_miterLim, m_StepsPerRad;

-  IntPoint m_lowest;

-  PolyNode m_polyNodes;

-

-  void FixOrientations();

-  void DoOffset(double delta);

-  void OffsetPoint(int j, int& k, JoinType jointype);

-  void DoSquare(int j, int k);

-  void DoMiter(int j, int k, double r);

-  void DoRound(int j, int k);

-};

-//------------------------------------------------------------------------------

-

-class clipperException : public std::exception

-{

-  public:

-    clipperException(const char* description): m_descr(description) {}

-    virtual ~clipperException() throw() {}

-    virtual const char* what() const throw() {return m_descr.c_str();}

-  private:

-    std::string m_descr;

-};

-//------------------------------------------------------------------------------

-

-} //ClipperLib namespace

-

-#endif //clipper_hpp

-

-

diff --git a/src/clipper/fix_members.sh b/src/clipper/fix_members.sh
deleted file mode 100755
index 998d45f0d6..0000000000
--- a/src/clipper/fix_members.sh
+++ /dev/null
@@ -1,24 +0,0 @@
-#!/usr/bin/env bash
-
-export ROOTDIR="$( cd "$( dirname "${BASH_SOURCE[0]}" )" && pwd )"
-
-perl -i -p -e "s/\.X/\.x/g;" ${ROOTDIR}/clipper.*
-perl -i -p -e "s/\->X/\->x/g;" ${ROOTDIR}/clipper.*
-perl -i -p -e "s/cInt X;/cInt x;/g;" ${ROOTDIR}/clipper.*
-perl -i -p -e "s/double X;/double x;/g;" ${ROOTDIR}/clipper.*
-perl -i -p -e "s/X\(x\)/x\(_x\)/g;" ${ROOTDIR}/clipper.*
-perl -i -p -e "s/X\(\(/x\(\(/g;" ${ROOTDIR}/clipper.*
-perl -i -p -e "s/double x = 0/double _x = 0/g;" ${ROOTDIR}/clipper.*
-perl -i -p -e "s/cInt x = 0/cInt _x = 0/g;" ${ROOTDIR}/clipper.*
-
-perl -i -p -e "s/\.Y/\.y/g;" ${ROOTDIR}/clipper.*
-perl -i -p -e "s/\->Y/\->y/g;" ${ROOTDIR}/clipper.*
-perl -i -p -e "s/cInt Y;/cInt y;/g;" ${ROOTDIR}/clipper.*
-perl -i -p -e "s/double Y;/double y;/g;" ${ROOTDIR}/clipper.*
-perl -i -p -e "s/Y\(y\)/y\(_y\)/g;" ${ROOTDIR}/clipper.*
-perl -i -p -e "s/Y\(\(/y\(\(/g;" ${ROOTDIR}/clipper.*
-perl -i -p -e "s/cInt          Y;/cInt          y;/g;" ${ROOTDIR}/clipper.*
-perl -i -p -e "s/double y = 0/double _y = 0/g;" ${ROOTDIR}/clipper.*
-perl -i -p -e "s/cInt y = 0/cInt _y = 0/g;" ${ROOTDIR}/clipper.*
-
-
diff --git a/src/mbgl/tile/geometry_tile_data.cpp b/src/mbgl/tile/geometry_tile_data.cpp
index ebf27e7858..b635c194ec 100644
--- a/src/mbgl/tile/geometry_tile_data.cpp
+++ b/src/mbgl/tile/geometry_tile_data.cpp
@@ -1,7 +1,7 @@
 #include <mbgl/tile/geometry_tile_data.hpp>
 #include <mbgl/tile/tile_id.hpp>
 
-#include <clipper/clipper.hpp>
+#include <mapbox/geometry/wagyu/wagyu.hpp>
 
 namespace mbgl {
 
@@ -17,8 +17,8 @@ static double signedArea(const GeometryCoordinates& ring) {
     return sum;
 }
 
-static ClipperLib::Path toClipperPath(const GeometryCoordinates& ring) {
-    ClipperLib::Path result;
+static LinearRing<std::int32_t> toWagyuPath(const GeometryCoordinates& ring) {
+    LinearRing<std::int32_t> result;
     result.reserve(ring.size());
     for (const auto& p : ring) {
         result.emplace_back(p.x, p.y);
@@ -26,62 +26,84 @@ static ClipperLib::Path toClipperPath(const GeometryCoordinates& ring) {
     return result;
 }
 
-static GeometryCoordinates fromClipperPath(const ClipperLib::Path& path) {
-    GeometryCoordinates result;
-    result.reserve(path.size() + 1);
-
-    for (const auto& p : path) {
-        using Coordinate = GeometryCoordinates::coordinate_type;
-        assert(p.x >= std::numeric_limits<Coordinate>::min());
-        assert(p.x <= std::numeric_limits<Coordinate>::max());
-        assert(p.y >= std::numeric_limits<Coordinate>::min());
-        assert(p.y <= std::numeric_limits<Coordinate>::max());
-        result.emplace_back(Coordinate(p.x), Coordinate(p.y));
-    }
-
-    // Clipper does not repeat initial point, but our geometry model requires it.
-    if (!result.empty()) {
-        result.push_back(result.front());
-    }
-
-    return result;
+static void pushWagyuRing(GeometryCollection & solution,
+                          mapbox::geometry::wagyu::ring_ptr<std::int32_t> r) {
+    GeometryCoordinates lr;
+    lr.reserve(r->size() + 1);
+    auto firstPt = r->points;
+    auto ptIt = r->points;
+    do {
+        lr.emplace_back(ptIt->x, ptIt->y);
+        ptIt = ptIt->prev;
+    } while (ptIt != firstPt);
+    lr.emplace_back(firstPt->x, firstPt->y); // close the ring
+    solution.push_back(lr);
 }
 
-static void processPolynodeBranch(ClipperLib::PolyNode* polynode, GeometryCollection& rings) {
-    // Exterior ring.
-    rings.push_back(fromClipperPath(polynode->Contour));
-    assert(signedArea(rings.back()) > 0);
-
-    // Interior rings.
-    for (auto * ring : polynode->Childs) {
-        rings.push_back(fromClipperPath(ring->Contour));
-        assert(signedArea(rings.back()) < 0);
-    }
-
-    // PolyNodes may be nested in the case of a polygon inside a hole.
-    for (auto * ring : polynode->Childs) {
-        for (auto * subRing : ring->Childs) {
-            processPolynodeBranch(subRing, rings);
+static void buildWagyuResults(GeometryCollection & solution,
+                              mapbox::geometry::wagyu::ring_vector<std::int32_t>& rings) {
+    for (auto r : rings) {
+        if (r == nullptr) {
+            continue;
+        }
+        assert(r->points);
+        if (r->size() < 3) {
+            continue;
+        }
+        solution.emplace_back();
+        pushWagyuRing(solution, r);
+        for (auto c : r->children) {
+            if (c == nullptr) {
+                continue;
+            }
+            assert(c->points);
+            if (c->size() < 3) {
+                continue;
+            }
+            pushWagyuRing(solution, c);
+        }
+        for (auto c : r->children) {
+            if (c == nullptr) {
+                continue;
+            }
+            if (!c->children.empty()) {
+                buildWagyuResults(solution, c->children);
+            }
         }
     }
 }
 
 GeometryCollection fixupPolygons(const GeometryCollection& rings) {
-    ClipperLib::Clipper clipper;
-    clipper.StrictlySimple(true);
+    using namespace mapbox::geometry::wagyu;
+    
+    // This is code that is pulled from the wagyu main class, we 
+    // are doing this to have our own custom build result,
+    // rather then copying output twice from the wagyu algorithm.
+
+    local_minimum_list<std::int32_t> minima_list;
 
     for (const auto& ring : rings) {
-        clipper.AddPath(toClipperPath(ring), ClipperLib::ptSubject, true);
+        // Convert ring to LinearRing type prior to adding them
+        add_linear_ring(toWagyuPath(ring), minima_list, polygon_type_subject);
     }
 
-    ClipperLib::PolyTree polygons;
-    clipper.Execute(ClipperLib::ctUnion, polygons, ClipperLib::pftEvenOdd, ClipperLib::pftEvenOdd);
-    clipper.Clear();
+    // Core part of wagyu algorithm
+    ring_manager<std::int32_t> manager;
+    
+    build_hot_pixels(minima_list, manager);
+    
+    execute_vatti(minima_list, manager, clip_type_union, fill_type_even_odd, fill_type_even_odd);
+    
+    correct_topology(manager);
 
+    // Finally lets build results
     GeometryCollection result;
-    for (auto * polynode : polygons.Childs) {
-        processPolynodeBranch(polynode, result);
-    }
+ 
+    // This calls code based on wagyu/build_results.hpp
+    // rather then returning a multipolygon however, we are
+    // going to return a GeometryCollection
+    buildWagyuResults(result, manager.children);
+
     return result;
 }