polygon_clipper 6.4.2.1

data/ext/clipper/clipper.hpp

@@ -0,0 +1,406 @@
+/*******************************************************************************
+*                                                                              *
+* Author    :  Angus Johnson                                                   *
+* Version   :  6.4.2                                                           *
+* Date      :  27 February 2017                                                *
+* Website   :  http://www.angusj.com                                           *
+* Copyright :  Angus Johnson 2010-2017                                         *
+*                                                                              *
+* 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.4.2"
+
+//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>
+
+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 signed long long 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
+
+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; 
+  }
+};
+//------------------------------------------------------------------------------
+
+typedef std::vector< IntPoint > Path;
+typedef std::vector< Path > Paths;
+
+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:
+    //PolyNode& operator =(PolyNode& other); 
+    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:
+  //PolyTree& operator =(PolyTree& other);
+  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;
+
+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();
+  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
+
+

data/ext/clipper/extconf.rb

@@ -0,0 +1,6 @@
+require 'mkmf'
+
+CONFIG['LDSHARED'] = "$(CXX) -shared"
+
+dir_config('clipper')
+create_makefile('clipper')

data/ext/clipper/rbclipper.cpp

@@ -0,0 +1,379 @@
+/* 
+ * Clipper Ruby Bindings
+ * Copyright 2010 Mike Owens <http://mike.filespanker.com/>
+ *
+ * Released under the same terms as Clipper.
+ *
+ */
+
+#include <clipper.hpp>
+#include <ruby.h>
+
+#ifndef DBL2NUM
+# define DBL2NUM rb_float_new
+#endif
+
+using namespace std;
+using namespace ClipperLib;
+
+/**
+ * clip types
+ * PolyFillTypes
+ * http://www.angusj.com/delphi/clipper/documentation/Docs/Units/ClipperLib/Types/ClipType.htm
+ */
+static ID id_even_odd;
+static ID id_non_zero;
+static ID id_positive;
+static ID id_negative;
+
+/**
+ * end types
+ * http://www.angusj.com/delphi/clipper/documentation/Docs/Units/ClipperLib/Types/EndType.htm
+ */
+static ID id_et_closed_polygon;
+static ID id_et_closed_line;
+static ID id_et_open_square;
+static ID id_et_open_round;
+static ID id_et_open_butt;
+
+/**
+ * join types
+ * http://www.angusj.com/delphi/clipper/documentation/Docs/Units/ClipperLib/Types/JoinType.htm
+ */
+static ID id_jt_square;
+static ID id_jt_round;
+static ID id_jt_miter;
+
+/**
+ * init options
+ * http://www.angusj.com/delphi/clipper/documentation/Docs/Units/ClipperLib/Classes/Clipper/Methods/Constructor.htm
+ */ 
+// http://www.angusj.com/delphi/clipper/documentation/Docs/Units/ClipperLib/Classes/Clipper/Properties/ReverseSolution.htm
+static ID id_init_reverse_solution;
+// http://www.angusj.com/delphi/clipper/documentation/Docs/Units/ClipperLib/Classes/Clipper/Properties/StrictlySimple.htm
+static ID id_init_strictly_simple;
+// http://www.angusj.com/delphi/clipper/documentation/Docs/Units/ClipperLib/Classes/Clipper/Properties/PreserveCollinear.htm
+static ID id_init_preserve_collinear;
+
+static inline Clipper*
+XCLIPPER(VALUE x)
+{
+  Clipper* clipper;
+  Data_Get_Struct(x, Clipper, clipper);
+  return clipper;
+}
+
+static inline PolyFillType
+sym_to_filltype(VALUE sym)
+{
+  ID inp = rb_to_id(sym);
+
+  if (inp == id_even_odd) {
+    return pftEvenOdd;
+  } else if (inp == id_non_zero) {
+    return pftNonZero;
+  } else if (inp == id_positive) {
+    return pftPositive;
+  } else if (inp == id_negative) {
+    return pftNegative;
+  }
+
+  rb_raise(rb_eArgError, "%s", "Expected fill types: even_odd, non_zero, positive, negative");
+}
+
+static inline EndType
+sym_to_endtype(VALUE sym)
+{
+  ID inp = rb_to_id(sym);
+
+  if (inp == id_et_closed_polygon) {
+    return etClosedPolygon;
+  } else if (inp == id_et_closed_line) {
+    return etClosedLine;
+  } else if (inp == id_et_open_square) {
+    return etOpenSquare;
+  } else if (inp == id_et_open_round) {
+    return etOpenRound;
+  } else if (inp == id_et_open_butt) {
+    return etOpenButt;
+  }
+
+  rb_raise(rb_eArgError, "%s", "Expected end types: closed_polygon, closed_line, open_square, open_round, open_butt");
+}
+
+static inline JoinType
+sym_to_jointype(VALUE sym)
+{
+  ID inp = rb_to_id(sym);
+
+  if (inp == id_jt_square) {
+    return jtSquare;
+  } else if (inp == id_jt_round) {
+    return jtRound;
+  } else if (inp == id_jt_miter) {
+    return jtMiter;
+  }
+
+  rb_raise(rb_eArgError, "%s", "Expected join types: square, round, milter");
+}
+
+static inline InitOptions
+sym_to_initoptions(VALUE sym)
+{
+  ID inp = rb_to_id(sym);
+
+  if (inp == id_init_preserve_collinear) {
+    return ioPreserveCollinear;
+  } else if (inp == id_init_reverse_solution) {
+    return ioReverseSolution;
+  } else if (inp == id_init_strictly_simple) {
+    return ioStrictlySimple;
+  }
+
+  rb_raise(rb_eArgError, "%s", "Expected init options: preserve_collinear, reverse_solution, strictly_simple");
+}
+
+extern "C" {
+
+static inline IntPoint
+xy_to_intpoint(VALUE px, VALUE py, double multiplier) {
+  return IntPoint((long64)(NUM2DBL(px) * multiplier), (long64)(NUM2DBL(py) * multiplier));
+}
+
+static void
+ary_to_path(VALUE ary, Path* poly, double multiplier)
+{
+  const char* earg =
+    "Paths have format: [[p0_x, p0_y], [p1_x, p1_y], ...]";
+
+  Check_Type(ary, T_ARRAY);
+
+  for(long i = 0; i != RARRAY_LEN(ary); i++) {
+    VALUE sub = rb_ary_entry(ary, i);
+    Check_Type(sub, T_ARRAY);
+
+    if(RARRAY_LEN(sub) != 2) {
+      rb_raise(rb_eArgError, "%s", earg);
+    }
+
+    VALUE px = rb_ary_entry(sub, 0);
+    VALUE py = rb_ary_entry(sub, 1);
+    poly->push_back(xy_to_intpoint(px, py, multiplier));
+  }
+}
+
+static void
+ary_to_paths(VALUE ary, Paths* paths, double multiplier)
+{
+  Check_Type(ary, T_ARRAY);
+  for(long i = 0; i != RARRAY_LEN(ary); i++) {
+    Path p;
+    VALUE sub = rb_ary_entry(ary, i);
+    Check_Type(sub, T_ARRAY);
+    ary_to_path(sub, &p, multiplier);
+    paths->push_back(p);
+  }
+}
+
+static void
+rbclipper_free(void* ptr)
+{
+  delete (Clipper*) ptr;
+}
+
+static VALUE
+rbclipper_new(VALUE klass)
+{
+  Clipper* ptr = new Clipper;
+  VALUE r = Data_Wrap_Struct(klass, 0, rbclipper_free, ptr);
+  rb_obj_call_init(r, 0, 0);
+  return r;
+}
+
+static VALUE
+rbclipper_initialize(int argc, VALUE* argv, VALUE self)
+{
+  VALUE multiplier;
+
+  if (argc == 1) {
+    multiplier = argv[0];
+  } else if (argc == 0) {
+    multiplier = INT2NUM(1048576); // 2 ^ 10
+  } else {
+    rb_raise(rb_eArgError, "wrong number of arguments");
+  }
+
+  rb_iv_set(self, "@multiplier", multiplier);
+  return self;
+}
+
+static VALUE
+rbclipper_add_polygon_internal(VALUE self, VALUE polygon,
+                               PolyType polytype)
+{
+  double multiplier = NUM2DBL(rb_iv_get(self, "@multiplier"));
+  Path tmp;
+  ary_to_path(polygon, &tmp, multiplier);
+  XCLIPPER(self)->AddPath(tmp, polytype, true);
+  return Qnil;
+}
+
+static VALUE
+rbclipper_add_subject_polygon(VALUE self, VALUE polygon)
+{
+  return rbclipper_add_polygon_internal(self, polygon, ptSubject);
+}
+
+static VALUE
+rbclipper_add_clip_polygon(VALUE self, VALUE polygon)
+{
+  return rbclipper_add_polygon_internal(self, polygon, ptClip);
+}
+
+static VALUE
+rbclipper_add_polygons_internal(VALUE self, VALUE polygons,
+                                    PolyType polytype)
+{
+  double multiplier = NUM2DBL(rb_iv_get(self, "@multiplier"));
+  Paths tmp;
+  ary_to_paths(polygons, &tmp, multiplier);
+  XCLIPPER(self)->AddPaths(tmp, polytype, true);
+  return Qnil;
+}
+
+static VALUE
+rbclipper_add_subject_polygons(VALUE self, VALUE polygons)
+{
+  return rbclipper_add_polygons_internal(self, polygons, ptSubject);
+}
+
+static VALUE
+rbclipper_add_clip_polygons(VALUE self, VALUE polygons)
+{
+  return rbclipper_add_polygons_internal(self, polygons, ptClip);
+}
+
+static VALUE
+rbclipper_clear(VALUE self)
+{
+  XCLIPPER(self)->Clear();
+  return Qnil;
+}
+
+static VALUE
+rbclipper_execute_internal(VALUE self, ClipType cliptype,
+                           VALUE subjfill, VALUE clipfill)
+{
+  if (NIL_P(subjfill))
+    subjfill = ID2SYM(id_even_odd);
+
+  if (NIL_P(clipfill))
+    clipfill = ID2SYM(id_even_odd);
+
+  double inv_multiplier = 1.0 / NUM2LONG(rb_iv_get(self, "@multiplier"));
+
+  Paths solution;
+  XCLIPPER(self)->Execute((ClipType) cliptype,
+                          solution,
+                          sym_to_filltype(subjfill),
+                          sym_to_filltype(clipfill));
+  VALUE r = rb_ary_new();
+  for(Paths::iterator i = solution.begin(); i != solution.end(); ++i) {
+    VALUE sub = rb_ary_new();
+    for(Path::iterator p = i->begin(); p != i->end(); ++p) {
+      rb_ary_push(sub, rb_ary_new3(2, DBL2NUM(p->X * inv_multiplier), DBL2NUM(p->Y * inv_multiplier)));
+    }
+    rb_ary_push(r, sub);
+  }
+
+  return r;
+}
+
+static VALUE
+rbclipper_intersection(int argc, VALUE* argv, VALUE self)
+{
+  VALUE subjfill, clipfill;
+  rb_scan_args(argc, argv, "02", &subjfill, &clipfill);
+  return rbclipper_execute_internal(self, ctIntersection, subjfill, clipfill);
+}
+
+static VALUE
+rbclipper_union(int argc, VALUE* argv, VALUE self)
+{
+  VALUE subjfill, clipfill;
+
+  rb_scan_args(argc, argv, "02", &subjfill, &clipfill);
+
+  return rbclipper_execute_internal(self, ctUnion, subjfill, clipfill);
+}
+
+static VALUE
+rbclipper_difference(int argc, VALUE* argv, VALUE self)
+{
+  VALUE subjfill, clipfill;
+  rb_scan_args(argc, argv, "02", &subjfill, &clipfill);
+  return rbclipper_execute_internal(self, ctDifference, subjfill, clipfill);
+}
+
+static VALUE
+rbclipper_xor(int argc, VALUE* argv, VALUE self)
+{
+  VALUE subjfill, clipfill;
+  rb_scan_args(argc, argv, "02", &subjfill, &clipfill);
+  return rbclipper_execute_internal(self, ctXor, subjfill, clipfill);
+}
+
+typedef VALUE (*ruby_method)(...);
+
+void Init_clipper() {
+  // fill types
+  id_even_odd = rb_intern("even_odd");
+  id_non_zero = rb_intern("non_zero");
+  id_positive = rb_intern("positive");
+  id_negative = rb_intern("negative");
+  // end types
+  id_et_closed_polygon  = rb_intern("closed_polygon");
+  id_et_closed_line     = rb_intern("closed_line");
+  id_et_open_square     = rb_intern("open_square");
+  id_et_open_round      = rb_intern("open_round");
+  id_et_open_butt       = rb_intern("open_butt");
+  // join types
+  id_jt_square  = rb_intern("square");
+  id_jt_round   = rb_intern("round");
+  id_jt_miter   = rb_intern("miter");
+  // init options
+  id_init_reverse_solution    = rb_intern("reverse_solution");
+  id_init_strictly_simple     = rb_intern("strictly_simple");
+  id_init_preserve_collinear  = rb_intern("preserve_collinear");
+
+  VALUE mod = rb_define_module("Clipper");
+  VALUE k   = rb_define_class_under(mod, "Clipper", rb_cObject);
+
+  rb_define_singleton_method(k, "new", (ruby_method) rbclipper_new, 0);
+  rb_define_method(k, "initialize",(ruby_method) rbclipper_initialize, -1);
+  rb_define_attr(k, "multiplier", 1, 0);
+
+  rb_define_method(k, "add_subject_polygon",
+                   (ruby_method) rbclipper_add_subject_polygon, 1);
+  rb_define_method(k, "add_clip_polygon",
+                   (ruby_method) rbclipper_add_clip_polygon, 1);
+
+  rb_define_method(k, "add_subject_polygons",
+                   (ruby_method) rbclipper_add_subject_polygons, 1);
+  rb_define_method(k, "add_clip_polygons",
+                   (ruby_method) rbclipper_add_clip_polygons, 1);
+
+  rb_define_method(k, "clear!",
+                   (ruby_method) rbclipper_clear, 0);
+
+  rb_define_method(k, "intersection",
+                   (ruby_method) rbclipper_intersection, -1);
+  rb_define_method(k, "union",
+                   (ruby_method) rbclipper_union, -1);
+  rb_define_method(k, "difference",
+                   (ruby_method) rbclipper_difference, -1);
+  rb_define_method(k, "xor",
+                   (ruby_method) rbclipper_xor, -1);
+}
+
+} /* extern "C" */