From d9cf81c448906f0c302eff4a97aa6dc7bc4c3ede Mon Sep 17 00:00:00 2001 From: "Andrii Doroshenko (Xrayez)" Date: Tue, 6 Nov 2018 19:17:26 +0200 Subject: [PATCH 1/7] Clipper2 wrapper initial implementation --- modules/clipper/SCsub | 10 + modules/clipper/clipper.cpp | 406 ++++ modules/clipper/clipper.h | 127 ++ modules/clipper/config.py | 7 + modules/clipper/lib/LICENSE.md | 27 + modules/clipper/lib/clipper.cpp | 1920 +++++++++++++++++ modules/clipper/lib/clipper.h | 251 +++ modules/clipper/lib/clipper_offset.cpp | 466 ++++ modules/clipper/lib/clipper_offset.h | 80 + modules/clipper/lib/clipper_triangulation.cpp | 323 +++ modules/clipper/lib/clipper_triangulation.h | 58 + modules/clipper/register_types.cpp | 11 + modules/clipper/register_types.h | 4 + 13 files changed, 3690 insertions(+) create mode 100644 modules/clipper/SCsub create mode 100644 modules/clipper/clipper.cpp create mode 100644 modules/clipper/clipper.h create mode 100644 modules/clipper/config.py create mode 100644 modules/clipper/lib/LICENSE.md create mode 100644 modules/clipper/lib/clipper.cpp create mode 100644 modules/clipper/lib/clipper.h create mode 100644 modules/clipper/lib/clipper_offset.cpp create mode 100644 modules/clipper/lib/clipper_offset.h create mode 100644 modules/clipper/lib/clipper_triangulation.cpp create mode 100644 modules/clipper/lib/clipper_triangulation.h create mode 100644 modules/clipper/register_types.cpp create mode 100644 modules/clipper/register_types.h diff --git a/modules/clipper/SCsub b/modules/clipper/SCsub new file mode 100644 index 000000000000..2fdf17407fc2 --- /dev/null +++ b/modules/clipper/SCsub @@ -0,0 +1,10 @@ +Import('env') + +module_env = env.Clone() + +module_env.add_source_files(env.modules_sources,"*.cpp") +module_env.add_source_files(env.modules_sources,"lib/*.cpp") + +# Clipper library needs some C++11 features +# module_env.Append(CPPFLAGS=["-std=c++11"]) +# module_env.Append(CPPFLAGS=["-std=c++11", "-O2"]) diff --git a/modules/clipper/clipper.cpp b/modules/clipper/clipper.cpp new file mode 100644 index 000000000000..b12878d7bda9 --- /dev/null +++ b/modules/clipper/clipper.cpp @@ -0,0 +1,406 @@ +#include "clipper.h" + +#define PRECISION 10000.0 + +Clipper::Clipper(): mode(MODE_CLIP), + open(false), + fill_rule(cl::frEvenOdd), + path_type(cl::ptSubject), + join_type(cl::kSquare), + end_type(cl::kPolygon), + clip_type(cl::ctUnion), + delta(0.0) {} + +//------------------------------------------------------------------------------ +// Clipping methods +//------------------------------------------------------------------------------ + +void Clipper::add_points(const Vector& points) { + + const cl::Path& path = _scale_up(points, PRECISION); + + switch(mode) { + + case MODE_CLIP: { + cl.AddPath(path, path_type, open); + } break; + + case MODE_OFFSET: { + co.AddPath(path, join_type, end_type); + } break; + + case MODE_TRIANGULATE: { + ct.AddPath(path, path_type, open); + } break; + } +} + +void Clipper::execute(bool build_hierarchy) { + + ERR_EXPLAIN("Cannot build hierarchy outside of MODE_CLIP"); + ERR_FAIL_COND(build_hierarchy && mode != MODE_CLIP) + + switch(mode) { + + case MODE_CLIP: { + + if(build_hierarchy) { + cl.Execute(clip_type, root, solution_open, fill_rule); + _build_hierarchy(root); + } + else { + cl.Execute(clip_type, solution_closed, solution_open, fill_rule); + } + } break; + + case MODE_OFFSET: { + co.Execute(solution_closed, delta * PRECISION); + } break; + + case MODE_TRIANGULATE: { + ct.Execute(clip_type, solution_closed, fill_rule); + } break; + } +} + +int Clipper::get_solution_count(SolutionType type) const { + + switch(type) { + + case TYPE_CLOSED: { + return solution_closed.size(); + } break; + + case TYPE_OPEN: { + return solution_open.size(); + } break; + } + return -1; +} + +Vector Clipper::get_solution(int idx, SolutionType type) { + + switch(type) { + + case TYPE_CLOSED: { + + ERR_EXPLAIN("Closed solution not found"); + ERR_FAIL_INDEX_V(idx, solution_closed.size(), Vector()); + + return _scale_down(solution_closed[idx], PRECISION); + } break; + + case TYPE_OPEN: { + + ERR_EXPLAIN("Open solution not found"); + ERR_FAIL_INDEX_V(idx, solution_open.size(), Vector()); + + return _scale_down(solution_open[idx], PRECISION); + } break; + } + return Vector(); +} + +Rect2 Clipper::get_bounds() { + + ERR_EXPLAIN("Cannot get bounds in MODE_OFFSET"); + ERR_FAIL_COND_V(mode == MODE_OFFSET, Rect2()); + + cl::Rect64 b(0,0,0,0); + + switch(mode) { + + case MODE_CLIP: { + b = cl.GetBounds(); + } break; + + case MODE_TRIANGULATE: { + b = ct.GetBounds(); + } break; + } + + cl::Point64 pos(b.left, b.top); + cl::Point64 size(b.right - b.left, b.bottom - b.top); + + Rect2 bounds( + static_cast(pos.x) / PRECISION, + static_cast(pos.y) / PRECISION, + static_cast(size.x) / PRECISION, + static_cast(size.y) / PRECISION + ); + return bounds; +} + +void Clipper::clear() { + + solution_closed.clear(); + solution_open.clear(); + + root.Clear(); + polypaths.clear(); + path_map.clear(); + + cl.Clear(); + co.Clear(); + ct.Clear(); +} + +Vector Clipper::get_hierarchy(int idx) { + + ERR_FAIL_INDEX_V(idx, polypaths.size(), Vector()); + + // Returns indices to parent and children of the selected solution + + Vector hierarchy; + cl::PolyPath* path = polypaths[idx]; + + // Parent + cl::PolyPath* parent = path->GetParent(); + hierarchy.push_back( path_map[parent] ); + + // Children + for(int c = 0; c < path->ChildCount(); ++c) { + + cl::PolyPath& child = path->GetChild(c); + hierarchy.push_back( path_map[&child] ); + } + return hierarchy; +} + +Vector Clipper::get_parent(int idx) { + + ERR_FAIL_INDEX_V(idx, polypaths.size(), Vector()); + + cl::PolyPath* path = polypaths[idx]; + cl::PolyPath* parent = path->GetParent(); + + return _scale_down(parent->GetPath(), PRECISION); +} + +Vector Clipper::get_child(int idx, int child_idx) { + + ERR_FAIL_INDEX_V(idx, polypaths.size(), Vector()); + ERR_FAIL_INDEX_V(child_idx, polypaths[idx]->ChildCount(), Vector()); + + cl::PolyPath* path = polypaths[idx]; + cl::PolyPath& child = path->GetChild(child_idx); + + return _scale_down(child.GetPath(), PRECISION); +} + +int Clipper::get_child_count(int idx) { + + ERR_FAIL_INDEX_V(idx, polypaths.size(), -1); + + cl::PolyPath* path = polypaths[idx]; + + return path->ChildCount(); +} + +Array Clipper::get_children(int idx) { + + ERR_FAIL_INDEX_V(idx, polypaths.size(), Array()); + + cl::PolyPath* path = polypaths[idx]; + + Array children; + + for(int c = 0; c < path->ChildCount(); ++c) { + + cl::PolyPath& child = path->GetChild(c); + children.push_back( _scale_down(child.GetPath(), PRECISION) ); + } + return children; +} + +bool Clipper::is_hole(int idx) { + + ERR_FAIL_INDEX_V(idx, polypaths.size(), false); + + cl::PolyPath* path = polypaths[idx]; + + return path->IsHole(); +} +//------------------------------------------------------------------------------ +void Clipper::_build_hierarchy(cl::PolyPath& p_root) { + + solution_closed.clear(); + polypaths.clear(); + + List to_visit; + to_visit.push_back(&p_root); + + for(int idx = -1; !to_visit.empty(); ++idx) { + + cl::PolyPath* parent = to_visit.back()->get(); + to_visit.pop_back(); + + for(int c = 0; c < parent->ChildCount(); ++c) { + + cl::PolyPath& child = parent->GetChild(c); + to_visit.push_back(&child); + } + // Ignore root (used as container only, has no boundary) + if(idx != -1) { + // Rely on order + solution_closed.push_back(parent->GetPath()); + polypaths.push_back(parent); + path_map[parent] = idx; + } + } +} + +void Clipper::set_mode(ClipMode p_mode, bool reuse_solution) { + + if(mode == p_mode) + return; + + mode = p_mode; + + if(reuse_solution) { + + // Transfer resulted solution from previous execution + switch(mode) { + + case MODE_CLIP: { + cl.AddPaths(solution_closed, path_type, false); + cl.AddPaths(solution_open, path_type, true); + } break; + + case MODE_OFFSET: { + co.AddPaths(solution_closed, join_type, end_type); + } break; + + case MODE_TRIANGULATE: { + ct.AddPaths(solution_closed, path_type, false); + } break; + } + } +} + +_FORCE_INLINE_ cl::Path Clipper::_scale_up(const Vector& points, real_t scale) { + + cl::Path path; + path.resize(points.size()); + + for(int i = 0; i != points.size(); ++i) { + path[i] = cl::Point64( + points[i].x * scale, + points[i].y * scale + ); + } + return path; +} + +_FORCE_INLINE_ Vector Clipper::_scale_down(const cl::Path& path, real_t scale) { + + Vector points; + points.resize(path.size()); + + for(int i = 0; i != path.size(); ++i) { + points.write[i] = Point2( + static_cast(path[i].x) / scale, + static_cast(path[i].y) / scale + ); + } + return points; +} + +void Clipper::_bind_methods() { + +//------------------------------------------------------------------------------ +// Clipper methods +//------------------------------------------------------------------------------ + + ClassDB::bind_method(D_METHOD("add_points", "points"), &Clipper::add_points); + ClassDB::bind_method(D_METHOD("execute", "build_hierarchy"), &Clipper::execute, DEFVAL(false)); + + ClassDB::bind_method(D_METHOD("get_solution_count", "type"), &Clipper::get_solution_count, DEFVAL(TYPE_CLOSED)); + ClassDB::bind_method(D_METHOD("get_solution", "index", "type"), &Clipper::get_solution, DEFVAL(TYPE_CLOSED)); + + ClassDB::bind_method(D_METHOD("get_bounds"), &Clipper::get_bounds); + ClassDB::bind_method(D_METHOD("clear"), &Clipper::clear); + + // Hierarchy + ClassDB::bind_method(D_METHOD("get_child_count", "idx"), &Clipper::get_child_count); + ClassDB::bind_method(D_METHOD("get_child", "idx", "child_idx"), &Clipper::get_child); + ClassDB::bind_method(D_METHOD("get_children", "idx"), &Clipper::get_children); + ClassDB::bind_method(D_METHOD("get_parent", "idx"), &Clipper::get_parent); + ClassDB::bind_method(D_METHOD("is_hole", "idx"), &Clipper::is_hole); + ClassDB::bind_method(D_METHOD("get_hierarchy", "idx"), &Clipper::get_hierarchy); + + ADD_PROPERTY(PropertyInfo(Variant::RECT2, "bounds"), "", "get_bounds"); + +//------------------------------------------------------------------------------ +// Configuration methods +//------------------------------------------------------------------------------ + ClassDB::bind_method(D_METHOD("set_mode", "mode", "reuse_solution"), &Clipper::set_mode, DEFVAL(true)); + ClassDB::bind_method(D_METHOD("get_mode"), &Clipper::get_mode); + + ClassDB::bind_method(D_METHOD("set_open", "is_open"), &Clipper::set_open); + ClassDB::bind_method(D_METHOD("is_open"), &Clipper::is_open); + + ClassDB::bind_method(D_METHOD("set_path_type", "path_type"), &Clipper::set_path_type); + ClassDB::bind_method(D_METHOD("get_path_type"), &Clipper::get_path_type); + + ClassDB::bind_method(D_METHOD("set_clip_type", "clip_type"), &Clipper::set_clip_type); + ClassDB::bind_method(D_METHOD("get_clip_type"), &Clipper::get_clip_type); + + ClassDB::bind_method(D_METHOD("set_fill_rule", "fill_rule"), &Clipper::set_fill_rule); + ClassDB::bind_method(D_METHOD("get_fill_rule"), &Clipper::get_fill_rule); + + ClassDB::bind_method(D_METHOD("set_join_type", "join_type"), &Clipper::set_join_type); + ClassDB::bind_method(D_METHOD("get_join_type"), &Clipper::get_join_type); + + ClassDB::bind_method(D_METHOD("set_end_type", "end_type"), &Clipper::set_end_type); + ClassDB::bind_method(D_METHOD("get_end_type"), &Clipper::get_clip_type); + + ClassDB::bind_method(D_METHOD("set_delta", "delta"), &Clipper::set_delta); + ClassDB::bind_method(D_METHOD("get_delta"), &Clipper::get_delta); + + ADD_PROPERTY(PropertyInfo(Variant::INT, "mode"), "", "get_mode"); + ADD_PROPERTY(PropertyInfo(Variant::BOOL, "open"), "set_open", "is_open"); + ADD_PROPERTY(PropertyInfo(Variant::INT, "path_type"), "set_path_type", "get_path_type"); + ADD_PROPERTY(PropertyInfo(Variant::INT, "clip_type"), "set_clip_type", "get_clip_type"); + ADD_PROPERTY(PropertyInfo(Variant::INT, "fill_rule"), "set_fill_rule", "get_fill_rule"); + ADD_PROPERTY(PropertyInfo(Variant::INT, "end_type"), "set_end_type", "get_end_type"); + ADD_PROPERTY(PropertyInfo(Variant::INT, "join_type"), "set_join_type", "get_join_type"); + ADD_PROPERTY(PropertyInfo(Variant::REAL, "delta"), "set_delta", "get_delta"); + +//------------------------------------------------------------------------------ +// Enums +//------------------------------------------------------------------------------ + using namespace clipperlib; + // Use namespace declaration to avoid having + // prepended namespace name in enum constants + BIND_ENUM_CONSTANT(MODE_CLIP); + BIND_ENUM_CONSTANT(MODE_OFFSET); + BIND_ENUM_CONSTANT(MODE_TRIANGULATE); + + BIND_ENUM_CONSTANT(TYPE_CLOSED); + BIND_ENUM_CONSTANT(TYPE_OPEN); + + BIND_ENUM_CONSTANT(ctNone); + BIND_ENUM_CONSTANT(ctIntersection); + BIND_ENUM_CONSTANT(ctUnion); + BIND_ENUM_CONSTANT(ctDifference); + BIND_ENUM_CONSTANT(ctXor); + + BIND_ENUM_CONSTANT(ptSubject); + BIND_ENUM_CONSTANT(ptClip); + + BIND_ENUM_CONSTANT(frEvenOdd); + BIND_ENUM_CONSTANT(frNonZero); + BIND_ENUM_CONSTANT(frPositive); + BIND_ENUM_CONSTANT(frNegative); + + BIND_ENUM_CONSTANT(kSquare); + BIND_ENUM_CONSTANT(kRound); + BIND_ENUM_CONSTANT(kMiter); + + BIND_ENUM_CONSTANT(kPolygon); + BIND_ENUM_CONSTANT(kOpenJoined); + BIND_ENUM_CONSTANT(kOpenButt); + BIND_ENUM_CONSTANT(kOpenSquare); + BIND_ENUM_CONSTANT(kOpenRound); +} diff --git a/modules/clipper/clipper.h b/modules/clipper/clipper.h new file mode 100644 index 000000000000..7db43abb85e2 --- /dev/null +++ b/modules/clipper/clipper.h @@ -0,0 +1,127 @@ +#ifndef GODOT_CLIPPER2_HPP +#define GODOT_CLIPPER2_HPP + +#include "core/reference.h" + +#include "lib/clipper.h" +#include "lib/clipper_offset.h" +#include "lib/clipper_triangulation.h" + +namespace cl = clipperlib; + +enum ClipMode { + MODE_CLIP, + MODE_OFFSET, + MODE_TRIANGULATE +}; + +enum SolutionType { + TYPE_CLOSED, + TYPE_OPEN +}; + +class Clipper : public Reference { + GDCLASS(Clipper, Reference); + +public: + Clipper(); + +//------------------------------------------------------------------------------ +// Clipping methods +//------------------------------------------------------------------------------ + + void add_points(const Vector& points); + void execute(bool build_hierarchy = false); + + int get_solution_count(SolutionType type = TYPE_CLOSED) const; + Vector get_solution(int idx, SolutionType type = TYPE_CLOSED); + + Rect2 get_bounds(); + void clear(); + + // Hierarchy + Vector get_hierarchy(int idx); + + Vector get_parent(int idx); + Vector get_child(int idx, int child_idx); + int get_child_count(int idx); + Array get_children(int idx); + + bool is_hole(int idx); + +//------------------------------------------------------------------------------ +// Configuration methods +//------------------------------------------------------------------------------ + + // Path and execute configuration, define these before adding new paths + // Each path added will have the same configuration as the previous one + // -------------------------------------------------------------------- + void set_mode(ClipMode p_mode, bool reuse_solution = true); + ClipMode get_mode() const { return mode; } + + void set_open(bool p_is_open) { open = p_is_open; } + bool is_open() const { return open; } + + void set_path_type(cl::PathType p_path_type) { path_type = p_path_type; } + cl::PathType get_path_type() const { return path_type; } + + void set_clip_type(cl::ClipType p_clip_type) { clip_type = p_clip_type; } + cl::ClipType get_clip_type() const { return clip_type; } + + void set_fill_rule(cl::FillRule p_fill_rule) { fill_rule = p_fill_rule; } + cl::FillRule get_fill_rule() const { return fill_rule; } + + // Only relevant in MODE_OFFSET + // ---------------------------- + void set_join_type(cl::JoinType p_join_type) { join_type = p_join_type; } + cl::JoinType get_join_type() const { return join_type; } + + void set_end_type(cl::EndType p_end_type) { end_type = p_end_type; } + cl::EndType get_end_type() const { return end_type; } + + void set_delta(real_t p_delta) { delta = p_delta; } + real_t get_delta() const { return delta; } + +//------------------------------------------------------------------------------ +protected: + static void _bind_methods(); + + cl::Path _scale_up(const Vector& points, real_t scale); + Vector _scale_down(const cl::Path& path, real_t scale); + + void _build_hierarchy(cl::PolyPath& p_root); + +private: + bool open; + cl::PathType path_type; + cl::ClipType clip_type; + cl::FillRule fill_rule; + cl::JoinType join_type; + cl::EndType end_type; + real_t delta; + + ClipMode mode; + + cl::Paths solution_closed; + cl::Paths solution_open; + + cl::PolyPath root; + Vector polypaths; + Map path_map; + + cl::Clipper cl; + cl::ClipperOffset co; + cl::ClipperTri ct; +}; + +VARIANT_ENUM_CAST(ClipMode); +VARIANT_ENUM_CAST(SolutionType); + +VARIANT_ENUM_CAST(cl::ClipType); +VARIANT_ENUM_CAST(cl::PathType); +VARIANT_ENUM_CAST(cl::FillRule); + +VARIANT_ENUM_CAST(cl::JoinType); +VARIANT_ENUM_CAST(cl::EndType); + +#endif diff --git a/modules/clipper/config.py b/modules/clipper/config.py new file mode 100644 index 000000000000..3475ca91bf29 --- /dev/null +++ b/modules/clipper/config.py @@ -0,0 +1,7 @@ +# config.py + +def can_build(env, platform): + return True + +def configure(env): + pass diff --git a/modules/clipper/lib/LICENSE.md b/modules/clipper/lib/LICENSE.md new file mode 100644 index 000000000000..5debeca16e3c --- /dev/null +++ b/modules/clipper/lib/LICENSE.md @@ -0,0 +1,27 @@ +The Clipper code library, the "Software" (that includes Delphi, C++ & C# +source code, accompanying samples and documentation), has been released +under the following license, terms and conditions: + +# Boost Software License - Version 1.0 - August 17th, 2003 + +Permission is hereby granted, free of charge, to any person or organization +obtaining a copy of the software and accompanying documentation covered by +this license (the "Software") to use, reproduce, display, distribute, +execute, and transmit the Software, and to prepare derivative works of the +Software, and to permit third-parties to whom the Software is furnished to +do so, all subject to the following: + +The copyright notices in the Software and this entire statement, including +the above license grant, this restriction and the following disclaimer, +must be included in all copies of the Software, in whole or in part, and +all derivative works of the Software, unless such copies or derivative +works are solely in the form of machine-executable object code generated by +a source language processor. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT +SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE +FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE, +ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER +DEALINGS IN THE SOFTWARE. \ No newline at end of file diff --git a/modules/clipper/lib/clipper.cpp b/modules/clipper/lib/clipper.cpp new file mode 100644 index 000000000000..00b283d347cb --- /dev/null +++ b/modules/clipper/lib/clipper.cpp @@ -0,0 +1,1920 @@ +/******************************************************************************* +* Author : Angus Johnson * +* Version : 10.0 (beta) * +* Date : 8 Noveber 2017 * +* Website : http://www.angusj.com * +* Copyright : Angus Johnson 2010-2017 * +* Purpose : Base clipping module * +* License : http://www.boost.org/LICENSE_1_0.txt * +*******************************************************************************/ + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include "clipper.h" + +#include + +namespace clipperlib { + + enum VertexFlags { vfNone = 0, vfOpenStart = 1, vfOpenEnd = 2, vfLocalMax = 4, vfLocMin = 8 }; + inline VertexFlags operator|(VertexFlags a, VertexFlags b) { + return static_cast(static_cast(a) | static_cast(b)); + } + inline VertexFlags& operator |=(VertexFlags& a, VertexFlags b) { return a = a | b; } + + struct Vertex { + Point64 pt; + Vertex *next; + Vertex *prev; + VertexFlags flags; + }; + + struct LocalMinima { + Vertex *vertex; + PathType polytype; + bool is_open; + }; + + struct Scanline { + int64_t y; + Scanline *next; + }; + + struct IntersectNode { + Point64 pt; + Active *edge1; + Active *edge2; + }; + + struct LocMinSorter { + inline bool operator()(const LocalMinima* locMin1, const LocalMinima* locMin2) { + return locMin2->vertex->pt.y < locMin1->vertex->pt.y; + } + }; + + //------------------------------------------------------------------------------ + // PolyPath methods ... + //------------------------------------------------------------------------------ + + void PolyPath::Clear() + { + for (size_t i = 0; i < childs_.size(); ++i) { + childs_[i]->Clear(); + delete childs_[i]; + } + childs_.resize(0); + } + //------------------------------------------------------------------------------ + + PolyPath::PolyPath() + { + parent_ = nullptr; + } + //------------------------------------------------------------------------------ + + PolyPath::PolyPath(PolyPath *parent, const Path &path) + { + parent_ = parent; + path_ = path; + } + //------------------------------------------------------------------------------ + + int PolyPath::ChildCount() const { return (int)childs_.size(); } + + //------------------------------------------------------------------------------ + + PolyPath& PolyPath::AddChild(const Path &path) + { + PolyPath* child = new PolyPath(this, path); + childs_.push_back(child); + return *child; + } + //------------------------------------------------------------------------------ + + PolyPath& PolyPath::GetChild(unsigned index) + { + if (index < 0 || index >= childs_.size()) + throw ClipperException("invalid range in PolyPath::GetChild."); + return *childs_[index]; + } + //------------------------------------------------------------------------------ + + PolyPath* PolyPath::GetParent() const { return parent_; } + + //------------------------------------------------------------------------------ + Path &PolyPath::GetPath() { return path_; } + + //------------------------------------------------------------------------------ + bool PolyPath::IsHole() const + { + bool result = true; + PolyPath* pp = parent_; + while (pp) { + result = !result; + pp = pp->parent_; + } + return result; + } + + //------------------------------------------------------------------------------ + // miscellaneous functions ... + //------------------------------------------------------------------------------ + + inline int64_t Round(double val) + { + if ((val < 0)) return static_cast(val - 0.5); + else return static_cast(val + 0.5); + } + //------------------------------------------------------------------------------ + + inline double Abs(double val) { return val < 0 ? -val : val; } + //------------------------------------------------------------------------------ + + inline int Abs(int val) { return val < 0 ? -val : val; } + //------------------------------------------------------------------------------ + + inline bool IsOdd(int val) { return val & 1 ? true : false; } + //------------------------------------------------------------------------------ + + inline bool IsHotEdge(const Active &e) { return (e.outrec); } + //------------------------------------------------------------------------------ + + inline bool IsOpen(const Active &e) { return (e.local_min->is_open); } + //------------------------------------------------------------------------------ + + inline bool IsStartSide(const Active &e) { return (&e == e.outrec->start_e); } + //------------------------------------------------------------------------------ + + inline void SwapSides(OutRec &outrec) + { + Active *e2 = outrec.start_e; + outrec.start_e = outrec.end_e; + outrec.end_e = e2; + outrec.pts = outrec.pts->next; + } + //------------------------------------------------------------------------------ + + bool FixOrientation(Active &e) + { + bool result = true; + Active* e2 = &e; + while (e2->prev_in_ael) { + e2 = e2->prev_in_ael; + if (e2->outrec && !IsOpen(*e2)) result = !result; + } + if (result != IsStartSide(e)) { + if (result) e.outrec->flag = orOuter; + else e.outrec->flag = orInner; + SwapSides(*e.outrec); + return true; //all fixed + } + else return false; //no fix needed + } + //------------------------------------------------------------------------------ + + inline bool IsHorizontal(const Active &e) { return (e.dx == CLIPPER_HORIZONTAL); } + //------------------------------------------------------------------------------ + + inline int64_t TopX(const Active &edge, const int64_t currentY) + { + return (currentY == edge.top.y) ? + edge.top.x : + edge.bot.x + Round(edge.dx *(currentY - edge.bot.y)); + } + //------------------------------------------------------------------------------ + + inline int64_t GetTopDeltaX(const Active &e1, const Active &e2) + { + return (e1.top.y > e2.top.y) ? + TopX(e2, e1.top.y) - e1.top.x : + e2.top.x - TopX(e1, e2.top.y); + } + //---------------------------------------------------------------------------- + + inline void SwapActives(Active *&e1, Active *&e2) { + Active *e = e1; e1 = e2; e2 = e; + } + //---------------------------------------------------------------------- + + inline void MoveEdgeToFollowLeftInAEL(Active &e, Active &eLeft) + { + Active *aelPrev, *aelNext; + //extract first ... + aelPrev = e.prev_in_ael; + aelNext = e.next_in_ael; + aelPrev->next_in_ael = aelNext; + if (aelNext) aelNext->prev_in_ael = aelPrev; + //now reinsert ... + e.next_in_ael = eLeft.next_in_ael; + eLeft.next_in_ael->prev_in_ael = &e; + e.prev_in_ael = &eLeft; + eLeft.next_in_ael = &e; + } + //---------------------------------------------------------------------------- + + inline bool E2InsertsBeforeE1(const Active &e1, const Active &e2, bool prefer_left) + { + if (prefer_left) { + return e2.curr.x == e1.curr.x ? + GetTopDeltaX(e1, e2) < 0 : e2.curr.x < e1.curr.x; + } + else + return e2.curr.x == e1.curr.x ? + GetTopDeltaX(e1, e2) <= 0 : e2.curr.x <= e1.curr.x; + } + //------------------------------------------------------------------------------ + + inline PathType GetPolyType(const Active &e) { return e.local_min->polytype; } + //------------------------------------------------------------------------------ + + inline bool IsSamePolyType(const Active &e1, const Active &e2) + { + return e1.local_min->polytype == e2.local_min->polytype; + } + //------------------------------------------------------------------------------ + + Point64 GetIntersectPoint(const Active &e1, const Active &e2) + { + double b1, b2; + if (e1.dx == e2.dx) return Point64(TopX(e1, e1.curr.y), e1.curr.y); + + if (e1.dx == 0) { + if (IsHorizontal(e2)) return Point64(e1.bot.x, e2.bot.y); + b2 = e2.bot.y - (e2.bot.x / e2.dx); + return Point64(e1.bot.x, Round(e1.bot.x / e2.dx + b2)); + } + else if (e2.dx == 0) { + if (IsHorizontal(e1)) return Point64(e2.bot.x, e1.bot.y); + b1 = e1.bot.y - (e1.bot.x / e1.dx); + return Point64(e2.bot.x, Round(e2.bot.x / e1.dx + b1)); + } + else { + b1 = e1.bot.x - e1.bot.y * e1.dx; + b2 = e2.bot.x - e2.bot.y * e2.dx; + double q = (b2 - b1) / (e1.dx - e2.dx); + return (std::fabs(e1.dx) < std::fabs(e2.dx)) ? + Point64(Round(e1.dx * q + b1), Round(q)) : + Point64(Round(e2.dx * q + b2), Round(q)); + } + } + //------------------------------------------------------------------------------ + + inline void SetDx(Active &e) + { + int64_t dy = (e.top.y - e.bot.y); + e.dx = (dy == 0) ? CLIPPER_HORIZONTAL : (double)(e.top.x - e.bot.x) / dy; + } + //--------------------------------------------------------------------------- + + inline Vertex& NextVertex(Active &e) + { + return (e.wind_dx > 0 ? *e.vertex_top->next : *e.vertex_top->prev); + } + //------------------------------------------------------------------------------ + + inline bool IsMaxima(const Active &e) + { + return (e.vertex_top->flags & vfLocalMax); + } + //------------------------------------------------------------------------------ + + void TerminateHotOpen(Active &e) { + if (e.outrec->start_e == &e) + e.outrec->start_e = NULL; + else + e.outrec->end_e = NULL; + e.outrec = NULL; + } + //------------------------------------------------------------------------------ + + Active *GetMaximaPair(const Active &e) + { + Active *e2; + if (IsHorizontal(e)) { + //we can't be sure whether the MaximaPair is on the left or right, so ... + e2 = e.prev_in_ael; + while (e2 && e2->curr.x >= e.top.x) { + if (e2->vertex_top == e.vertex_top) return e2; //Found! + e2 = e2->prev_in_ael; + } + e2 = e.next_in_ael; + while (e2 && (TopX(*e2, e.top.y) <= e.top.x)) { + if (e2->vertex_top == e.vertex_top) return e2; //Found! + e2 = e2->next_in_ael; + } + return NULL; + } + else { + e2 = e.next_in_ael; + while (e2) { + if (e2->vertex_top == e.vertex_top) return e2; //Found! + e2 = e2->next_in_ael; + } + return NULL; + } + } + //------------------------------------------------------------------------------ + + inline int PointCount(OutPt *op) + { + if (!op) return 0; + OutPt *p = op; + int cnt = 0; + do { + cnt++; + p = p->next; + } while (p != op); + return cnt; + } + //------------------------------------------------------------------------------ + + inline void DisposeOutPts(OutPt *&op) + { + if (!op) return; + op->prev->next = NULL; + while (op) { + OutPt *tmpPp = op; + op = op->next; + delete tmpPp; + } + } + //------------------------------------------------------------------------------ + + bool IntersectListSort(IntersectNode *node1, IntersectNode *node2) + { + return (node2->pt.y < node1->pt.y); + } + //------------------------------------------------------------------------------ + + inline void SetOrientation(OutRec &outrec, Active &e1, Active &e2) + { + outrec.start_e = &e1; + outrec.end_e = &e2; + e1.outrec = &outrec; + e2.outrec = &outrec; + } + //------------------------------------------------------------------------------ + + void SwapOutrecs(Active &e1, Active &e2) + { + OutRec *or1 = e1.outrec; + OutRec *or2 = e2.outrec; + if (or1 == or2) { + Active *e = or1->start_e; + or1->start_e = or1->end_e; + or1->end_e = e; + return; + } + if (or1) { + if (&e1 == or1->start_e) or1->start_e = &e2; + else or1->end_e = &e2; + } + if (or2) { + if (&e2 == or2->start_e) or2->start_e = &e1; + else or2->end_e = &e1; + } + e1.outrec = or2; + e2.outrec = or1; + } + //------------------------------------------------------------------------------ + + inline bool EdgesAdjacentInSel(const IntersectNode &inode) + { + return (inode.edge1->next_in_sel == inode.edge2) || (inode.edge1->prev_in_sel == inode.edge2); + } + + //------------------------------------------------------------------------------ + // Clipper class methods ... + //------------------------------------------------------------------------------ + + Clipper::Clipper() + { + Clear(); + } + //--------------------------- --------------------------------------------------- + + Clipper::~Clipper() + { + Clear(); + } + //------------------------------------------------------------------------------ + + void Clipper::CleanUp() + { + while (actives_) DeleteFromAEL(*actives_); + scanline_list_ = ScanlineList(); //resets priority_queue + DisposeAllOutRecs(); + } + //------------------------------------------------------------------------------ + + void Clipper::Clear() + { + DisposeVerticesAndLocalMinima(); + curr_loc_min_ = minima_list_.begin(); + minima_list_sorted_ = false; + has_open_paths_ = false; + } + //------------------------------------------------------------------------------ + + void Clipper::Reset() + { + if (!minima_list_sorted_) { + std::sort(minima_list_.begin(), minima_list_.end(), LocMinSorter()); + minima_list_sorted_ = true; + } + for (MinimaList::const_iterator i = minima_list_.begin(); i != minima_list_.end(); ++i) + InsertScanline((*i)->vertex->pt.y); + curr_loc_min_ = minima_list_.begin(); + + actives_ = NULL; + sel_ = NULL; + } + //------------------------------------------------------------------------------ + + inline void Clipper::InsertScanline(int64_t y) { scanline_list_.push(y); } + //------------------------------------------------------------------------------ + + bool Clipper::PopScanline(int64_t &y) + { + if (scanline_list_.empty()) return false; + y = scanline_list_.top(); + scanline_list_.pop(); + while (!scanline_list_.empty() && y == scanline_list_.top()) + scanline_list_.pop(); // Pop duplicates. + return true; + } + //------------------------------------------------------------------------------ + + bool Clipper::PopLocalMinima(int64_t y, LocalMinima *&local_minima) + { + if (curr_loc_min_ == minima_list_.end() || (*curr_loc_min_)->vertex->pt.y != y) return false; + local_minima = (*curr_loc_min_); + ++curr_loc_min_; + return true; + } + //------------------------------------------------------------------------------ + + void Clipper::DisposeAllOutRecs() + { + for (OutRecList::const_iterator i = outrec_list_.begin(); i != outrec_list_.end(); ++i) { + if ((*i)->pts) DisposeOutPts((*i)->pts); + delete (*i); + } + outrec_list_.resize(0); + } + //------------------------------------------------------------------------------ + + void Clipper::DisposeVerticesAndLocalMinima() + { + for (MinimaList::iterator ml_iter = minima_list_.begin(); + ml_iter != minima_list_.end(); ++ml_iter) + delete (*ml_iter); + minima_list_.clear(); + VerticesList::iterator vl_iter; + for (vl_iter = vertex_list_.begin(); vl_iter != vertex_list_.end(); ++vl_iter) + delete[] (*vl_iter); + vertex_list_.clear(); + } + //------------------------------------------------------------------------------ + + void Clipper::AddLocMin(Vertex &vert, PathType polytype, bool is_open) + { + //make sure the vertex is added only once ... + if (vfLocMin & vert.flags) return; + vert.flags |= vfLocMin; + + LocalMinima *lm = new LocalMinima(); + lm->vertex = | + lm->polytype = polytype; + lm->is_open = is_open; + minima_list_.push_back(lm); + } + //---------------------------------------------------------------------------- + + void Clipper::AddPathToVertexList(const Path &path, PathType polytype, bool is_open) + { + int path_len = (int)path.size(); + while (path_len > 1 && (path[path_len - 1] == path[0])) --path_len; + if (path_len < 2) return; + + int i = 1; + bool p0_is_minima = false, p0_is_maxima = false, going_up; + //find the first non-horizontal segment in the path ... + while ((i < path_len) && (path[i].y == path[0].y)) ++i; + bool is_flat = (i == path_len); + if (is_flat) { + if (!is_open) return; //Ignore closed paths that have ZERO area. + going_up = false; //And this just stops a compiler warning. + } + else + { + going_up = path[i].y < path[0].y; //because I'm using an inverted Y-axis display + if (going_up) { + i = path_len - 1; + while (path[i].y == path[0].y) --i; + p0_is_minima = path[i].y < path[0].y; //p[0].y == a minima + } + else { + i = path_len - 1; + while (path[i].y == path[0].y) --i; + p0_is_maxima = path[i].y > path[0].y; //p[0].y == a maxima + } + } + + Vertex *vertices = new Vertex [path_len]; + vertex_list_.push_back(vertices); + + vertices[0].pt = path[0]; + vertices[0].flags = vfNone; + + if (is_open) { + vertices[0].flags |= vfOpenStart; + if (going_up) AddLocMin(vertices[0], polytype, is_open); + else vertices[0].flags |= vfLocalMax; + } + + //nb: polygon orientation is determined later (see InsertLocalMinimaIntoAEL). + i = 0; + for (int j = 1; j < path_len; ++j) { + if (path[j] == vertices[i].pt) continue; //ie skips duplicates + vertices[j].pt = path[j]; + vertices[j].flags = vfNone; + vertices[i].next = &vertices[j]; + vertices[j].prev = &vertices[i]; + if (path[j].y > path[i].y && going_up) { + vertices[i].flags |= vfLocalMax; + going_up = false; + } + else if (path[j].y < path[i].y && !going_up) { + going_up = true; + AddLocMin(vertices[i], polytype, is_open); + } + i = j; + } + //i: index of the last vertex in the path. + vertices[i].next = &vertices[0]; + vertices[0].prev = &vertices[i]; + + if (is_open) { + vertices[i].flags |= vfOpenEnd; + if (going_up) + vertices[i].flags |= vfLocalMax; + else AddLocMin(vertices[i], polytype, is_open); + } + else if (going_up) { + //going up so find local maxima ... + Vertex *v = &vertices[i]; + while (v->next->pt.y <= v->pt.y) v = v->next; + v->flags |= vfLocalMax; + if (p0_is_minima) AddLocMin(vertices[0], polytype, is_open); + } + else { + //going down so find local minima ... + Vertex *v = &vertices[i]; + while (v->next->pt.y >= v->pt.y) v = v->next; + AddLocMin(*v, polytype, is_open); + if (p0_is_maxima) + vertices[0].flags |= vfLocalMax; + } + } + //------------------------------------------------------------------------------ + + void Clipper::AddPath(const Path &path, PathType polytype, bool is_open) + { + if (is_open) { + if (polytype == ptClip) + throw ClipperException("AddPath: Only subject paths may be open."); + has_open_paths_ = true; + } + minima_list_sorted_ = false; + AddPathToVertexList(path, polytype, is_open); + } + //------------------------------------------------------------------------------ + + void Clipper::AddPaths(const Paths &paths, PathType polytype, bool is_open) + { + for (Paths::size_type i = 0; i < paths.size(); ++i) + AddPath(paths[i], polytype, is_open); + } + //------------------------------------------------------------------------------ + + bool Clipper::IsContributingClosed(const Active& e) const + { + switch (fillrule_) { + case frNonZero: + if (Abs(e.wind_cnt) != 1) return false; + break; + case frPositive: + if (e.wind_cnt != 1) return false; + break; + case frNegative: + if (e.wind_cnt != -1) return false; + break; + } + + switch (cliptype_) { + case ctIntersection: + switch (fillrule_) { + case frEvenOdd: + case frNonZero: return (e.wind_cnt2 != 0); + case frPositive: return (e.wind_cnt2 > 0); + case frNegative: return (e.wind_cnt2 < 0); + } + break; + case ctUnion: + switch (fillrule_) { + case frEvenOdd: + case frNonZero: return (e.wind_cnt2 == 0); + case frPositive: return (e.wind_cnt2 <= 0); + case frNegative: return (e.wind_cnt2 >= 0); + } + break; + case ctDifference: + if (GetPolyType(e) == ptSubject) + switch (fillrule_) { + case frEvenOdd: + case frNonZero: return (e.wind_cnt2 == 0); + case frPositive: return (e.wind_cnt2 <= 0); + case frNegative: return (e.wind_cnt2 >= 0); + } + else + switch (fillrule_) { + case frEvenOdd: + case frNonZero: return (e.wind_cnt2 != 0); + case frPositive: return (e.wind_cnt2 > 0); + case frNegative: return (e.wind_cnt2 < 0); + }; + break; + case ctXor: return true; //XOr is always contributing unless open + } + return false; //we should never get here + } + //------------------------------------------------------------------------------ + + inline bool Clipper::IsContributingOpen(const Active& e) const + { + switch (cliptype_) { + case ctIntersection: return (e.wind_cnt2 != 0); + case ctUnion: return (e.wind_cnt == 0 && e.wind_cnt2 == 0); + case ctDifference: return (e.wind_cnt2 == 0); + case ctXor: return (e.wind_cnt != 0) != (e.wind_cnt2 != 0); + } + return false; //stops compiler error + } + //------------------------------------------------------------------------------ + + void Clipper::SetWindingLeftEdgeClosed(Active &e) + { + //Wind counts generally refer to polygon regions not edges, so here an edge's + //WindCnt indicates the higher of the two wind counts of the regions touching + //the edge. (Note also that adjacent region wind counts only ever differ + //by one, and open paths have no meaningful wind directions or counts.) + + Active *e2 = e.prev_in_ael; + //find the nearest closed path edge of the same PolyType in AEL (heading left) + PathType pt = GetPolyType(e); + while (e2 && (GetPolyType(*e2) != pt || IsOpen(*e2))) e2 = e2->prev_in_ael; + + if (!e2) { + e.wind_cnt = e.wind_dx; + e2 = actives_; + } + else if (fillrule_ == frEvenOdd) { + e.wind_cnt = e.wind_dx; + e.wind_cnt2 = e2->wind_cnt2; + e2 = e2->next_in_ael; + } + else { + //NonZero, Positive, or Negative filling here ... + //if e's WindCnt is in the SAME direction as its WindDx, then e is either + //an outer left or a hole right boundary, so edge must be inside 'e'. + //(neither e.WindCnt nor e.WindDx should ever be 0) + if (e2->wind_cnt * e2->wind_dx < 0) { + //opposite directions so edge is outside 'e' ... + if (Abs(e2->wind_cnt) > 1) { + //outside prev poly but still inside another. + if (e2->wind_dx * e.wind_dx < 0) + //reversing direction so use the same WC + e.wind_cnt = e2->wind_cnt; + else + //otherwise keep 'reducing' the WC by 1 (ie towards 0) ... + e.wind_cnt = e2->wind_cnt + e.wind_dx; + } + else + //now outside all polys of same polytype so set own WC ... + e.wind_cnt = (IsOpen(e) ? 1 : e.wind_dx); + } + else { + //edge must be inside 'e' + if (e2->wind_dx * e.wind_dx < 0) + //reversing direction so use the same WC + e.wind_cnt = e2->wind_cnt; + else + //otherwise keep 'increasing' the WC by 1 (ie away from 0) ... + e.wind_cnt = e2->wind_cnt + e.wind_dx; + }; + e.wind_cnt2 = e2->wind_cnt2; + e2 = e2->next_in_ael; //ie get ready to calc WindCnt2 + } + + //update wind_cnt2 ... + if (fillrule_ == frEvenOdd) + while (e2 != &e) { + if (GetPolyType(*e2) != pt && !IsOpen(*e2)) + e.wind_cnt2 = (e.wind_cnt2 == 0 ? 1 : 0); + e2 = e2->next_in_ael; + } + else + while (e2 != &e) { + if (GetPolyType(*e2) != pt && !IsOpen(*e2)) + e.wind_cnt2 += e2->wind_dx; + e2 = e2->next_in_ael; + } + } + //------------------------------------------------------------------------------ + + void Clipper::SetWindingLeftEdgeOpen(Active &e) + { + Active *e2 = actives_; + if (fillrule_ == frEvenOdd) { + int cnt1 = 0, cnt2 = 0; + while (e2 != &e) { + if (GetPolyType(*e2) == ptClip) cnt2++; + else if (!IsOpen(*e2)) cnt1++; + e2 = e2->next_in_ael; + } + e.wind_cnt = (IsOdd(cnt1) ? 1 : 0); + e.wind_cnt2 = (IsOdd(cnt2) ? 1 : 0); + } + else { + while (e2 != &e) { + if (GetPolyType(*e2) == ptClip) e.wind_cnt2 += e2->wind_dx; + else if (!IsOpen(*e2)) e.wind_cnt += e2->wind_dx; + e2 = e2->next_in_ael; + } + } + } + //------------------------------------------------------------------------------ + + void Clipper::InsertEdgeIntoAEL(Active &e1, Active *e2) + { + if (!actives_) { + e1.prev_in_ael = NULL; + e1.next_in_ael = NULL; + actives_ = &e1; + return; + } + if (!e2) { + if (E2InsertsBeforeE1(*actives_, e1, false)) { + e1.prev_in_ael = NULL; + e1.next_in_ael = actives_; + actives_->prev_in_ael = &e1; + actives_ = &e1; + return; + } + e2 = actives_; + while (e2->next_in_ael && + E2InsertsBeforeE1(e1, *e2->next_in_ael, false)) + e2 = e2->next_in_ael; + } + else { + while (e2->next_in_ael && + E2InsertsBeforeE1(e1, *e2->next_in_ael, true)) + e2 = e2->next_in_ael; + } + e1.next_in_ael = e2->next_in_ael; + if (e2->next_in_ael) e2->next_in_ael->prev_in_ael = &e1; + e1.prev_in_ael = e2; + e2->next_in_ael = &e1; + } + //---------------------------------------------------------------------- + + void Clipper::InsertLocalMinimaIntoAEL(int64_t bot_y) + { + LocalMinima *local_minima; + Active *left_bound, *right_bound; + //Add any local minima at BotY ... + while (PopLocalMinima(bot_y, local_minima)) { + if ((local_minima->vertex->flags & vfOpenStart) > 0) { + left_bound = NULL; + } + else { + left_bound = new Active(); + left_bound->bot = local_minima->vertex->pt; + left_bound->curr = left_bound->bot; + left_bound->vertex_top = local_minima->vertex->prev; //ie descending + left_bound->top = left_bound->vertex_top->pt; + left_bound->wind_dx = -1; + left_bound->local_min = local_minima; + SetDx(*left_bound); + } + + if ((local_minima->vertex->flags & vfOpenEnd) > 0) { + right_bound = NULL; + } + else { + right_bound = new Active(); + right_bound->bot = local_minima->vertex->pt; + right_bound->curr = right_bound->bot; + right_bound->vertex_top = local_minima->vertex->next; //ie ascending + right_bound->top = right_bound->vertex_top->pt; + right_bound->wind_dx = 1; + right_bound->local_min = local_minima; + SetDx(*right_bound); + } + + //Currently LeftB is just the descending bound and RightB is the ascending. + //Now if the LeftB isn't on the left of RightB then we need swap them. + if (left_bound && right_bound) { + if (IsHorizontal(*left_bound)) { + if (left_bound->top.x > left_bound->bot.x) SwapActives(left_bound, right_bound); + } + else if (IsHorizontal(*right_bound)) { + if (right_bound->top.x < right_bound->bot.x) SwapActives(left_bound, right_bound); + } + else if (left_bound->dx < right_bound->dx) SwapActives(left_bound, right_bound); + } + else if (!left_bound) { + left_bound = right_bound; + right_bound = NULL; + } + + bool contributing; + InsertEdgeIntoAEL(*left_bound, NULL); //insert left edge + if (IsOpen(*left_bound)) { + SetWindingLeftEdgeOpen(*left_bound); + contributing = IsContributingOpen(*left_bound); + } + else { + SetWindingLeftEdgeClosed(*left_bound); + contributing = IsContributingClosed(*left_bound); + } + + if (right_bound != NULL) { + right_bound->wind_cnt = left_bound->wind_cnt; + right_bound->wind_cnt2 = left_bound->wind_cnt2; + InsertEdgeIntoAEL(*right_bound, left_bound); //insert right edge + if (contributing) + AddLocalMinPoly(*left_bound, *right_bound, left_bound->bot); + if (IsHorizontal(*right_bound)) PushHorz(*right_bound); + else InsertScanline(right_bound->top.y); + } + else if (contributing) + StartOpenPath(*left_bound, left_bound->bot); + + if (IsHorizontal(*left_bound)) PushHorz(*left_bound); + else InsertScanline(left_bound->top.y); + + if (right_bound && left_bound->next_in_ael != right_bound) { + //intersect edges that are between left and right bounds ... + Active *e = right_bound->next_in_ael; + MoveEdgeToFollowLeftInAEL(*right_bound, *left_bound); + while (right_bound->next_in_ael != e) { + //nb: For calculating winding counts etc, IntersectEdges() assumes + //that rightB will be to the right of e ABOVE the intersection ... + IntersectEdges(*right_bound, *right_bound->next_in_ael, right_bound->bot); + SwapPositionsInAEL(*right_bound, *right_bound->next_in_ael); + } //while + } //if + + } //while (PopLocalMinima()) + } + //------------------------------------------------------------------------------ + + inline void Clipper::PushHorz(Active &e) + { + e.next_in_sel = (sel_ ? sel_ : NULL); + sel_ = &e; + } + //------------------------------------------------------------------------------ + + inline bool Clipper::PopHorz(Active *&e) + { + e = sel_; + if (!e) return false; + sel_ = sel_->next_in_sel; + return true; + } + //------------------------------------------------------------------------------ + + OutRec* Clipper::GetOwner(const Active *e) + { + if (IsHorizontal(*e) && e->top.x < e->bot.x) { + e = e->next_in_ael; + while (e && (!IsHotEdge(*e) || IsOpen(*e))) + e = e->next_in_ael; + if (!e) return NULL; + return ((e->outrec->flag == orOuter) == (e->outrec->start_e == e)) ? + e->outrec->owner : e->outrec; + } + else { + e = e->prev_in_ael; + while (e && (!IsHotEdge(*e) || IsOpen(*e))) + e = e->prev_in_ael; + if (!e) return NULL; + return ((e->outrec->flag == orOuter) == (e->outrec->end_e == e)) ? + e->outrec->owner : e->outrec; + } + } + //------------------------------------------------------------------------------ + + void Clipper::AddLocalMinPoly(Active &e1, Active &e2, const Point64 pt) + { + OutRec *outrec = CreateOutRec(); + outrec->idx = (unsigned)outrec_list_.size(); + outrec_list_.push_back(outrec); + outrec->owner = GetOwner(&e1); + outrec->polypath = NULL; + + if (IsOpen(e1)) + outrec->flag = orOpen; + else if (!outrec->owner || outrec->owner->flag == orInner) + outrec->flag = orOuter; + else + outrec->flag = orInner; + + //now set orientation ... + bool swap_sides_needed = false; + if (IsHorizontal(e1)) { + if (e1.top.x > e1.bot.x) swap_sides_needed = true; + } + else if (IsHorizontal(e2)) { + if (e2.top.x < e2.bot.x) swap_sides_needed = true; + } + else if (e1.dx < e2.dx) swap_sides_needed = true; + if ((outrec->flag == orOuter) != swap_sides_needed) + SetOrientation(*outrec, e1, e2); + else + SetOrientation(*outrec, e2, e1); + + OutPt *op = CreateOutPt(); + op->pt = pt; + op->next = op; + op->prev = op; + outrec->pts = op; + } + //------------------------------------------------------------------------------ + + void Clipper::AddLocalMaxPoly(Active &e1, Active &e2, const Point64 pt) + { + if (!IsHotEdge(e2)) + throw new ClipperException("Error in AddLocalMaxPoly()."); + AddOutPt(e1, pt); + if (e1.outrec == e2.outrec) { + e1.outrec->start_e = NULL; + e1.outrec->end_e = NULL; + e1.outrec = NULL; + e2.outrec = NULL; + } + //and to preserve the winding orientation of outrec ... + else if (e1.outrec->idx < e2.outrec->idx) + JoinOutrecPaths(e1, e2); else + JoinOutrecPaths(e2, e1); + } + //------------------------------------------------------------------------------ + + void Clipper::JoinOutrecPaths(Active &e1, Active &e2) + { + + if (IsStartSide(e1) == IsStartSide(e2)) { + //one or other edge orientation is wrong... + if (IsOpen(e1)) SwapSides(*e2.outrec); + else if (!FixOrientation(e1) && !FixOrientation(e2)) + throw new ClipperException("Error in JoinOutrecPaths()"); + if (e1.outrec->owner == e2.outrec) e1.outrec->owner = e2.outrec->owner; + } + + //join E2 outrec path onto E1 outrec path and then delete E2 outrec path + //pointers. (nb: Only very rarely do the joining ends share the same coords.) + OutPt *p1_st = e1.outrec->pts; + OutPt *p2_st = e2.outrec->pts; + OutPt *p1_end = p1_st->next; + OutPt *p2_end = p2_st->next; + if (IsStartSide(e1)) { + p2_end->prev = p1_st; + p1_st->next = p2_end; + p2_st->next = p1_end; + p1_end->prev = p2_st; + e1.outrec->pts = p2_st; + e1.outrec->start_e = e2.outrec->start_e; + if (e1.outrec->start_e) //ie closed path + e1.outrec->start_e->outrec = e1.outrec; + } + else { + p1_end->prev = p2_st; + p2_st->next = p1_end; + p1_st->next = p2_end; + p2_end->prev = p1_st; + e1.outrec->end_e = e2.outrec->end_e; + if (e1.outrec->end_e) //ie closed path + e1.outrec->end_e->outrec = e1.outrec; + } + + //after joining, the E2.OutRec contains not vertices ... + e2.outrec->start_e = NULL; + e2.outrec->end_e = NULL; + e2.outrec->pts = NULL; + e2.outrec->owner = e1.outrec; //this may be redundant + + //and e1 and e2 are maxima and are about to be dropped from the Actives list. + e1.outrec = NULL; + e2.outrec = NULL; + } + //------------------------------------------------------------------------------ + + inline void Clipper::TerminateHotOpen(Active &e) + { + if (e.outrec->start_e == &e) e.outrec->start_e = NULL; + else e.outrec->end_e = NULL; + e.outrec = NULL; + } + //------------------------------------------------------------------------------ + + OutPt* Clipper::CreateOutPt() + { + //this is a virtual method as descendant classes may need + //to produce descendant classes of OutPt ... + return new OutPt(); + } + //------------------------------------------------------------------------------ + + OutRec* Clipper::CreateOutRec() + { + //this is a virtual method as descendant classes may need + //to produce descendant classes of OutRec ... + return new OutRec(); + } + //------------------------------------------------------------------------------ + + OutPt* Clipper::AddOutPt(Active &e, const Point64 pt) + { + //Outrec.pts[0]: a circular double-linked-list of POutPt. + bool to_start = IsStartSide(e); + OutPt *start_op = e.outrec->pts; + OutPt *end_op = start_op->next; + if (to_start) { + if (pt == start_op->pt) return start_op; + } + else if (pt == end_op->pt) return end_op; + + OutPt *new_op = CreateOutPt(); + new_op->pt = pt; + end_op->prev = new_op; + new_op->prev = start_op; + new_op->next = end_op; + start_op->next = new_op; + if (to_start) e.outrec->pts = new_op; + return new_op; + } + //------------------------------------------------------------------------------ + + void Clipper::StartOpenPath(Active &e, const Point64 pt) + { + OutRec *outrec = CreateOutRec(); + outrec->idx = (unsigned)outrec_list_.size(); + outrec_list_.push_back(outrec); + outrec->flag = orOpen; + outrec->owner = NULL; + outrec->polypath = NULL; + outrec->end_e = NULL; + outrec->start_e = NULL; + e.outrec = outrec; + + OutPt *op = CreateOutPt(); + op->pt = pt; + op->next = op; + op->prev = op; + outrec->pts = op; + } + //------------------------------------------------------------------------------ + + inline void Clipper::UpdateEdgeIntoAEL(Active *e) + { + e->bot = e->top; + e->vertex_top = &NextVertex(*e); + e->top = e->vertex_top->pt; + e->curr = e->bot; + SetDx(*e); + if (!IsHorizontal(*e)) InsertScanline(e->top.y); + } + //------------------------------------------------------------------------------ + + void Clipper::IntersectEdges(Active &e1, Active &e2, const Point64 pt) + { + e1.curr = pt; + e2.curr = pt; + + //if either edge is an OPEN path ... + if (has_open_paths_ && (IsOpen(e1) || IsOpen(e2))) { + if (IsOpen(e1) && IsOpen(e2)) return; //ignore lines that intersect + Active *edge_o, *edge_c; + if (IsOpen(e1)) { edge_o = &e1; edge_c = &e2; } + else { edge_o = &e2; edge_c = &e1; } + + switch (cliptype_) { + case ctIntersection: + case ctDifference: + if (IsSamePolyType(*edge_o, *edge_c) || (Abs(edge_c->wind_cnt) != 1)) return; + break; + case ctUnion: + if (IsHotEdge(*edge_o) != ((Abs(edge_c->wind_cnt) != 1) || + (IsHotEdge(*edge_o) != (edge_c->wind_cnt != 0)))) return; //just works! + break; + case ctXor: + if (Abs(edge_c->wind_cnt) != 1) return; + break; + } + //toggle contribution ... + if (IsHotEdge(*edge_o)) { + AddOutPt(*edge_o, pt); + TerminateHotOpen(*edge_o); + } + else StartOpenPath(*edge_o, pt); + return; + } + + //update winding counts... + //assumes that e1 will be to the right of e2 ABOVE the intersection + int old_e1_windcnt, old_e2_windcnt; + if (e1.local_min->polytype == e2.local_min->polytype) { + if (fillrule_ == frEvenOdd) { + old_e1_windcnt = e1.wind_cnt; + e1.wind_cnt = e2.wind_cnt; + e2.wind_cnt = old_e1_windcnt; + } + else { + if (e1.wind_cnt + e2.wind_dx == 0) e1.wind_cnt = -e1.wind_cnt; + else e1.wind_cnt += e2.wind_dx; + if (e2.wind_cnt - e1.wind_dx == 0) e2.wind_cnt = -e2.wind_cnt; + else e2.wind_cnt -= e1.wind_dx; + } + } + else { + if (fillrule_ != frEvenOdd) e1.wind_cnt2 += e2.wind_dx; + else e1.wind_cnt2 = (e1.wind_cnt2 == 0 ? 1 : 0); + if (fillrule_ != frEvenOdd) e2.wind_cnt2 -= e1.wind_dx; + else e2.wind_cnt2 = (e2.wind_cnt2 == 0 ? 1 : 0); + } + + switch (fillrule_) { + case frPositive: + old_e1_windcnt = e1.wind_cnt; + old_e2_windcnt = e2.wind_cnt; + break; + case frNegative: + old_e1_windcnt = -e1.wind_cnt; + old_e2_windcnt = -e2.wind_cnt; + break; + default: + old_e1_windcnt = Abs(e1.wind_cnt); + old_e2_windcnt = Abs(e2.wind_cnt); + break; + } + + if (IsHotEdge(e1) && IsHotEdge(e2)) { + if ((old_e1_windcnt != 0 && old_e1_windcnt != 1) || (old_e2_windcnt != 0 && old_e2_windcnt != 1) || + (e1.local_min->polytype != e2.local_min->polytype && cliptype_ != ctXor)) + { + AddLocalMaxPoly(e1, e2, pt); + } + else if (IsStartSide(e1)) { + AddLocalMaxPoly(e1, e2, pt); + AddLocalMinPoly(e1, e2, pt); + } + else { + AddOutPt(e1, pt); + AddOutPt(e2, pt); + SwapOutrecs(e1, e2); + } + } + else if (IsHotEdge(e1)) { + if (old_e2_windcnt == 0 || old_e2_windcnt == 1) { + AddOutPt(e1, pt); + SwapOutrecs(e1, e2); + } + } + else if (IsHotEdge(e2)) { + if (old_e1_windcnt == 0 || old_e1_windcnt == 1) { + AddOutPt(e2, pt); + SwapOutrecs(e1, e2); + } + } + else if ((old_e1_windcnt == 0 || old_e1_windcnt == 1) && + (old_e2_windcnt == 0 || old_e2_windcnt == 1)) + { + //neither edge is currently contributing ... + int64_t e1Wc2, e2Wc2; + switch (fillrule_) { + case frPositive: + e1Wc2 = e1.wind_cnt2; + e2Wc2 = e2.wind_cnt2; + break; + case frNegative: + e1Wc2 = -e1.wind_cnt2; + e2Wc2 = -e2.wind_cnt2; + break; + default: + e1Wc2 = Abs(e1.wind_cnt2); + e2Wc2 = Abs(e2.wind_cnt2); + break; + } + + if (!IsSamePolyType(e1, e2)) { + AddLocalMinPoly(e1, e2, pt); + } + else if (old_e1_windcnt == 1 && old_e2_windcnt == 1) + switch (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 (((GetPolyType(e1) == ptClip) && (e1Wc2 > 0) && (e2Wc2 > 0)) || + ((GetPolyType(e1) == ptSubject) && (e1Wc2 <= 0) && (e2Wc2 <= 0))) + AddLocalMinPoly(e1, e2, pt); + break; + case ctXor: + AddLocalMinPoly(e1, e2, pt); + break; + } + } + } + //------------------------------------------------------------------------------ + + inline void Clipper::DeleteFromAEL(Active &e) + { + Active* prev = e.prev_in_ael; + Active* next = e.next_in_ael; + if (!prev && !next && (&e != actives_)) return; //already deleted + if (prev) prev->next_in_ael = next; + else actives_ = next; + if (next) next->prev_in_ael = prev; + delete &e; + } + //------------------------------------------------------------------------------ + + inline void Clipper::CopyAELToSEL() + { + Active* e = actives_; + sel_ = e; + while (e) { + e->prev_in_sel = e->prev_in_ael; + e->next_in_sel = e->next_in_ael; + e = e->next_in_ael; + } + } + //------------------------------------------------------------------------------ + + inline void Clipper::CopyActivesToSELAdjustCurrX(const int64_t top_y) + { + Active* e = actives_; + sel_ = e; + while (e) { + e->prev_in_sel = e->prev_in_ael; + e->next_in_sel = e->next_in_ael; + e->curr.x = TopX(*e, top_y); + e = e->next_in_ael; + } + } + //------------------------------------------------------------------------------ + + bool Clipper::ExecuteInternal(ClipType ct, FillRule ft) + { + if (ct == ctNone) return true; + fillrule_ = ft; + cliptype_ = ct; + Reset(); + + int64_t y; + if (!PopScanline(y)) { return false; } + for (;;) { + InsertLocalMinimaIntoAEL(y); + Active *e; + while (PopHorz(e)) ProcessHorizontal(*e); + if (!PopScanline(y)) break; //Y is now at the top of the scanbeam + ProcessIntersections(y); + DoTopOfScanbeam(y); + } + return true; + } + //------------------------------------------------------------------------------ + + bool Clipper::Execute(ClipType clipType, Paths &solution_closed, FillRule ft) + { + solution_closed.clear(); + if (!ExecuteInternal(clipType, ft)) return false; + BuildResult(solution_closed, NULL); + CleanUp(); + return true; + } + //------------------------------------------------------------------------------ + + bool Clipper::Execute(ClipType clipType, Paths &solution_closed, Paths &solution_open, FillRule ft) + { + solution_closed.clear(); + solution_open.clear(); + if (!ExecuteInternal(clipType, ft)) return false; + BuildResult(solution_closed, &solution_open); + CleanUp(); + return true; + } + //------------------------------------------------------------------------------ + + bool Clipper::Execute(ClipType clipType, PolyPath &solution_closed, Paths &solution_open, FillRule ft) + { + solution_closed.Clear(); + if (!ExecuteInternal(clipType, ft)) return false; + BuildResult2(solution_closed, NULL); + CleanUp(); + return true; + } + //------------------------------------------------------------------------------ + + void Clipper::ProcessIntersections(const int64_t top_y) + { + BuildIntersectList(top_y); + if (intersect_list_.size() == 0) return; + FixupIntersectionOrder(); + ProcessIntersectList(); + } + //------------------------------------------------------------------------------ + + inline void Clipper::DisposeIntersectNodes() + { + for (IntersectList::iterator node_iter = intersect_list_.begin(); + node_iter != intersect_list_.end(); ++node_iter) + delete (*node_iter); + intersect_list_.resize(0); + } + //------------------------------------------------------------------------------ + + void Clipper::InsertNewIntersectNode(Active &e1, Active &e2, int64_t top_y) + { + Point64 pt = GetIntersectPoint(e1, e2); + + //Rounding errors can occasionally place the calculated intersection + //point either below or above the scanbeam, so check and correct ... + if (pt.y > e1.curr.y) { + pt.y = e1.curr.y; //e.curr.y is still the bottom of scanbeam + //use the more vertical of the 2 edges to derive pt.X ... + if (Abs(e1.dx) < Abs(e2.dx)) pt.x = TopX(e1, pt.y); + else pt.x = TopX(e2, pt.y); + } + else if (pt.y < top_y) { + pt.y = top_y; //top_y is at the top of the scanbeam + + if (e1.top.y == top_y) pt.x = e1.top.x; + else if (e2.top.y == top_y) pt.x = e2.top.x; + else if (Abs(e1.dx) < Abs(e2.dx)) pt.x = e1.curr.x; + else pt.x = e2.curr.x; + } + + IntersectNode *node = new IntersectNode(); + node->edge1 = &e1; + node->edge2 = &e2; + node->pt = pt; + intersect_list_.push_back(node); + } + //------------------------------------------------------------------------------ + + void Clipper::BuildIntersectList(const int64_t top_y) + { + if (!actives_ || !actives_->next_in_ael) return; + CopyActivesToSELAdjustCurrX(top_y); + + //Merge sort actives_ into their new positions at the top of scanbeam, and + //create an intersection node every time an edge crosses over another ... + //see also https://stackoverflow.com/a/46319131/359538 + int mul = 1; + while (true) { + + Active *first = sel_, *second = NULL, *baseE, *prev_base = NULL, *tmp; + //sort successive larger 'mul' count of nodes ... + while (first) { + if (mul == 1) { + second = first->next_in_sel; + if (!second) { + first->merge_jump = NULL; + break; + } + first->merge_jump = second->next_in_sel; + } + else { + second = first->merge_jump; + if (!second) { + first->merge_jump = NULL; + break; + } + first->merge_jump = second->merge_jump; + } + + //now sort first and second groups ... + baseE = first; + int lCnt = mul, rCnt = mul; + while (lCnt > 0 && rCnt > 0) { + if (second->curr.x < first->curr.x) { + // create one or more Intersect nodes /////////// + tmp = second->prev_in_sel; + for (int i = 0; i < lCnt; ++i) { + //create a new intersect node... + InsertNewIntersectNode(*tmp, *second, top_y); + tmp = tmp->prev_in_sel; + } + ///////////////////////////////////////////////// + + if (first == baseE) { + if (prev_base) prev_base->merge_jump = second; + baseE = second; + baseE->merge_jump = first->merge_jump; + if (!first->prev_in_sel) sel_ = second; + } + tmp = second->next_in_sel; + //now move the out of place edge to it's new position in SEL ... + Insert2Before1InSel(*first, *second); + second = tmp; + if (!second) break; + --rCnt; + } + else { + first = first->next_in_sel; + --lCnt; + } + } + first = baseE->merge_jump; + prev_base = baseE; + } + if (!sel_->merge_jump) break; + else mul <<= 1; + } + } + //------------------------------------------------------------------------------ + + bool Clipper::ProcessIntersectList() + { + for (IntersectList::iterator node_iter = intersect_list_.begin(); + node_iter != intersect_list_.end(); ++node_iter) { + IntersectNode *iNode = *node_iter; + IntersectEdges(*iNode->edge1, *iNode->edge2, iNode->pt); + SwapPositionsInAEL(*iNode->edge1, *iNode->edge2); + } + DisposeIntersectNodes(); + return true; + } + //------------------------------------------------------------------------------ + + void Clipper::FixupIntersectionOrder() + { + size_t cnt = intersect_list_.size(); + if (cnt < 2) return; + //It's important that edge intersections are processed from the bottom up, + //but it's also crucial that intersections only occur between adjacent edges. + //The first sort here (a quicksort), arranges intersections relative to their + //vertical positions within the scanbeam ... + std::sort(intersect_list_.begin(), intersect_list_.end(), IntersectListSort); + + //Now we simulate processing these intersections, and as we do, we make sure + //that the intersecting edges remain adjacent. If they aren't, this simulated + //intersection is delayed until such time as these edges do become adjacent. + CopyAELToSEL(); + for (size_t i = 0; i < cnt; ++i) { + if (!EdgesAdjacentInSel(*intersect_list_[i])) { + size_t j = i + 1; + while (!EdgesAdjacentInSel(*intersect_list_[j])) j++; + std::swap(intersect_list_[i], intersect_list_[j]); + } + SwapPositionsInSEL(*intersect_list_[i]->edge1, *intersect_list_[i]->edge2); + } + } + //------------------------------------------------------------------------------ + + void Clipper::SwapPositionsInAEL(Active &e1, Active &e2) + { + //check that one or other edge hasn't already been removed from AEL ... + if (e1.next_in_ael == e1.prev_in_ael || + e2.next_in_ael == e2.prev_in_ael) return; + + Active *next, *prev; + if (e1.next_in_ael == &e2) { + next = e2.next_in_ael; + if (next) next->prev_in_ael = &e1; + prev = e1.prev_in_ael; + if (prev) prev->next_in_ael = &e2; + e2.prev_in_ael = prev; + e2.next_in_ael = &e1; + e1.prev_in_ael = &e2; + e1.next_in_ael = next; + } + else if (e2.next_in_ael == &e1) { + next = e1.next_in_ael; + if (next) next->prev_in_ael = &e2; + prev = e2.prev_in_ael; + if (prev) prev->next_in_ael = &e1; + e1.prev_in_ael = prev; + e1.next_in_ael = &e2; + e2.prev_in_ael = &e1; + e2.next_in_ael = next; + } + else { + next = e1.next_in_ael; + prev = e1.prev_in_ael; + e1.next_in_ael = e2.next_in_ael; + if (e1.next_in_ael) e1.next_in_ael->prev_in_ael = &e1; + e1.prev_in_ael = e2.prev_in_ael; + if (e1.prev_in_ael) e1.prev_in_ael->next_in_ael = &e1; + e2.next_in_ael = next; + if (e2.next_in_ael) e2.next_in_ael->prev_in_ael = &e2; + e2.prev_in_ael = prev; + if (e2.prev_in_ael) e2.prev_in_ael->next_in_ael = &e2; + } + + if (!e1.prev_in_ael) actives_ = &e1; + else if (!e2.prev_in_ael) actives_ = &e2; + } + //------------------------------------------------------------------------------ + + void Clipper::SwapPositionsInSEL(Active &e1, Active &e2) + { + if (!e1.next_in_sel && !e1.prev_in_sel) return; + if (!e2.next_in_sel && !e2.prev_in_sel) return; + + if (e1.next_in_sel == &e2) { + Active* Next = e2.next_in_sel; + if (Next) Next->prev_in_sel = &e1; + Active* Prev = e1.prev_in_sel; + if (Prev) Prev->next_in_sel = &e2; + e2.prev_in_sel = Prev; + e2.next_in_sel = &e1; + e1.prev_in_sel = &e2; + e1.next_in_sel = Next; + } + else if (e2.next_in_sel == &e1) { + Active* Next = e1.next_in_sel; + if (Next) Next->prev_in_sel = &e2; + Active* Prev = e2.prev_in_sel; + if (Prev) Prev->next_in_sel = &e1; + e1.prev_in_sel = Prev; + e1.next_in_sel = &e2; + e2.prev_in_sel = &e1; + e2.next_in_sel = Next; + } + else { + Active* Next = e1.next_in_sel; + Active* Prev = e1.prev_in_sel; + e1.next_in_sel = e2.next_in_sel; + if (e1.next_in_sel) e1.next_in_sel->prev_in_sel = &e1; + e1.prev_in_sel = e2.prev_in_sel; + if (e1.prev_in_sel) e1.prev_in_sel->next_in_sel = &e1; + e2.next_in_sel = Next; + if (e2.next_in_sel) e2.next_in_sel->prev_in_sel = &e2; + e2.prev_in_sel = Prev; + if (e2.prev_in_sel) e2.prev_in_sel->next_in_sel = &e2; + } + + if (!e1.prev_in_sel) sel_ = &e1; + else if (!e2.prev_in_sel) sel_ = &e2; + } + //------------------------------------------------------------------------------ + + void Clipper::Insert2Before1InSel(Active &first, Active &second) + { + //remove second from list ... + Active *prev = second.prev_in_sel; + Active *next = second.next_in_sel; + prev->next_in_sel = next; //always a prev since we're moving from right to left + if (next) next->prev_in_sel = prev; + //insert back into list ... + prev = first.prev_in_sel; + if (prev) prev->next_in_sel = &second; + first.prev_in_sel = &second; + second.prev_in_sel = prev; + second.next_in_sel = &first; + } + //------------------------------------------------------------------------------ + + bool Clipper::ResetHorzDirection(Active &horz, Active *max_pair, int64_t &horz_left, int64_t &horz_right) + { + if (horz.bot.x == horz.top.x) { + //the horizontal edge is going nowhere ... + horz_left = horz.curr.x; + horz_right = horz.curr.x; + Active *e = horz.next_in_ael; + while (e && e != max_pair) e = e->next_in_ael; + return e != NULL; + } + else if (horz.curr.x < horz.top.x) { + horz_left = horz.curr.x; + horz_right = horz.top.x; + return true; + } + else { + horz_left = horz.top.x; + horz_right = horz.curr.x; + return false; //right to left + } + } + //------------------------------------------------------------------------------ + + void Clipper::ProcessHorizontal(Active &horz) + /******************************************************************************* + * 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 the bottom vertices of * + * other HEs[#] and with non-horizontal edges [*]. Once these intersections * + * are completed, intermediate HEs are 'promoted' to the next edge in their * + * bounds, and they in turn may be intersected[%] by other HEs. * + * * + * eg: 3 horizontals at a scanline: / | / / * + * | / | (HE3)o ========%========== o * + * o ======= o(HE2) / | / / * + * o ============#=========*======*========#=========o (HE1) * + * / | / | / * + *******************************************************************************/ + { + Point64 pt; + //with closed paths, simplify consecutive horizontals into a 'single' edge ... + if (!IsOpen(horz)) { + pt = horz.bot; + while (!IsMaxima(horz) && NextVertex(horz).pt.y == pt.y) + UpdateEdgeIntoAEL(&horz); + horz.bot = pt; + horz.curr = pt; + }; + + Active *max_pair = NULL; + if (IsMaxima(horz) && (!IsOpen(horz) || + ((horz.vertex_top->flags & (vfOpenStart | vfOpenEnd)) == 0))) + max_pair = GetMaximaPair(horz); + + int64_t horz_left, horz_right; + bool is_left_to_right = ResetHorzDirection(horz, max_pair, horz_left, horz_right); + if (IsHotEdge(horz)) AddOutPt(horz, horz.curr); + + while (true) { //loops through consec. horizontal edges (if open) + Active *e; + bool isMax = IsMaxima(horz); + if (is_left_to_right) + e = horz.next_in_ael; else + e = horz.prev_in_ael; + while (e) { + //break if we've gone past the } of the horizontal ... + if ((is_left_to_right && (e->curr.x > horz_right)) || + (!is_left_to_right && (e->curr.x < horz_left))) break; + //or if we've got to the } of an intermediate horizontal edge ... + if (e->curr.x == horz.top.x && !isMax && !IsHorizontal(*e)) { + pt = NextVertex(horz).pt; + if (is_left_to_right && (TopX(*e, pt.y) >= pt.x) || + (!is_left_to_right && (TopX(*e, pt.y) <= pt.x))) break; + }; + + if (e == max_pair) { + if (IsHotEdge(horz)) { + if (is_left_to_right) + AddLocalMaxPoly(horz, *e, horz.top); + else + AddLocalMaxPoly(*e, horz, horz.top); + } + DeleteFromAEL(*e); + DeleteFromAEL(horz); + return; + }; + + if (is_left_to_right) { + pt = Point64(e->curr.x, horz.curr.y); + IntersectEdges(horz, *e, pt); + } + else { + pt = Point64(e->curr.x, horz.curr.y); + IntersectEdges(*e, horz, pt); + } + + Active *next_e; + if (is_left_to_right) next_e = e->next_in_ael; + else next_e = e->prev_in_ael; + SwapPositionsInAEL(horz, *e); + e = next_e; + } + + //check if we've finished with (consecutive) horizontals ... + if (isMax || NextVertex(horz).pt.y != horz.top.y) break; + + //still more horizontals in bound to process ... + UpdateEdgeIntoAEL(&horz); + is_left_to_right = ResetHorzDirection(horz, max_pair, horz_left, horz_right); + + if (IsOpen(horz)) { + if (IsMaxima(horz)) max_pair = GetMaximaPair(horz); + if (IsHotEdge(horz)) AddOutPt(horz, horz.bot); + } + } + + if (IsHotEdge(horz)) AddOutPt(horz, horz.top); + if (!IsOpen(horz)) + UpdateEdgeIntoAEL(&horz); //this is the } of an intermediate horiz. + else if (!IsMaxima(horz)) + UpdateEdgeIntoAEL(&horz); + else if (!max_pair) //ie open at top + DeleteFromAEL(horz); + else if (IsHotEdge(horz)) + AddLocalMaxPoly(horz, *max_pair, horz.top); + else { + DeleteFromAEL(*max_pair); DeleteFromAEL(horz); + } + } + //------------------------------------------------------------------------------ + + void Clipper::DoTopOfScanbeam(const int64_t y) + { + sel_ = NULL; //reused to flag horizontals + Active *e = actives_; + while (e) { + //nb: E will never be horizontal at this point + if (e->top.y == y) { + e->curr = e->top; //needed for horizontal processing + if (IsMaxima(*e)) { + e = DoMaxima(*e); //TOP OF BOUND (MAXIMA) + continue; + } + else { + //INTERMEDIATE VERTEX ... + UpdateEdgeIntoAEL(e); + if (IsHotEdge(*e))AddOutPt(*e, e->bot); + if (IsHorizontal(*e)) + PushHorz(*e); //horizontals are processed later + } + } + else { + e->curr.y = y; + e->curr.x = TopX(*e, y); + } + e = e->next_in_ael; + } + } + //------------------------------------------------------------------------------ + + Active* Clipper::DoMaxima(Active &e) + { + Active *next_e, *prev_e, *max_pair; + prev_e = e.prev_in_ael; + next_e = e.next_in_ael; + if (IsOpen(e) && ((e.vertex_top->flags & (vfOpenStart | vfOpenEnd)) != 0)) { + if (IsHotEdge(e)) AddOutPt(e, e.top); + if (!IsHorizontal(e)) { + if (IsHotEdge(e)) TerminateHotOpen(e); + DeleteFromAEL(e); + } + return next_e; + } + else { + max_pair = GetMaximaPair(e); + if (!max_pair) return next_e; //eMaxPair is horizontal + } + + //only non-horizontal maxima here. + //process any edges between maxima pair ... + while (next_e != max_pair) { + IntersectEdges(e, *next_e, e.top); + SwapPositionsInAEL(e, *next_e); + next_e = e.next_in_ael; + } + + if (IsOpen(e)) { + if (IsHotEdge(e)) { + if (max_pair) + AddLocalMaxPoly(e, *max_pair, e.top); else + AddOutPt(e, e.top); + } + if (max_pair) DeleteFromAEL(*max_pair); + DeleteFromAEL(e); + return (prev_e ? prev_e->next_in_ael : actives_); + } + //here E.next_in_ael == ENext == EMaxPair ... + if (IsHotEdge(e)) + AddLocalMaxPoly(e, *max_pair, e.top); + + DeleteFromAEL(e); + DeleteFromAEL(*max_pair); + return (prev_e ? prev_e->next_in_ael : actives_); + } + //------------------------------------------------------------------------------ + + void Clipper::BuildResult(Paths &solution_closed, Paths *solution_open) + { + solution_closed.resize(0); + solution_closed.reserve(outrec_list_.size()); + if (solution_open) { + solution_open->resize(0); + solution_open->reserve(outrec_list_.size()); + } + + for (OutRecList::const_iterator ol_iter = outrec_list_.begin(); + ol_iter != outrec_list_.end(); ++ol_iter) + { + OutRec *outrec = *ol_iter; + if (!outrec->pts) continue; + OutPt *op = outrec->pts->next; + int cnt = PointCount(op); + //fixup for duplicate start and } points ... + if (op->pt == outrec->pts->pt) cnt--; + + bool is_open = (outrec->flag == orOpen); + if (cnt < 2 || (!is_open && cnt == 2) || (is_open && !solution_open)) continue; + Path p; + p.reserve(cnt); + for (int i = 0; i < cnt; i++) { p.push_back(op->pt); op = op->next; } + if (is_open) solution_open->push_back(p); + else solution_closed.push_back(p); + } + } + //------------------------------------------------------------------------------ + + void Clipper::BuildResult2(PolyPath &pt, Paths *solution_open) + { + pt.Clear(); + if (solution_open) { + solution_open->resize(0); + solution_open->reserve(outrec_list_.size()); + } + + for (OutRecList::const_iterator ol_iter = outrec_list_.begin(); + ol_iter != outrec_list_.end(); ++ol_iter) + { + OutRec *outrec = *ol_iter; + if (!outrec->pts) continue; + OutPt *op = outrec->pts->next; + int cnt = PointCount(op); + //fixup for duplicate start and } points ... + if (op->pt == outrec->pts->pt) cnt--; + + bool is_open = (outrec->flag == orOpen); + if (cnt < 2 || (!is_open && cnt == 2) || (is_open && !solution_open)) continue; + + Path p; + p.reserve(cnt); + for (int i = 0; i < cnt; i++) { p.push_back(op->pt); op = op->next; } + if (is_open) + solution_open->push_back(p); + else if (outrec->owner && outrec->owner->polypath) + outrec->polypath = &outrec->owner->polypath->AddChild(p); + else + outrec->polypath = &pt.AddChild(p); + } + } + //------------------------------------------------------------------------------ + + Rect64 Clipper::GetBounds() + { + if (vertex_list_.size() == 0) return Rect64(0, 0, 0, 0); + Rect64 result = Rect64(INT64_MAX, INT64_MAX, INT64_MIN, INT64_MIN); + VerticesList::const_iterator it = vertex_list_.begin(); + while (it != vertex_list_.end()) { + Vertex *v = *it, *v2 = v; + do { + if (v2->pt.x < result.left) result.left = v2->pt.x; + if (v2->pt.x > result.right) result.right = v2->pt.x; + if (v2->pt.y < result.top) result.top = v2->pt.y; + if (v2->pt.y > result.bottom) result.bottom = v2->pt.y; + v2 = v2->next; + } while (v2 != v); + ++it; + } + return result; + } + //------------------------------------------------------------------------------ + + std::ostream& operator <<(std::ostream &s, const Point64 &pt) + { + s << pt.x << "," << pt.y << " "; + return s; + } + //------------------------------------------------------------------------------ + + std::ostream& operator <<(std::ostream &s, const Path &path) + { + if (path.empty()) return s; + Path::size_type last = path.size() -1; + for (Path::size_type i = 0; i < last; i++) s << path[i] << " "; + s << path[last] << "\n"; + return s; + } + //------------------------------------------------------------------------------ + + std::ostream& operator <<(std::ostream &s, const Paths &paths) + { + for (Paths::size_type i = 0; i < paths.size(); i++) s << paths[i]; + s << "\n"; + return s; + } + //------------------------------------------------------------------------------ + +} //clipperlib namespace diff --git a/modules/clipper/lib/clipper.h b/modules/clipper/lib/clipper.h new file mode 100644 index 000000000000..179589471053 --- /dev/null +++ b/modules/clipper/lib/clipper.h @@ -0,0 +1,251 @@ +/******************************************************************************* +* Author : Angus Johnson * +* Version : 10.0 (beta) * +* Date : 8 Noveber 2017 * +* Website : http://www.angusj.com * +* Copyright : Angus Johnson 2010-2017 * +* Purpose : Base clipping module * +* License : http://www.boost.org/LICENSE_1_0.txt * +*******************************************************************************/ + +#ifndef clipper_h +#define clipper_h + +#define CLIPPER_VERSION "10.0.0" + +#include +#include +#include +#include +#include +#include + +namespace clipperlib { + +enum ClipType { ctNone, ctIntersection, ctUnion, ctDifference, ctXor }; +enum PathType { ptSubject, ptClip }; + +//By far the most widely used winding rules for polygon filling are EvenOdd +//and NonZero (see GDI, GDI+, XLib, OpenGL, Cairo, AGG, Quartz, SVG, Gr32). +//https://www.w3.org/TR/SVG/painting.html +enum FillRule { frEvenOdd, frNonZero, frPositive, frNegative }; + +struct Point64 { + int64_t x; + int64_t y; + Point64(int64_t x = 0, int64_t y = 0): x(x), y(y) {}; + + friend inline bool operator== (const Point64 &a, const Point64 &b) + { + return a.x == b.x && a.y == b.y; + } + friend inline bool operator!= (const Point64 &a, const Point64 &b) + { + return a.x != b.x || a.y != b.y; + } + inline bool operator<(const Point64 &b) const { + return (x == b.x) ? (y < b.y) : (x < b.x); + } + inline Point64 operator+(const Point64 &b) const { + return Point64(x + b.x, y + b.y); + } + inline void operator+=(const Point64 &b) { + x += b.x; + y += b.y; + } + inline void operator/=(const Point64 &b) { + x /= b.x; + y /= b.y; + } + inline void operator/=(const int64_t& d) { + x /= d; + y /= d; + } +}; + +typedef std::vector< Point64 > Path; +typedef std::vector< Path > Paths; + +inline Path& operator <<(Path &path, const Point64 &pt) {path.push_back(pt); return path;} +inline Paths& operator <<(Paths &paths, const Path &path) {paths.push_back(path); return paths;} + +std::ostream& operator <<(std::ostream &s, const Point64 &p); +std::ostream& operator <<(std::ostream &s, const Path &p); +std::ostream& operator <<(std::ostream &s, const Paths &p); + +class PolyPath +{ + private: + PolyPath *parent_; + Path path_; + std::vector< PolyPath* > childs_; + public: + PolyPath(); + PolyPath(PolyPath *parent, const Path &path); + virtual ~PolyPath(){}; + PolyPath &AddChild(const Path &path); + PolyPath& GetChild(unsigned index); + int ChildCount() const; + PolyPath* GetParent() const; + Path& GetPath(); + bool IsHole() const; + void Clear(); + + inline bool operator<(const PolyPath* p) const { return this < p; } +}; + +struct Rect64 { + int64_t left; + int64_t top; + int64_t right; + int64_t bottom; + Rect64(int64_t l, int64_t t, int64_t r, int64_t b) : left(l), top(t), right(r), bottom(b) {} +}; + +struct Scanline; +struct IntersectNode; +struct Active; +struct Vertex; +struct LocalMinima; + +class OutPt { +public: + Point64 pt; + OutPt *next; + OutPt *prev; +}; + +enum OutRecFlag { orInner, orOuter, orOpen}; + +//OutRec: contains a path in the clipping solution. Edges in the active edge list (AEL) +//will carry a pointer to an OutRec when they are part of the clipping solution. +struct OutRec { + unsigned idx; + OutRec *owner; + Active *start_e; + Active *end_e; + OutPt *pts; + PolyPath *polypath; + OutRecFlag flag; +}; + +//Active: an edge in the AEL that may or may not be 'hot' (part of the clip solution). +struct Active { + Point64 bot; + Point64 curr; //current (updated at every new scanline) + Point64 top; + double dx; + int wind_dx; //1 or -1 depending on winding direction + int wind_cnt; + int wind_cnt2; //winding count of the opposite polytype + OutRec *outrec; + Active *next_in_ael; + Active *prev_in_ael; + Active *next_in_sel; + Active *prev_in_sel; + Active *merge_jump; + Vertex *vertex_top; + LocalMinima *local_min; //bottom of bound +}; + +class Clipper { + private: + typedef std::vector < OutRec* > OutRecList; + typedef std::vector < IntersectNode* > IntersectList; + typedef std::priority_queue< int64_t > ScanlineList; + typedef std::vector< LocalMinima* > MinimaList; + typedef std::vector< Vertex* > VerticesList; + + ClipType cliptype_; + FillRule fillrule_; + Active *actives_; + Active *sel_; + bool has_open_paths_; + MinimaList minima_list_; + MinimaList::iterator curr_loc_min_; + bool minima_list_sorted_; + OutRecList outrec_list_; + IntersectList intersect_list_; + VerticesList vertex_list_; + ScanlineList scanline_list_; + void Reset(); + void InsertScanline(int64_t y); + bool PopScanline(int64_t &y); + bool PopLocalMinima(int64_t y, LocalMinima *&local_minima); + void DisposeAllOutRecs(); + void DisposeVerticesAndLocalMinima(); + void AddLocMin(Vertex &vert, PathType polytype, bool is_open); + void AddPathToVertexList(const Path &p, PathType polytype, bool is_open); + bool IsContributingClosed(const Active &e) const; + inline bool IsContributingOpen(const Active &e) const; + void SetWindingLeftEdgeClosed(Active &edge); + void SetWindingLeftEdgeOpen(Active &e); + void InsertEdgeIntoAEL(Active &edge, Active *startEdge); + virtual void InsertLocalMinimaIntoAEL(int64_t bot_y); + inline void PushHorz(Active &e); + inline bool PopHorz(Active *&e); + inline OutRec* GetOwner(const Active *e); + void JoinOutrecPaths(Active &e1, Active &e2); + inline void TerminateHotOpen(Active &e); + inline void StartOpenPath(Active &e, const Point64 pt); + inline void UpdateEdgeIntoAEL(Active *e); + virtual void IntersectEdges(Active &e1, Active &e2, const Point64 pt); + inline void DeleteFromAEL(Active &e); + inline void CopyAELToSEL(); + inline void CopyActivesToSELAdjustCurrX(const int64_t top_y); + void ProcessIntersections(const int64_t top_y); + void DisposeIntersectNodes(); + void InsertNewIntersectNode(Active &e1, Active &e2, const int64_t top_y); + void BuildIntersectList(const int64_t top_y); + bool ProcessIntersectList(); + void FixupIntersectionOrder(); + void SwapPositionsInAEL(Active &edge1, Active &edge2); + void SwapPositionsInSEL(Active &edge1, Active &edge2); + inline void Insert2Before1InSel(Active &first, Active &second); + bool ResetHorzDirection(Active &horz, Active *max_pair, int64_t &horz_left, int64_t &horz_right); + void ProcessHorizontal(Active &horz); + void DoTopOfScanbeam(const int64_t top_y); + Active* DoMaxima(Active &e); + void BuildResult(Paths &paths_closed, Paths *paths_open); + void BuildResult2(PolyPath &pt, Paths *solution_open); + protected: + void CleanUp(); + virtual OutPt* CreateOutPt(); + virtual OutRec* CreateOutRec(); + virtual OutPt* AddOutPt(Active &e, const Point64 pt); + virtual void AddLocalMinPoly(Active &e1, Active &e2, const Point64 pt); + virtual void AddLocalMaxPoly(Active &e1, Active &e2, const Point64 pt); + bool ExecuteInternal(ClipType ct, FillRule ft); + /*get properties ... */ + OutRecList& outrec_list() { return outrec_list_; }; + public: + Clipper(); + virtual ~Clipper(); + virtual void AddPath(const Path &path, PathType polytype, bool is_open = false); + virtual void AddPaths(const Paths &paths, PathType polytype, bool is_open = false); + virtual bool Execute(ClipType clipType, Paths &solution_closed, FillRule fr = frEvenOdd); + virtual bool Execute(ClipType clipType, Paths &solution_closed, Paths &solution_open, FillRule fr = frEvenOdd); + virtual bool Execute(ClipType clipType, PolyPath &solution_closed, Paths &solution_open, FillRule fr = frEvenOdd); + void Clear(); + Rect64 GetBounds(); +}; +//------------------------------------------------------------------------------ + +#define CLIPPER_HORIZONTAL (-DBL_MAX) + +class ClipperException : public std::exception +{ + public: + ClipperException(const char* description): descr_(description) {} + virtual ~ClipperException() throw() {} + virtual const char* what() const throw() {return descr_.c_str();} + private: + std::string descr_; +}; +//------------------------------------------------------------------------------ + +} //clipperlib namespace + +#endif //clipper_h + + diff --git a/modules/clipper/lib/clipper_offset.cpp b/modules/clipper/lib/clipper_offset.cpp new file mode 100644 index 000000000000..7157cae7714e --- /dev/null +++ b/modules/clipper/lib/clipper_offset.cpp @@ -0,0 +1,466 @@ +/******************************************************************************* +* Author : Angus Johnson * +* Version : 10.0 (beta) * +* Date : 8 Noveber 2017 * +* Website : http://www.angusj.com * +* Copyright : Angus Johnson 2010-2017 * +* Purpose : Offset clipping solutions * +* License : http://www.boost.org/LICENSE_1_0.txt * +*******************************************************************************/ + +#include +#include +#include +#include +#include "clipper.h" +#include "clipper_offset.h" + +namespace clipperlib { + + #define PI (3.14159265358979323846) + #define TWO_PI (PI * 2) + #define DEFAULT_ARC_FRAC (0.02) + #define TOLERANCE (1.0E-12) + + inline int64_t Round(double val) + { + if ((val < 0)) return static_cast(val - 0.5); + else return static_cast(val + 0.5); + } + //--------------------------------------------------------------------------- + + double Area(Path path) + { + int cnt = (int)path.size(); + if (cnt < 3) return 0; + double a = 0; + for (int i = 0, j = cnt - 1; i < cnt; ++i) + { + a += ((double)path[j].x + path[i].x) * ((double)path[j].y - path[i].y); + j = i; + } + return -a * 0.5; + } + //--------------------------------------------------------------------------- + + ClipperOffset::PointD ClipperOffset::GetUnitNormal(const Point64 &pt1, const Point64 &pt2) + { + double dx = (double)(pt2.x - pt1.x); + double dy = (double)(pt2.y - pt1.y); + if ((dx == 0) && (dy == 0)) return PointD(0,0); + double f = 1 * 1.0 / sqrt(dx * dx + dy * dy); + dx *= f; + dy *= f; + return PointD(dy, -dx); + } + //--------------------------------------------------------------------------- + + ClipperOffset::PathNode::PathNode(const Path &p, JoinType jt, EndType et) + { + join_type = jt; + end_type = et; + + size_t len_path = p.size(); + if (et == kPolygon || et == kOpenJoined) + while (len_path > 1 && p[len_path - 1] == p[0]) len_path--; + else if (len_path == 2 && p[1] == p[0]) + len_path = 1; + if (len_path == 0) return; + + if (len_path < 3 && (et == kPolygon || et == kOpenJoined)) + { + if (jt == kRound) end_type = kOpenRound; + else end_type = kOpenSquare; + } + + path.reserve(len_path); + path.push_back(p[0]); + + Point64 last_pt = p[0]; + lowest_idx = 0; + for (size_t i = 1, last = 0; i < len_path; ++i) + { + if (last_pt == p[i]) continue; + last++; + path.push_back(p[i]); + last_pt = p[i]; + //j == path.size() -1; + if (et != kPolygon) continue; + if (path[last].y >= path[lowest_idx].y && + (path[last].y > path[lowest_idx].y || path[last].x < path[lowest_idx].x)) + lowest_idx = last; + } + if (end_type == kPolygon && path.size() < 3) path.clear(); + } + //--------------------------------------------------------------------------- + + void ClipperOffset::GetLowestPolygonIdx() + { + lowest_idx_ = -1; + Point64 ip1 = Point64(0,0), ip2; + for (size_t i = 0; i < nodes_.size(); ++i) + { + PathNode *node = nodes_[i]; + if (node->end_type != kPolygon) continue; + if (lowest_idx_ < 0) + { + ip1 = node->path[node->lowest_idx]; + lowest_idx_ = i; + } + else + { + ip2 = node->path[node->lowest_idx]; + if (ip2.y >= ip1.y && (ip2.y > ip1.y || ip2.x < ip1.x)) + { + lowest_idx_ = i; + ip1 = ip2; + } + } + } + } + //--------------------------------------------------------------------------- + + void ClipperOffset::OffsetPoint(size_t j, size_t &k, JoinType join_type) + { + //A: angle between adjoining paths on left side (left WRT winding direction). + //A == 0 deg (or A == 360 deg): collinear edges heading in same direction + //A == 180 deg: collinear edges heading in opposite directions (ie a 'spike') + //sin(A) < 0: convex on left. + //cos(A) > 0: angles on both left and right sides > 90 degrees + + //cross product ... + sin_a_ = (norms_[k].x * norms_[j].y - norms_[j].x * norms_[k].y); + + if (abs(sin_a_ * delta_) < 1.0) //angle is approaching 180 or 360 deg. + { + //dot product ... + double cos_a = (norms_[k].x * norms_[j].x + norms_[j].y * norms_[k].y); + if (cos_a > 0) //given condition above the angle is approaching 360 deg. + { + //with angles approaching 360 deg collinear (whether concave or convex), + //offsetting with two or more vertices (that would be so close together) + //occasionally causes tiny self-intersections due to rounding. + //So we offset with just a single vertex here ... + path_out_.push_back(Point64(Round(path_in_[j].x + norms_[k].x * delta_), + Round(path_in_[j].y + norms_[k].y * delta_))); + return; + } + } + else if (sin_a_ > 1.0) sin_a_ = 1.0; + else if (sin_a_ < -1.0) sin_a_ = -1.0; + + if (sin_a_ * delta_ < 0) //ie a concave offset + { + path_out_.push_back(Point64(Round(path_in_[j].x + norms_[k].x * delta_), + Round(path_in_[j].y + norms_[k].y * delta_))); + path_out_.push_back(path_in_[j]); + path_out_.push_back(Point64(Round(path_in_[j].x + norms_[j].x * delta_), + Round(path_in_[j].y + norms_[j].y * delta_))); + } + else + { + double cos_a; + //convex offsets here ... + switch (join_type) + { + case kMiter: + cos_a = (norms_[j].x * norms_[k].x + norms_[j].y * norms_[k].y); + //see offset_triginometry3.svg + if (1 + cos_a < miter_lim_) DoSquare(j, k); + else DoMiter(j, k, 1 + cos_a); + break; + case kSquare: + cos_a = (norms_[j].x * norms_[k].x + norms_[j].y * norms_[k].y); + if (cos_a >= 0) DoMiter(j, k, 1 + cos_a); //angles >= 90 deg. don't need squaring + else DoSquare(j, k); + break; + case kRound: + DoRound(j, k); + break; + } + } + k = j; + } + //--------------------------------------------------------------------------- + + void ClipperOffset::DoSquare(int j, int k) + { + //Two vertices, one using the prior offset's (k) normal one the current (j). + //Do a 'normal' offset (by delta_) and then another by 'de-normaling' the + //normal hence parallel to the direction of the respective edges. + if (delta_ > 0) + { + path_out_.push_back(Point64( + Round(path_in_[j].x + delta_ * (norms_[k].x - norms_[k].y)), + Round(path_in_[j].y + delta_ * (norms_[k].y + norms_[k].x)))); + path_out_.push_back(Point64( + Round(path_in_[j].x + delta_ * (norms_[j].x + norms_[j].y)), + Round(path_in_[j].y + delta_ * (norms_[j].y - norms_[j].x)))); + } + else + { + path_out_.push_back(Point64( + Round(path_in_[j].x + delta_ * (norms_[k].x + norms_[k].y)), + Round(path_in_[j].y + delta_ * (norms_[k].y - norms_[k].x)))); + path_out_.push_back(Point64( + Round(path_in_[j].x + delta_ * (norms_[j].x - norms_[j].y)), + Round(path_in_[j].y + delta_ * (norms_[j].y + norms_[j].x)))); + } + } + //--------------------------------------------------------------------------- + + void ClipperOffset::DoMiter(int j, int k, double cos_a_plus_1) + { + //see offset_triginometry4.svg + double q = delta_ / cos_a_plus_1; //0 < cosAplus1 <= 2 + path_out_.push_back(Point64(Round(path_in_[j].x + (norms_[k].x + norms_[j].x) * q), + Round(path_in_[j].y + (norms_[k].y + norms_[j].y) * q))); + } + //--------------------------------------------------------------------------- + + void ClipperOffset::DoRound(int j, int k) + { + double a = atan2(sin_a_, norms_[k].x * norms_[j].x + norms_[k].y * norms_[j].y); + int steps = (std::max)((int)Round(steps_per_radian_ * abs(a)), 1); + + double x = norms_[k].x, y = norms_[k].y, x2; + for (int i = 0; i < steps; ++i) + { + path_out_.push_back(Point64( + Round(path_in_[j].x + x * delta_), + Round(path_in_[j].y + y * delta_))); + x2 = x; + x = x * cos_ - sin_ * y; + y = x2 * sin_ + y * cos_; + } + path_out_.push_back(Point64( + Round(path_in_[j].x + norms_[j].x * delta_), + Round(path_in_[j].y + norms_[j].y * delta_))); + } + //--------------------------------------------------------------------------- + + void ClipperOffset::DoOffset(double d) + { + delta_ = d; + double abs_delta = abs(d); + + //if a Zero offset, then just copy CLOSED polygons to FSolution and return ... + if (abs_delta < TOLERANCE) + { + solution_.reserve(nodes_.size()); + for (NodeList::iterator nl_iter = nodes_.begin(); nl_iter != nodes_.end(); ++nl_iter) + if ((*nl_iter)->end_type == kPolygon) solution_.push_back((*nl_iter)->path); + return; + } + + //MiterLimit: see offset_triginometry3.svg in the documentation folder ... + if (miter_limit_ > 2) + miter_lim_ = 2 / (miter_limit_ * miter_limit_); + else + miter_lim_ = 0.5; + + double arc_tol; + if (arc_tolerance_ < DEFAULT_ARC_FRAC) + arc_tol = abs_delta * DEFAULT_ARC_FRAC; else + arc_tol = arc_tolerance_; + + //see offset_triginometry2.svg in the documentation folder ... + double steps = PI / acos(1 - arc_tol / abs_delta); //steps per 360 degrees + if (steps > abs_delta * PI) steps = abs_delta * PI; //ie excessive precision check + + sin_ = sin(TWO_PI / steps); + cos_ = cos(TWO_PI / steps); + if (d < 0) sin_ = -sin_; + steps_per_radian_ = steps / TWO_PI; + + solution_.reserve(nodes_.size() * 2); + for (NodeList::iterator nl_iter = nodes_.begin(); nl_iter != nodes_.end(); ++nl_iter) + { + PathNode *node = *nl_iter; + path_in_ = node->path; + path_out_.clear(); + size_t path_in_size = path_in_.size(); + + //if a single vertex then build circle or a square ... + if (path_in_size == 1) + { + if (node->join_type == kRound) + { + double x = 1.0, y = 0.0; + for (int j = 1; j <= steps; j++) + { + path_out_.push_back(Point64( + Round(path_in_[0].x + x * delta_), + Round(path_in_[0].y + y * delta_))); + double x2 = x; + x = x * cos_ - sin_ * y; + y = x2 * sin_ + y * cos_; + } + } + else + { + double x = -1.0, y = -1.0; + for (int j = 0; j < 4; ++j) + { + path_out_.push_back(Point64( + Round(path_in_[0].x + x * delta_), + Round(path_in_[0].y + y * delta_))); + if (x < 0) x = 1; + else if (y < 0) y = 1; + else x = -1; + } + } + solution_.push_back(path_out_); + continue; + } //end of single vertex offsetting + + //build norms_ ... + norms_.clear(); + norms_.reserve(path_in_size); + for (size_t j = 0; j < path_in_size - 1; ++j) + norms_.push_back(GetUnitNormal(path_in_[j], path_in_[j + 1])); + if (node->end_type == kOpenJoined || node->end_type == kPolygon) + norms_.push_back(GetUnitNormal(path_in_[path_in_size - 1], path_in_[0])); + else + norms_.push_back(PointD(norms_[path_in_size - 2])); + + if (node->end_type == kPolygon) + { + size_t k = path_in_size - 1; + for (size_t j = 0; j < path_in_size; j++) + OffsetPoint(j, k, node->join_type); + solution_.push_back(path_out_); + } + else if (node->end_type == kOpenJoined) + { + size_t k = path_in_size - 1; + for (size_t j = 0; j < path_in_size; j++) + OffsetPoint(j, k, node->join_type); + solution_.push_back(path_out_); + path_out_.clear(); + //re-build norms_ ... + PointD n = norms_[path_in_size - 1]; + for (size_t j = path_in_size - 1; j > 0; --j) + norms_[j] = PointD(-norms_[j - 1].x, -norms_[j - 1].y); + norms_[0] = PointD(-n.x, -n.y); + k = 0; + for (size_t j = path_in_size - 1; j >= 0; j--) + OffsetPoint(j, k, node->join_type); + solution_.push_back(path_out_); + } + else + { + size_t k = 0; + for (size_t j = 1; j < path_in_size - 1; ++j) + OffsetPoint(j, k, node->join_type); + + Point64 pt1; + if (node->end_type == kOpenButt) + { + size_t j = path_in_size - 1; + pt1 = Point64(Round(path_in_[j].x + norms_[j].x * + delta_), Round(path_in_[j].y + norms_[j].y * delta_)); + path_out_.push_back(pt1); + pt1 = Point64(Round(path_in_[j].x - norms_[j].x * delta_), + Round(path_in_[j].y - norms_[j].y * delta_)); + path_out_.push_back(pt1); + } + else + { + size_t j = path_in_size - 1; + k = path_in_size - 2; + sin_a_ = 0; + norms_[j] = PointD(-norms_[j].x, -norms_[j].y); + if (node->end_type == kOpenSquare) DoSquare(j, k); + else DoRound(j, k); + } + + //reverse norms_ ... + for (size_t j = path_in_size - 1; j > 0; j--) + norms_[j] = PointD(-norms_[j - 1].x, -norms_[j - 1].y); + norms_[0] = PointD(-norms_[1].x, -norms_[1].y); + + k = path_in_size - 1; + for (size_t j = k - 1; j > 0; --j) OffsetPoint(j, k, node->join_type); + + if (node->end_type == kOpenButt) + { + pt1 = Point64(Round(path_in_[0].x - norms_[0].x * delta_), + Round(path_in_[0].y - norms_[0].y * delta_)); + path_out_.push_back(pt1); + pt1 = Point64(Round(path_in_[0].x + norms_[0].x * delta_), + Round(path_in_[0].y + norms_[0].y * delta_)); + path_out_.push_back(pt1); + } + else + { + k = 1; + sin_a_ = 0; + if (node->end_type == kOpenSquare) DoSquare(0, 1); + else DoRound(0, 1); + } + solution_.push_back(path_out_); + } + } + norms_.clear(); + path_in_.clear(); + path_out_.clear(); + } + //--------------------------------------------------------------------------- + + void ClipperOffset::Clear() + { + for (NodeList::iterator nl_iter = nodes_.begin(); nl_iter != nodes_.end(); ++nl_iter) + delete (*nl_iter); + nodes_.clear(); + norms_.clear(); + solution_.clear(); + } + //--------------------------------------------------------------------------- + + void ClipperOffset::AddPath(const Path &path, JoinType jt, EndType et) + { + PathNode *pn = new PathNode(path, jt, et); + if (pn->path.empty()) delete pn; + else nodes_.push_back(pn); + } + //--------------------------------------------------------------------------- + + void ClipperOffset::AddPaths(const Paths &paths, JoinType jt, EndType et) + { + for (Paths::const_iterator p_iter = paths.begin(); p_iter != paths.end(); ++p_iter) + AddPath(*p_iter, jt, et); + } + //--------------------------------------------------------------------------- + + void ClipperOffset::Execute(Paths &sol, double delta) + { + solution_.clear(); + if (nodes_.size() == 0) return; + + GetLowestPolygonIdx(); + bool negate = (lowest_idx_ >= 0 && Area(nodes_[lowest_idx_]->path) < 0); + //if polygon orientations are reversed, then 'negate' ... + if (negate) delta_ = -delta; + else delta_ = delta; + DoOffset(delta_); + + //now clean up 'corners' ... + Clipper clpr; + clpr.AddPaths(solution_, ptSubject); + if (negate) clpr.Execute(ctUnion, sol, frNegative); + else clpr.Execute(ctUnion, sol, frPositive); + } + //--------------------------------------------------------------------------- + + void OffsetPaths(Paths &paths_in, Paths &paths_out, double delta, JoinType jt, EndType et) + { + ClipperOffset co; + co.AddPaths(paths_in, jt, et); + co.Execute(paths_out, delta); + } + //--------------------------------------------------------------------------- + +} //clipperlib namespace + + diff --git a/modules/clipper/lib/clipper_offset.h b/modules/clipper/lib/clipper_offset.h new file mode 100644 index 000000000000..0a8f3b985913 --- /dev/null +++ b/modules/clipper/lib/clipper_offset.h @@ -0,0 +1,80 @@ +/******************************************************************************* +* Author : Angus Johnson * +* Version : 10.0 (beta) * +* Date : 8 Noveber 2017 * +* Website : http://www.angusj.com * +* Copyright : Angus Johnson 2010-2017 * +* Purpose : Offset clipping solutions * +* License : http://www.boost.org/LICENSE_1_0.txt * +*******************************************************************************/ + +#ifndef clipper_offset_h +#define clipper_offset_h + +#include +#include +#include "clipper.h" + +namespace clipperlib { + + enum JoinType { kSquare, kRound, kMiter }; + enum EndType { kPolygon, kOpenJoined, kOpenButt, kOpenSquare, kOpenRound }; + + void OffsetPaths(Paths &paths_in, Paths &paths_out, double delta, JoinType jt, EndType et); + + class ClipperOffset + { + private: + + struct PointD + { + double x; + double y; + PointD(double x_ = 0, double y_ = 0) : x(x_), y(y_) {}; + PointD(const Point64 &pt) : x((double)pt.x), y((double)pt.y) {}; + }; + + struct PathNode + { + Path path; + JoinType join_type; + EndType end_type; + int lowest_idx; + PathNode(const Path &p, JoinType jt, EndType et); + }; + + typedef std::vector< PointD > NormalsList; + typedef std::vector< PathNode* > NodeList; + + Paths solution_; + Path path_in_, path_out_; + NormalsList norms_; + NodeList nodes_; + double arc_tolerance_; + double miter_limit_; + + //nb: miter_lim_ below is a temp field that differs from miter_limit + double delta_, sin_a_, sin_, cos_, miter_lim_, steps_per_radian_; + int lowest_idx_; + void GetLowestPolygonIdx(); + void OffsetPoint(size_t j, size_t &k, JoinType join_type); + void DoSquare(int j, int k); + void DoMiter(int j, int k, double cos_a_plus_1); + void DoRound(int j, int k); + void DoOffset(double d); + static PointD GetUnitNormal(const Point64 &pt1, const Point64 &pt2); + + public: + ClipperOffset(double miter_limit = 2.0, double arc_tolerance = 0) : + miter_limit_(miter_limit), arc_tolerance_(arc_tolerance) {}; + void Clear(); + void AddPath(const Path &path, JoinType jt, EndType et); + void AddPaths(const Paths &paths, JoinType jt, EndType et); + void Execute(Paths &sol, double delta); + }; + +} //clipperlib namespace + +#endif //clipper_offset_h + + diff --git a/modules/clipper/lib/clipper_triangulation.cpp b/modules/clipper/lib/clipper_triangulation.cpp new file mode 100644 index 000000000000..0f975ad8abfa --- /dev/null +++ b/modules/clipper/lib/clipper_triangulation.cpp @@ -0,0 +1,323 @@ +/******************************************************************************* +* Author : Angus Johnson * +* Version : 10.0 (beta) * +* Date : 8 Noveber 2017 * +* Website : http://www.angusj.com * +* Copyright : Angus Johnson 2010-2017 * +* Purpose : Triangulate clipping solutions * +* License : http://www.boost.org/LICENSE_1_0.txt * +*******************************************************************************/ + +#include "core/reference.h" + +#include +#include +#include +#include +#include "clipper_triangulation.h" +#include "clipper.h" + +namespace clipperlib { + + //------------------------------------------------------------------------------ + // Miscellaneous functions ... + //------------------------------------------------------------------------------ + + inline int64_t CrossProductVal(const Point64 pt1, + const Point64 pt2, const Point64 pt3, int64_t &val) + { + val = ((pt2.x - pt1.x) * (pt1.y - pt3.y) - (pt1.x - pt3.x) * (pt2.y - pt1.y)); + return val; + } + //------------------------------------------------------------------------------ + + inline bool IsHotEdge(const Active &e) { return (e.outrec); } + //------------------------------------------------------------------------------ + + inline bool IsStartSide(const Active &e) { return (&e == e.outrec->start_e); } + //------------------------------------------------------------------------------ + + inline OutPt* GetOutPt(Active &e) + { + return (IsStartSide(e)) ? e.outrec->pts : e.outrec->pts->next; + } + //------------------------------------------------------------------------------ + + inline Active* GetLeftAdjacentHotEdge(Active &e) + { + Active * result = e.prev_in_ael; + while (result && !IsHotEdge(*result)) result = result->prev_in_ael; + return result; + } + //------------------------------------------------------------------------------ + + inline Active* GetRightAdjacentHotEdge(Active &e) + { + Active * result = e.next_in_ael; + while (result && !IsHotEdge(*result)) result = result->next_in_ael; + return result; + } + //------------------------------------------------------------------------------ + + inline void DisposeOutPt(OutPt *op) + { + if (op->prev) op->prev->next = op->next; + if (op->next) op->next->prev = op->prev; + OutPtTri *opt = static_cast(op); + if (opt->right_outrec) opt->right_outrec->left_outpt = NULL; + delete op; + } + //------------------------------------------------------------------------------ + + void UpdateHelper(OutRec *right_outrec, OutPt *left_outpt) + { + OutPtTri *left_opt = static_cast(left_outpt); + OutRecTri *right_ort = static_cast(right_outrec); + if (left_opt && left_opt->right_outrec) + left_opt->right_outrec->left_outpt = NULL; + if (right_ort->left_outpt) + static_cast(right_ort->left_outpt)->right_outrec = NULL; + right_ort->left_outpt = left_opt; + if (left_opt) left_opt->right_outrec = right_ort; + } + //------------------------------------------------------------------------------ + + void Update(OutPt *op, OutRec *outrec) + { + OutPt *op2 = op; + do { + OutPtTri *opt = static_cast(op2); + if (opt->right_outrec) + UpdateHelper(opt->right_outrec, NULL); + opt->outrec = outrec; + op2 = op2->next; + } while (op2 != op); + } + //------------------------------------------------------------------------------ + + inline int PointCount(OutPt *op) + { + if (!op) return 0; + OutPt *p = op; + int cnt = 0; + do { + cnt++; + p = p->next; + } while (p != op); + return cnt; + } + //------------------------------------------------------------------------------ + + OutPtTri* InsertPt(const Point64 &pt, OutPt *insert_after) + { + OutPtTri *result = new OutPtTri(); + result->pt = pt; + result->prev = insert_after; + result->next = insert_after->next; + result->outrec = static_cast(insert_after)->outrec; + static_cast(result)->right_outrec = NULL; + insert_after->next->prev = result; + insert_after->next = result; + return result; + } + + //------------------------------------------------------------------------------ + // ClipperTri methods ... + //------------------------------------------------------------------------------ + + void ClipperTri::AddPolygon(const Point64 pt1, const Point64 pt2, const Point64 pt3) + { + Path p; + p.reserve(3); + p.push_back(pt3); + p.push_back(pt2); + p.push_back(pt1); + triangles_.push_back(p); + } + //------------------------------------------------------------------------------ + + OutPt* ClipperTri::CreateOutPt() + { + OutPtTri *result = new OutPtTri(); + result->outrec = NULL; + result->right_outrec = NULL; + return result; + } + //------------------------------------------------------------------------------ + + OutRec* ClipperTri::CreateOutRec() + { + OutRecTri *result = new OutRecTri(); + result->left_outpt = NULL; + return result; + } + //------------------------------------------------------------------------------ + + void ClipperTri::Triangulate(OutRec *outrec) + { + OutPt *op = outrec->pts; + if (op->next == op->prev) return; + OutPt *end_op = op->next; + for (;;) + { + OutPt *op2 = op; + int64_t cpval = 0; + while (op->prev != end_op) { + if (CrossProductVal(op->pt, op->prev->pt, op->prev->prev->pt, cpval) >= 0) + break; + if (op2 != op) { + //Due to rounding, the clipping algorithm can occasionally produce + //tiny self-intersections and these need removing ... + if (CrossProductVal(op2->pt, op->pt, op->prev->prev->pt, cpval) > 0) { + OutPtTri *opt = static_cast(op); + if (opt->outrec) UpdateHelper(opt->outrec, op2); + DisposeOutPt(op); + op = op2; + continue; + } + } + op = op->prev; + } + + if (op->prev == end_op) break; + if (cpval) AddPolygon(op->pt, op->prev->pt, op->prev->prev->pt); + OutPtTri *opt = static_cast(op->prev); + if (opt->outrec) UpdateHelper(opt->outrec, op); + DisposeOutPt(op->prev); + if (op != outrec->pts) op = op->next; + } + } + //------------------------------------------------------------------------------ + + OutPt* ClipperTri::AddOutPt(Active &e, const Point64 pt) { + + OutPt *result = Clipper::AddOutPt(e, pt); + OutPtTri *opt = static_cast(result); + opt->outrec = e.outrec; + last_op_ = result; + Triangulate(e.outrec); + //Triangulate() above may assign Result.OutRecRt so ... + if (IsStartSide(e) && ! opt->right_outrec) { + Active *e2 = GetRightAdjacentHotEdge(e); + if (e2) UpdateHelper(e2->outrec, result); + } + return result; + } + //------------------------------------------------------------------------------ + + void ClipperTri::AddLocalMinPoly(Active &e1, Active &e2, const Point64 pt) + { + Clipper::AddLocalMinPoly(e1, e2, pt); + OutRec *locMinOr = e1.outrec; + static_cast(locMinOr->pts)->outrec = locMinOr; + UpdateHelper(locMinOr, locMinOr->pts); + if (locMinOr->flag == orOuter)return; + + //do 'keyholing' ... + Active *e = GetRightAdjacentHotEdge(e1); + if (e == &e2) e = GetRightAdjacentHotEdge(e2); + if (!e) e = GetLeftAdjacentHotEdge(e1); + OutPt *botLft = static_cast(e->outrec)->left_outpt; + OutPt *botRt = GetOutPt(*e); + + if (!botLft || botRt->pt.y < botLft->pt.y) botLft = botRt; + + botRt = InsertPt(botLft->pt, botLft->prev); + OutRec *botOr = static_cast(botLft)->outrec; + if (!botOr->pts) botOr = botOr->owner; + + OutPt *startOp = botOr->pts; + OutPt *endOp = startOp->next; + + locMinOr->flag = orOuter; + locMinOr->owner = NULL; + OutPt *locMinLft = locMinOr->pts; + OutPt *locMinRt = InsertPt(locMinLft->pt, locMinLft); + + //locMinOr will contain the polygon to the right of the join (ascending), + //and botOr will contain the polygon to the left of the join (descending). + + //tail -> botRt -> locMinRt : locMinRt is joined by botRt tail + locMinRt->next = endOp; + endOp->prev = locMinRt; + botRt->next = locMinRt; + locMinRt->prev = botRt; + locMinOr->pts = locMinRt; + + //locMinLft -> botLft -> head : locMinLft joins behind botLft (left) + startOp->next = locMinLft; + locMinLft->prev = startOp; + botLft->prev = locMinLft; + locMinLft->next = botLft; + static_cast(locMinLft)->outrec = botOr; //ie abreviated update() + + Update(locMinRt, locMinOr); //updates the outrec for each op + + //exchange endE's ... + e = botOr->end_e; + botOr->end_e = locMinOr->end_e; + locMinOr->end_e = e; + botOr->end_e->outrec = botOr; + locMinOr->end_e->outrec = locMinOr; + + //update helper info ... + UpdateHelper(locMinOr, locMinRt); + UpdateHelper(botOr, botOr->pts); + Triangulate(locMinOr); + Triangulate(botOr); + } + //------------------------------------------------------------------------------ + + void ClipperTri::AddLocalMaxPoly(Active &e1, Active &e2, const Point64 pt) + { + OutRec *outrec = e1.outrec; + //very occasionally IsStartSide(e1) is wrong so ... + bool is_outer = IsStartSide(e1) || (e1.outrec == e2.outrec); + if (is_outer) { + OutRecTri *ort = static_cast(e1.outrec); + if (ort->left_outpt) UpdateHelper(outrec, NULL); + UpdateHelper(e2.outrec, NULL); + } + + Clipper::AddLocalMaxPoly(e1, e2, pt); + + if (!outrec->pts) outrec = outrec->owner; + + if (is_outer) { + if (static_cast(outrec->pts)->right_outrec) + UpdateHelper(static_cast(outrec->pts)->right_outrec, NULL); + else if (static_cast(outrec->pts->next)->right_outrec) + UpdateHelper(static_cast(outrec->pts->next)->right_outrec, NULL); + } + else { + Active *e = GetRightAdjacentHotEdge(e2); + if (e) UpdateHelper(e->outrec, last_op_); + Update(outrec->pts, outrec); + } + Triangulate(outrec); + } + //------------------------------------------------------------------------------ + + bool ClipperTri::Execute(ClipType clipType, Paths &solution, FillRule fr) + { + solution.clear(); + if (clipType == ctNone) return true; + bool result = ExecuteInternal(clipType, fr); + if (result) BuildResult(solution); + CleanUp(); + return result; + } + //------------------------------------------------------------------------------ + + void ClipperTri::BuildResult(Paths &paths) { + paths.clear(); + paths.reserve(triangles_.size()); + for (Paths::const_iterator iter = triangles_.cbegin(); + iter != triangles_.cend(); ++iter) { + ERR_FAIL_COND((*iter).size() != 3); + paths.push_back(*iter); + } + } + //------------------------------------------------------------------------------ + +} //namespace diff --git a/modules/clipper/lib/clipper_triangulation.h b/modules/clipper/lib/clipper_triangulation.h new file mode 100644 index 000000000000..445f893d4adb --- /dev/null +++ b/modules/clipper/lib/clipper_triangulation.h @@ -0,0 +1,58 @@ +/******************************************************************************* +* Author : Angus Johnson * +* Version : 10.0 (beta) * +* Date : 8 Noveber 2017 * +* Website : http://www.angusj.com * +* Copyright : Angus Johnson 2010-2017 * +* Purpose : Triangulate clipping solutions * +* License : http://www.boost.org/LICENSE_1_0.txt * +*******************************************************************************/ + +#ifndef clipper_tri_h +#define clipper_tri_h + +#include +#include "clipper.h" + +namespace clipperlib { + + class OutRecTri; + + class OutPtTri : public OutPt + { + public: + OutRec *outrec; + OutRecTri *right_outrec; + }; + + class OutRecTri : public OutRec + { + public: + OutPtTri *left_outpt; + }; + + class ClipperTri : public virtual Clipper + { + private: + OutPt *last_op_; + Paths triangles_; + void AddPolygon(const Point64 pt1, const Point64 pt2, const Point64 pt3); + void Triangulate(OutRec *outrec); + void BuildResult(Paths &triangles); + protected: + OutPt* CreateOutPt(); + OutRec* CreateOutRec(); + OutPt* AddOutPt(Active &e, const Point64 pt); + void AddLocalMinPoly(Active &e1, Active &e2, const Point64 pt); + void AddLocalMaxPoly(Active &e1, Active &e2, const Point64 pt); + public: + bool Execute(ClipType clipType, Paths &solution, FillRule fr = frEvenOdd); + bool Execute(ClipType clipType, Paths &solution_closed, Paths &solution_open, FillRule fr = frEvenOdd) + { return false; } //it's pointless triangulating open paths + bool Execute(ClipType clipType, PolyPath &solution_closed, Paths &solution_open, FillRule fr = frEvenOdd) + { return false; } //the PolyPath structure is of no benefit when triangulating + }; + +} //namespace + +#endif //clipper_tri_h diff --git a/modules/clipper/register_types.cpp b/modules/clipper/register_types.cpp new file mode 100644 index 000000000000..f6dc3e25f325 --- /dev/null +++ b/modules/clipper/register_types.cpp @@ -0,0 +1,11 @@ +#include "register_types.h" +#include "clipper.h" + +void register_clipper_types() { + + ClassDB::register_class(); +} + +void unregister_clipper_types() { + // nothing to do here +} diff --git a/modules/clipper/register_types.h b/modules/clipper/register_types.h new file mode 100644 index 000000000000..ff551d2d2fa1 --- /dev/null +++ b/modules/clipper/register_types.h @@ -0,0 +1,4 @@ +/* register_types.h */ + +void register_clipper_types(); +void unregister_clipper_types(); From f7e35d2c7481b472cb8a1d9e299c3097beb7ef40 Mon Sep 17 00:00:00 2001 From: "Andrii Doroshenko (Xrayez)" Date: Wed, 7 Nov 2018 14:40:35 +0200 Subject: [PATCH 2/7] Replace Clipper with version 10.0.0 beta, refactor codebase accordingly * Replace 6.4.2 with 10.0.0 beta (?) (dedicated offset and triangulation) * Scons: add thirdparty clipper sources via module, not editor * Refactor `expand` method in sprite editor plugin that is used for mesh instance creation --- editor/SCsub | 3 - editor/plugins/skeleton_2d_editor_plugin.cpp | 1 - editor/plugins/sprite_editor_plugin.cpp | 67 +- modules/clipper/SCsub | 26 +- modules/clipper/clipper.cpp | 558 +- modules/clipper/clipper.h | 155 +- modules/clipper/lib/LICENSE.md | 27 - modules/clipper/lib/clipper.cpp | 1920 ------ modules/clipper/register_types.cpp | 4 +- thirdparty/misc/clipper.cpp | 5908 +++++------------ .../clipper/lib => thirdparty/misc}/clipper.h | 12 - thirdparty/misc/clipper.hpp | 406 -- .../misc}/clipper_offset.cpp | 0 .../lib => thirdparty/misc}/clipper_offset.h | 0 .../misc}/clipper_triangulation.cpp | 0 .../misc}/clipper_triangulation.h | 0 16 files changed, 2009 insertions(+), 7078 deletions(-) delete mode 100644 modules/clipper/lib/LICENSE.md delete mode 100644 modules/clipper/lib/clipper.cpp rename {modules/clipper/lib => thirdparty/misc}/clipper.h (97%) delete mode 100644 thirdparty/misc/clipper.hpp rename {modules/clipper/lib => thirdparty/misc}/clipper_offset.cpp (100%) rename {modules/clipper/lib => thirdparty/misc}/clipper_offset.h (100%) rename {modules/clipper/lib => thirdparty/misc}/clipper_triangulation.cpp (100%) rename {modules/clipper/lib => thirdparty/misc}/clipper_triangulation.h (100%) diff --git a/editor/SCsub b/editor/SCsub index 82a4ecb6c075..7d48e47c9faf 100644 --- a/editor/SCsub +++ b/editor/SCsub @@ -79,9 +79,6 @@ if env['tools']: env.CommandNoCache('#editor/builtin_fonts.gen.h', flist, run_in_subprocess(editor_builders.make_fonts_header)) env.add_source_files(env.editor_sources, "*.cpp") - env_thirdparty = env.Clone() - env_thirdparty.disable_warnings() - env_thirdparty.add_source_files(env.editor_sources, ["#thirdparty/misc/clipper.cpp"]) SConscript('collada/SCsub') SConscript('doc/SCsub') diff --git a/editor/plugins/skeleton_2d_editor_plugin.cpp b/editor/plugins/skeleton_2d_editor_plugin.cpp index ef3e17279c04..4aeec9a3f798 100644 --- a/editor/plugins/skeleton_2d_editor_plugin.cpp +++ b/editor/plugins/skeleton_2d_editor_plugin.cpp @@ -33,7 +33,6 @@ #include "canvas_item_editor_plugin.h" #include "scene/2d/mesh_instance_2d.h" #include "scene/gui/box_container.h" -#include "thirdparty/misc/clipper.hpp" void Skeleton2DEditor::_node_removed(Node *p_node) { diff --git a/editor/plugins/sprite_editor_plugin.cpp b/editor/plugins/sprite_editor_plugin.cpp index 3854d27567db..40ab32e4b364 100644 --- a/editor/plugins/sprite_editor_plugin.cpp +++ b/editor/plugins/sprite_editor_plugin.cpp @@ -33,7 +33,8 @@ #include "canvas_item_editor_plugin.h" #include "scene/2d/mesh_instance_2d.h" #include "scene/gui/box_container.h" -#include "thirdparty/misc/clipper.hpp" +#include "thirdparty/misc/clipper.h" +#include "thirdparty/misc/clipper_offset.h" void SpriteEditor::_node_removed(Node *p_node) { @@ -51,57 +52,51 @@ void SpriteEditor::edit(Sprite *p_sprite) { #define PRECISION 10.0 Vector expand(const Vector &points, const Rect2i &rect, float epsilon = 2.0) { + + using namespace clipperlib; + int size = points.size(); ERR_FAIL_COND_V(size < 2, Vector()); - ClipperLib::Path subj; - ClipperLib::PolyTree solution; - ClipperLib::PolyTree out; + Path subj; + Paths solution; + PolyPath out_closed; + Paths out_open; // ignored for (int i = 0; i < points.size(); i++) { - subj << ClipperLib::IntPoint(points[i].x * PRECISION, points[i].y * PRECISION); + subj << Point64(points[i].x * PRECISION, points[i].y * PRECISION); } - ClipperLib::ClipperOffset co; - co.AddPath(subj, ClipperLib::jtMiter, ClipperLib::etClosedPolygon); + ClipperOffset co; + co.AddPath(subj, kMiter, kPolygon); co.Execute(solution, epsilon * PRECISION); - ClipperLib::PolyNode *p = solution.GetFirst(); - - ERR_FAIL_COND_V(!p, points); + // Clamp into the specified rect + Clipper cl; + cl.AddPaths(solution, ptSubject); - while (p->IsHole()) { - p = p->GetNext(); - } + // Create the clipping rect + Path clamp; + clamp << Point64(0, 0); + clamp << Point64(rect.size.width * PRECISION, 0); + clamp << Point64(rect.size.width * PRECISION, rect.size.height * PRECISION); + clamp << Point64(0, rect.size.height * PRECISION); - //turn the result into simply polygon (AKA, fix overlap) - - //clamp into the specified rect - ClipperLib::Clipper cl; - cl.StrictlySimple(true); - cl.AddPath(p->Contour, ClipperLib::ptSubject, true); - //create the clipping rect - ClipperLib::Path clamp; - clamp.push_back(ClipperLib::IntPoint(0, 0)); - clamp.push_back(ClipperLib::IntPoint(rect.size.width * PRECISION, 0)); - clamp.push_back(ClipperLib::IntPoint(rect.size.width * PRECISION, rect.size.height * PRECISION)); - clamp.push_back(ClipperLib::IntPoint(0, rect.size.height * PRECISION)); - cl.AddPath(clamp, ClipperLib::ptClip, true); - cl.Execute(ClipperLib::ctIntersection, out); + cl.AddPath(clamp, ptClip); + cl.Execute(ctIntersection, out_closed, out_open); Vector outPoints; - ClipperLib::PolyNode *p2 = out.GetFirst(); - ERR_FAIL_COND_V(!p2, points); - while (p2->IsHole()) { - p2 = p2->GetNext(); - } + ERR_FAIL_COND_V(out_closed.ChildCount() == 0, points); + + // Root's children are always boundaries, not holes + const Path &outer = out_closed.GetChild(0).GetPath(); - int lasti = p2->Contour.size() - 1; - Vector2 prev = Vector2(p2->Contour[lasti].X / PRECISION, p2->Contour[lasti].Y / PRECISION); - for (unsigned int i = 0; i < p2->Contour.size(); i++) { + int lasti = outer.size() - 1; + Vector2 prev = Vector2(outer[lasti].x / PRECISION, outer[lasti].y / PRECISION); + for (unsigned int i = 0; i < outer.size(); i++) { - Vector2 cur = Vector2(p2->Contour[i].X / PRECISION, p2->Contour[i].Y / PRECISION); + Vector2 cur = Vector2(outer[i].x / PRECISION, outer[i].y / PRECISION); if (cur.distance_to(prev) > 0.5) { outPoints.push_back(cur); prev = cur; diff --git a/modules/clipper/SCsub b/modules/clipper/SCsub index 2fdf17407fc2..2e6526099f13 100644 --- a/modules/clipper/SCsub +++ b/modules/clipper/SCsub @@ -1,10 +1,24 @@ +#!/usr/bin/env python + Import('env') +Import('env_modules') + +env_clipper = env_modules.Clone() + +# Thirdparty source files +thirdparty_dir = "#thirdparty/misc/" +thirdparty_sources = [ + "clipper.cpp", + "clipper_offset.cpp", + "clipper_triangulation.cpp", +] +thirdparty_sources = [thirdparty_dir + file for file in thirdparty_sources] -module_env = env.Clone() +env_clipper.Append(CPPPATH=[thirdparty_dir]) -module_env.add_source_files(env.modules_sources,"*.cpp") -module_env.add_source_files(env.modules_sources,"lib/*.cpp") +env_thirdparty = env_clipper.Clone() +env_thirdparty.disable_warnings() +env_thirdparty.add_source_files(env.modules_sources, thirdparty_sources) -# Clipper library needs some C++11 features -# module_env.Append(CPPFLAGS=["-std=c++11"]) -# module_env.Append(CPPFLAGS=["-std=c++11", "-O2"]) +# Godot's own source files +env_clipper.add_source_files(env.modules_sources, "*.cpp") diff --git a/modules/clipper/clipper.cpp b/modules/clipper/clipper.cpp index b12878d7bda9..ae9efbd2d3cb 100644 --- a/modules/clipper/clipper.cpp +++ b/modules/clipper/clipper.cpp @@ -2,405 +2,405 @@ #define PRECISION 10000.0 -Clipper::Clipper(): mode(MODE_CLIP), - open(false), - fill_rule(cl::frEvenOdd), - path_type(cl::ptSubject), - join_type(cl::kSquare), - end_type(cl::kPolygon), - clip_type(cl::ctUnion), - delta(0.0) {} +Clipper::Clipper() : + mode(MODE_CLIP), + open(false), + fill_rule(cl::frEvenOdd), + path_type(cl::ptSubject), + join_type(cl::kSquare), + end_type(cl::kPolygon), + clip_type(cl::ctUnion), + delta(0.0) {} //------------------------------------------------------------------------------ // Clipping methods //------------------------------------------------------------------------------ -void Clipper::add_points(const Vector& points) { +void Clipper::add_points(const Vector &points) { - const cl::Path& path = _scale_up(points, PRECISION); + const cl::Path &path = _scale_up(points, PRECISION); - switch(mode) { + switch (mode) { - case MODE_CLIP: { - cl.AddPath(path, path_type, open); - } break; + case MODE_CLIP: { + cl.AddPath(path, path_type, open); + } break; - case MODE_OFFSET: { - co.AddPath(path, join_type, end_type); - } break; + case MODE_OFFSET: { + co.AddPath(path, join_type, end_type); + } break; - case MODE_TRIANGULATE: { - ct.AddPath(path, path_type, open); - } break; - } + case MODE_TRIANGULATE: { + ct.AddPath(path, path_type, open); + } break; + } } void Clipper::execute(bool build_hierarchy) { - ERR_EXPLAIN("Cannot build hierarchy outside of MODE_CLIP"); - ERR_FAIL_COND(build_hierarchy && mode != MODE_CLIP) + ERR_EXPLAIN("Cannot build hierarchy outside of MODE_CLIP"); + ERR_FAIL_COND(build_hierarchy && mode != MODE_CLIP) - switch(mode) { + switch (mode) { - case MODE_CLIP: { + case MODE_CLIP: { - if(build_hierarchy) { - cl.Execute(clip_type, root, solution_open, fill_rule); - _build_hierarchy(root); - } - else { - cl.Execute(clip_type, solution_closed, solution_open, fill_rule); - } - } break; + if (build_hierarchy) { + cl.Execute(clip_type, root, solution_open, fill_rule); + _build_hierarchy(root); + } else { + cl.Execute(clip_type, solution_closed, solution_open, fill_rule); + } + } break; - case MODE_OFFSET: { - co.Execute(solution_closed, delta * PRECISION); - } break; + case MODE_OFFSET: { + co.Execute(solution_closed, delta * PRECISION); + } break; - case MODE_TRIANGULATE: { - ct.Execute(clip_type, solution_closed, fill_rule); - } break; - } + case MODE_TRIANGULATE: { + ct.Execute(clip_type, solution_closed, fill_rule); + } break; + } } int Clipper::get_solution_count(SolutionType type) const { - switch(type) { + switch (type) { - case TYPE_CLOSED: { - return solution_closed.size(); - } break; + case TYPE_CLOSED: { + return solution_closed.size(); + } break; - case TYPE_OPEN: { - return solution_open.size(); - } break; - } - return -1; + case TYPE_OPEN: { + return solution_open.size(); + } break; + } + return -1; } Vector Clipper::get_solution(int idx, SolutionType type) { - switch(type) { + switch (type) { - case TYPE_CLOSED: { + case TYPE_CLOSED: { - ERR_EXPLAIN("Closed solution not found"); - ERR_FAIL_INDEX_V(idx, solution_closed.size(), Vector()); + ERR_EXPLAIN("Closed solution not found"); + ERR_FAIL_INDEX_V(idx, solution_closed.size(), Vector()); - return _scale_down(solution_closed[idx], PRECISION); - } break; + return _scale_down(solution_closed[idx], PRECISION); + } break; - case TYPE_OPEN: { + case TYPE_OPEN: { - ERR_EXPLAIN("Open solution not found"); - ERR_FAIL_INDEX_V(idx, solution_open.size(), Vector()); + ERR_EXPLAIN("Open solution not found"); + ERR_FAIL_INDEX_V(idx, solution_open.size(), Vector()); - return _scale_down(solution_open[idx], PRECISION); - } break; - } - return Vector(); + return _scale_down(solution_open[idx], PRECISION); + } break; + } + return Vector(); } Rect2 Clipper::get_bounds() { - ERR_EXPLAIN("Cannot get bounds in MODE_OFFSET"); - ERR_FAIL_COND_V(mode == MODE_OFFSET, Rect2()); + ERR_EXPLAIN("Cannot get bounds in MODE_OFFSET"); + ERR_FAIL_COND_V(mode == MODE_OFFSET, Rect2()); - cl::Rect64 b(0,0,0,0); + cl::Rect64 b(0, 0, 0, 0); - switch(mode) { + switch (mode) { - case MODE_CLIP: { - b = cl.GetBounds(); - } break; + case MODE_CLIP: { + b = cl.GetBounds(); + } break; - case MODE_TRIANGULATE: { - b = ct.GetBounds(); - } break; - } + case MODE_TRIANGULATE: { + b = ct.GetBounds(); + } break; + } - cl::Point64 pos(b.left, b.top); - cl::Point64 size(b.right - b.left, b.bottom - b.top); + cl::Point64 pos(b.left, b.top); + cl::Point64 size(b.right - b.left, b.bottom - b.top); - Rect2 bounds( - static_cast(pos.x) / PRECISION, - static_cast(pos.y) / PRECISION, - static_cast(size.x) / PRECISION, - static_cast(size.y) / PRECISION - ); - return bounds; + Rect2 bounds( + static_cast(pos.x) / PRECISION, + static_cast(pos.y) / PRECISION, + static_cast(size.x) / PRECISION, + static_cast(size.y) / PRECISION); + + return bounds; } void Clipper::clear() { - solution_closed.clear(); - solution_open.clear(); + solution_closed.clear(); + solution_open.clear(); - root.Clear(); - polypaths.clear(); - path_map.clear(); + root.Clear(); + polypaths.clear(); + path_map.clear(); - cl.Clear(); - co.Clear(); - ct.Clear(); + cl.Clear(); + co.Clear(); + ct.Clear(); } Vector Clipper::get_hierarchy(int idx) { - ERR_FAIL_INDEX_V(idx, polypaths.size(), Vector()); + ERR_FAIL_INDEX_V(idx, polypaths.size(), Vector()); - // Returns indices to parent and children of the selected solution + // Returns indices to parent and children of the selected solution - Vector hierarchy; - cl::PolyPath* path = polypaths[idx]; + Vector hierarchy; + cl::PolyPath *path = polypaths[idx]; - // Parent - cl::PolyPath* parent = path->GetParent(); - hierarchy.push_back( path_map[parent] ); + // Parent + cl::PolyPath *parent = path->GetParent(); + hierarchy.push_back(path_map[parent]); - // Children - for(int c = 0; c < path->ChildCount(); ++c) { + // Children + for (int c = 0; c < path->ChildCount(); ++c) { - cl::PolyPath& child = path->GetChild(c); - hierarchy.push_back( path_map[&child] ); - } - return hierarchy; + cl::PolyPath &child = path->GetChild(c); + hierarchy.push_back(path_map[&child]); + } + return hierarchy; } Vector Clipper::get_parent(int idx) { - ERR_FAIL_INDEX_V(idx, polypaths.size(), Vector()); + ERR_FAIL_INDEX_V(idx, polypaths.size(), Vector()); - cl::PolyPath* path = polypaths[idx]; - cl::PolyPath* parent = path->GetParent(); + cl::PolyPath *path = polypaths[idx]; + cl::PolyPath *parent = path->GetParent(); - return _scale_down(parent->GetPath(), PRECISION); + return _scale_down(parent->GetPath(), PRECISION); } Vector Clipper::get_child(int idx, int child_idx) { - ERR_FAIL_INDEX_V(idx, polypaths.size(), Vector()); - ERR_FAIL_INDEX_V(child_idx, polypaths[idx]->ChildCount(), Vector()); + ERR_FAIL_INDEX_V(idx, polypaths.size(), Vector()); + ERR_FAIL_INDEX_V(child_idx, polypaths[idx]->ChildCount(), Vector()); - cl::PolyPath* path = polypaths[idx]; - cl::PolyPath& child = path->GetChild(child_idx); + cl::PolyPath *path = polypaths[idx]; + cl::PolyPath &child = path->GetChild(child_idx); - return _scale_down(child.GetPath(), PRECISION); + return _scale_down(child.GetPath(), PRECISION); } int Clipper::get_child_count(int idx) { - ERR_FAIL_INDEX_V(idx, polypaths.size(), -1); + ERR_FAIL_INDEX_V(idx, polypaths.size(), -1); - cl::PolyPath* path = polypaths[idx]; + cl::PolyPath *path = polypaths[idx]; - return path->ChildCount(); + return path->ChildCount(); } Array Clipper::get_children(int idx) { - ERR_FAIL_INDEX_V(idx, polypaths.size(), Array()); + ERR_FAIL_INDEX_V(idx, polypaths.size(), Array()); - cl::PolyPath* path = polypaths[idx]; + cl::PolyPath *path = polypaths[idx]; - Array children; + Array children; - for(int c = 0; c < path->ChildCount(); ++c) { + for (int c = 0; c < path->ChildCount(); ++c) { - cl::PolyPath& child = path->GetChild(c); - children.push_back( _scale_down(child.GetPath(), PRECISION) ); - } - return children; + cl::PolyPath &child = path->GetChild(c); + children.push_back(_scale_down(child.GetPath(), PRECISION)); + } + return children; } bool Clipper::is_hole(int idx) { - ERR_FAIL_INDEX_V(idx, polypaths.size(), false); + ERR_FAIL_INDEX_V(idx, polypaths.size(), false); - cl::PolyPath* path = polypaths[idx]; + cl::PolyPath *path = polypaths[idx]; - return path->IsHole(); + return path->IsHole(); } + //------------------------------------------------------------------------------ -void Clipper::_build_hierarchy(cl::PolyPath& p_root) { - solution_closed.clear(); - polypaths.clear(); +void Clipper::_build_hierarchy(cl::PolyPath &p_root) { + + solution_closed.clear(); + polypaths.clear(); - List to_visit; - to_visit.push_back(&p_root); + List to_visit; + to_visit.push_back(&p_root); - for(int idx = -1; !to_visit.empty(); ++idx) { + for (int idx = -1; !to_visit.empty(); ++idx) { - cl::PolyPath* parent = to_visit.back()->get(); - to_visit.pop_back(); + cl::PolyPath *parent = to_visit.back()->get(); + to_visit.pop_back(); - for(int c = 0; c < parent->ChildCount(); ++c) { + for (int c = 0; c < parent->ChildCount(); ++c) { - cl::PolyPath& child = parent->GetChild(c); - to_visit.push_back(&child); - } - // Ignore root (used as container only, has no boundary) - if(idx != -1) { - // Rely on order - solution_closed.push_back(parent->GetPath()); - polypaths.push_back(parent); - path_map[parent] = idx; - } - } + cl::PolyPath &child = parent->GetChild(c); + to_visit.push_back(&child); + } + // Ignore root (used as container only, has no boundary) + if (idx != -1) { + // Rely on order + solution_closed.push_back(parent->GetPath()); + polypaths.push_back(parent); + path_map[parent] = idx; + } + } } void Clipper::set_mode(ClipMode p_mode, bool reuse_solution) { - if(mode == p_mode) - return; + if (mode == p_mode) + return; - mode = p_mode; + mode = p_mode; - if(reuse_solution) { + if (reuse_solution) { - // Transfer resulted solution from previous execution - switch(mode) { + // Transfer resulted solution from previous execution + switch (mode) { - case MODE_CLIP: { - cl.AddPaths(solution_closed, path_type, false); - cl.AddPaths(solution_open, path_type, true); - } break; + case MODE_CLIP: { + cl.AddPaths(solution_closed, path_type, false); + cl.AddPaths(solution_open, path_type, true); + } break; - case MODE_OFFSET: { - co.AddPaths(solution_closed, join_type, end_type); - } break; + case MODE_OFFSET: { + co.AddPaths(solution_closed, join_type, end_type); + } break; - case MODE_TRIANGULATE: { - ct.AddPaths(solution_closed, path_type, false); - } break; - } - } + case MODE_TRIANGULATE: { + ct.AddPaths(solution_closed, path_type, false); + } break; + } + } } -_FORCE_INLINE_ cl::Path Clipper::_scale_up(const Vector& points, real_t scale) { +_FORCE_INLINE_ cl::Path Clipper::_scale_up(const Vector &points, real_t scale) { - cl::Path path; - path.resize(points.size()); + cl::Path path; + path.resize(points.size()); - for(int i = 0; i != points.size(); ++i) { - path[i] = cl::Point64( - points[i].x * scale, - points[i].y * scale - ); - } - return path; + for (int i = 0; i != points.size(); ++i) { + path[i] = cl::Point64( + points[i].x * scale, + points[i].y * scale); + } + return path; } -_FORCE_INLINE_ Vector Clipper::_scale_down(const cl::Path& path, real_t scale) { +_FORCE_INLINE_ Vector Clipper::_scale_down(const cl::Path &path, real_t scale) { - Vector points; - points.resize(path.size()); + Vector points; + points.resize(path.size()); - for(int i = 0; i != path.size(); ++i) { - points.write[i] = Point2( - static_cast(path[i].x) / scale, - static_cast(path[i].y) / scale - ); - } - return points; + for (int i = 0; i != path.size(); ++i) { + points.write[i] = Point2( + static_cast(path[i].x) / scale, + static_cast(path[i].y) / scale); + } + return points; } void Clipper::_bind_methods() { -//------------------------------------------------------------------------------ -// Clipper methods -//------------------------------------------------------------------------------ - - ClassDB::bind_method(D_METHOD("add_points", "points"), &Clipper::add_points); - ClassDB::bind_method(D_METHOD("execute", "build_hierarchy"), &Clipper::execute, DEFVAL(false)); - - ClassDB::bind_method(D_METHOD("get_solution_count", "type"), &Clipper::get_solution_count, DEFVAL(TYPE_CLOSED)); - ClassDB::bind_method(D_METHOD("get_solution", "index", "type"), &Clipper::get_solution, DEFVAL(TYPE_CLOSED)); - - ClassDB::bind_method(D_METHOD("get_bounds"), &Clipper::get_bounds); - ClassDB::bind_method(D_METHOD("clear"), &Clipper::clear); - - // Hierarchy - ClassDB::bind_method(D_METHOD("get_child_count", "idx"), &Clipper::get_child_count); - ClassDB::bind_method(D_METHOD("get_child", "idx", "child_idx"), &Clipper::get_child); - ClassDB::bind_method(D_METHOD("get_children", "idx"), &Clipper::get_children); - ClassDB::bind_method(D_METHOD("get_parent", "idx"), &Clipper::get_parent); - ClassDB::bind_method(D_METHOD("is_hole", "idx"), &Clipper::is_hole); - ClassDB::bind_method(D_METHOD("get_hierarchy", "idx"), &Clipper::get_hierarchy); - - ADD_PROPERTY(PropertyInfo(Variant::RECT2, "bounds"), "", "get_bounds"); - -//------------------------------------------------------------------------------ -// Configuration methods -//------------------------------------------------------------------------------ - ClassDB::bind_method(D_METHOD("set_mode", "mode", "reuse_solution"), &Clipper::set_mode, DEFVAL(true)); - ClassDB::bind_method(D_METHOD("get_mode"), &Clipper::get_mode); - - ClassDB::bind_method(D_METHOD("set_open", "is_open"), &Clipper::set_open); - ClassDB::bind_method(D_METHOD("is_open"), &Clipper::is_open); - - ClassDB::bind_method(D_METHOD("set_path_type", "path_type"), &Clipper::set_path_type); - ClassDB::bind_method(D_METHOD("get_path_type"), &Clipper::get_path_type); - - ClassDB::bind_method(D_METHOD("set_clip_type", "clip_type"), &Clipper::set_clip_type); - ClassDB::bind_method(D_METHOD("get_clip_type"), &Clipper::get_clip_type); - - ClassDB::bind_method(D_METHOD("set_fill_rule", "fill_rule"), &Clipper::set_fill_rule); - ClassDB::bind_method(D_METHOD("get_fill_rule"), &Clipper::get_fill_rule); - - ClassDB::bind_method(D_METHOD("set_join_type", "join_type"), &Clipper::set_join_type); - ClassDB::bind_method(D_METHOD("get_join_type"), &Clipper::get_join_type); - - ClassDB::bind_method(D_METHOD("set_end_type", "end_type"), &Clipper::set_end_type); - ClassDB::bind_method(D_METHOD("get_end_type"), &Clipper::get_clip_type); - - ClassDB::bind_method(D_METHOD("set_delta", "delta"), &Clipper::set_delta); - ClassDB::bind_method(D_METHOD("get_delta"), &Clipper::get_delta); - - ADD_PROPERTY(PropertyInfo(Variant::INT, "mode"), "", "get_mode"); - ADD_PROPERTY(PropertyInfo(Variant::BOOL, "open"), "set_open", "is_open"); - ADD_PROPERTY(PropertyInfo(Variant::INT, "path_type"), "set_path_type", "get_path_type"); - ADD_PROPERTY(PropertyInfo(Variant::INT, "clip_type"), "set_clip_type", "get_clip_type"); - ADD_PROPERTY(PropertyInfo(Variant::INT, "fill_rule"), "set_fill_rule", "get_fill_rule"); - ADD_PROPERTY(PropertyInfo(Variant::INT, "end_type"), "set_end_type", "get_end_type"); - ADD_PROPERTY(PropertyInfo(Variant::INT, "join_type"), "set_join_type", "get_join_type"); - ADD_PROPERTY(PropertyInfo(Variant::REAL, "delta"), "set_delta", "get_delta"); - -//------------------------------------------------------------------------------ -// Enums -//------------------------------------------------------------------------------ - using namespace clipperlib; - // Use namespace declaration to avoid having - // prepended namespace name in enum constants - BIND_ENUM_CONSTANT(MODE_CLIP); - BIND_ENUM_CONSTANT(MODE_OFFSET); - BIND_ENUM_CONSTANT(MODE_TRIANGULATE); - - BIND_ENUM_CONSTANT(TYPE_CLOSED); - BIND_ENUM_CONSTANT(TYPE_OPEN); - - BIND_ENUM_CONSTANT(ctNone); - BIND_ENUM_CONSTANT(ctIntersection); - BIND_ENUM_CONSTANT(ctUnion); - BIND_ENUM_CONSTANT(ctDifference); - BIND_ENUM_CONSTANT(ctXor); - - BIND_ENUM_CONSTANT(ptSubject); - BIND_ENUM_CONSTANT(ptClip); - - BIND_ENUM_CONSTANT(frEvenOdd); - BIND_ENUM_CONSTANT(frNonZero); - BIND_ENUM_CONSTANT(frPositive); - BIND_ENUM_CONSTANT(frNegative); - - BIND_ENUM_CONSTANT(kSquare); - BIND_ENUM_CONSTANT(kRound); - BIND_ENUM_CONSTANT(kMiter); - - BIND_ENUM_CONSTANT(kPolygon); - BIND_ENUM_CONSTANT(kOpenJoined); - BIND_ENUM_CONSTANT(kOpenButt); - BIND_ENUM_CONSTANT(kOpenSquare); - BIND_ENUM_CONSTANT(kOpenRound); + //-------------------------------------------------------------------------- + // Clipper methods + //-------------------------------------------------------------------------- + + ClassDB::bind_method(D_METHOD("add_points", "points"), &Clipper::add_points); + ClassDB::bind_method(D_METHOD("execute", "build_hierarchy"), &Clipper::execute, DEFVAL(false)); + + ClassDB::bind_method(D_METHOD("get_solution_count", "type"), &Clipper::get_solution_count, DEFVAL(TYPE_CLOSED)); + ClassDB::bind_method(D_METHOD("get_solution", "index", "type"), &Clipper::get_solution, DEFVAL(TYPE_CLOSED)); + + ClassDB::bind_method(D_METHOD("get_bounds"), &Clipper::get_bounds); + ClassDB::bind_method(D_METHOD("clear"), &Clipper::clear); + + // Hierarchy + ClassDB::bind_method(D_METHOD("get_child_count", "idx"), &Clipper::get_child_count); + ClassDB::bind_method(D_METHOD("get_child", "idx", "child_idx"), &Clipper::get_child); + ClassDB::bind_method(D_METHOD("get_children", "idx"), &Clipper::get_children); + ClassDB::bind_method(D_METHOD("get_parent", "idx"), &Clipper::get_parent); + ClassDB::bind_method(D_METHOD("is_hole", "idx"), &Clipper::is_hole); + ClassDB::bind_method(D_METHOD("get_hierarchy", "idx"), &Clipper::get_hierarchy); + + ADD_PROPERTY(PropertyInfo(Variant::RECT2, "bounds"), "", "get_bounds"); + + //-------------------------------------------------------------------------- + // Configuration methods + //-------------------------------------------------------------------------- + ClassDB::bind_method(D_METHOD("set_mode", "mode", "reuse_solution"), &Clipper::set_mode, DEFVAL(true)); + ClassDB::bind_method(D_METHOD("get_mode"), &Clipper::get_mode); + + ClassDB::bind_method(D_METHOD("set_open", "is_open"), &Clipper::set_open); + ClassDB::bind_method(D_METHOD("is_open"), &Clipper::is_open); + + ClassDB::bind_method(D_METHOD("set_path_type", "path_type"), &Clipper::set_path_type); + ClassDB::bind_method(D_METHOD("get_path_type"), &Clipper::get_path_type); + + ClassDB::bind_method(D_METHOD("set_clip_type", "clip_type"), &Clipper::set_clip_type); + ClassDB::bind_method(D_METHOD("get_clip_type"), &Clipper::get_clip_type); + + ClassDB::bind_method(D_METHOD("set_fill_rule", "fill_rule"), &Clipper::set_fill_rule); + ClassDB::bind_method(D_METHOD("get_fill_rule"), &Clipper::get_fill_rule); + + ClassDB::bind_method(D_METHOD("set_join_type", "join_type"), &Clipper::set_join_type); + ClassDB::bind_method(D_METHOD("get_join_type"), &Clipper::get_join_type); + + ClassDB::bind_method(D_METHOD("set_end_type", "end_type"), &Clipper::set_end_type); + ClassDB::bind_method(D_METHOD("get_end_type"), &Clipper::get_clip_type); + + ClassDB::bind_method(D_METHOD("set_delta", "delta"), &Clipper::set_delta); + ClassDB::bind_method(D_METHOD("get_delta"), &Clipper::get_delta); + + ADD_PROPERTY(PropertyInfo(Variant::INT, "mode"), "", "get_mode"); + ADD_PROPERTY(PropertyInfo(Variant::BOOL, "open"), "set_open", "is_open"); + ADD_PROPERTY(PropertyInfo(Variant::INT, "path_type"), "set_path_type", "get_path_type"); + ADD_PROPERTY(PropertyInfo(Variant::INT, "clip_type"), "set_clip_type", "get_clip_type"); + ADD_PROPERTY(PropertyInfo(Variant::INT, "fill_rule"), "set_fill_rule", "get_fill_rule"); + ADD_PROPERTY(PropertyInfo(Variant::INT, "end_type"), "set_end_type", "get_end_type"); + ADD_PROPERTY(PropertyInfo(Variant::INT, "join_type"), "set_join_type", "get_join_type"); + ADD_PROPERTY(PropertyInfo(Variant::REAL, "delta"), "set_delta", "get_delta"); + + //-------------------------------------------------------------------------- + // Enums + //-------------------------------------------------------------------------- + using namespace clipperlib; + // Use namespace declaration to avoid having + // prepended namespace name in enum constants + BIND_ENUM_CONSTANT(MODE_CLIP); + BIND_ENUM_CONSTANT(MODE_OFFSET); + BIND_ENUM_CONSTANT(MODE_TRIANGULATE); + + BIND_ENUM_CONSTANT(TYPE_CLOSED); + BIND_ENUM_CONSTANT(TYPE_OPEN); + + BIND_ENUM_CONSTANT(ctNone); + BIND_ENUM_CONSTANT(ctIntersection); + BIND_ENUM_CONSTANT(ctUnion); + BIND_ENUM_CONSTANT(ctDifference); + BIND_ENUM_CONSTANT(ctXor); + + BIND_ENUM_CONSTANT(ptSubject); + BIND_ENUM_CONSTANT(ptClip); + + BIND_ENUM_CONSTANT(frEvenOdd); + BIND_ENUM_CONSTANT(frNonZero); + BIND_ENUM_CONSTANT(frPositive); + BIND_ENUM_CONSTANT(frNegative); + + BIND_ENUM_CONSTANT(kSquare); + BIND_ENUM_CONSTANT(kRound); + BIND_ENUM_CONSTANT(kMiter); + + BIND_ENUM_CONSTANT(kPolygon); + BIND_ENUM_CONSTANT(kOpenJoined); + BIND_ENUM_CONSTANT(kOpenButt); + BIND_ENUM_CONSTANT(kOpenSquare); + BIND_ENUM_CONSTANT(kOpenRound); } diff --git a/modules/clipper/clipper.h b/modules/clipper/clipper.h index 7db43abb85e2..0bc18113473f 100644 --- a/modules/clipper/clipper.h +++ b/modules/clipper/clipper.h @@ -1,117 +1,116 @@ -#ifndef GODOT_CLIPPER2_HPP -#define GODOT_CLIPPER2_HPP +#ifndef CLIPPER2_H +#define CLIPPER2_H #include "core/reference.h" -#include "lib/clipper.h" -#include "lib/clipper_offset.h" -#include "lib/clipper_triangulation.h" +#include "thirdparty/misc/clipper.h" +#include "thirdparty/misc/clipper_offset.h" +#include "thirdparty/misc/clipper_triangulation.h" namespace cl = clipperlib; enum ClipMode { - MODE_CLIP, - MODE_OFFSET, - MODE_TRIANGULATE + MODE_CLIP, + MODE_OFFSET, + MODE_TRIANGULATE }; enum SolutionType { - TYPE_CLOSED, - TYPE_OPEN + TYPE_CLOSED, + TYPE_OPEN }; class Clipper : public Reference { - GDCLASS(Clipper, Reference); + GDCLASS(Clipper, Reference); public: - Clipper(); + Clipper(); -//------------------------------------------------------------------------------ -// Clipping methods -//------------------------------------------------------------------------------ + //-------------------------------------------------------------------------- + // Clipping methods + //-------------------------------------------------------------------------- + void add_points(const Vector &points); + void execute(bool build_hierarchy = false); - void add_points(const Vector& points); - void execute(bool build_hierarchy = false); + int get_solution_count(SolutionType type = TYPE_CLOSED) const; + Vector get_solution(int idx, SolutionType type = TYPE_CLOSED); - int get_solution_count(SolutionType type = TYPE_CLOSED) const; - Vector get_solution(int idx, SolutionType type = TYPE_CLOSED); + Rect2 get_bounds(); + void clear(); - Rect2 get_bounds(); - void clear(); + // Hierarchy + Vector get_hierarchy(int idx); - // Hierarchy - Vector get_hierarchy(int idx); + Vector get_parent(int idx); + Vector get_child(int idx, int child_idx); + int get_child_count(int idx); + Array get_children(int idx); - Vector get_parent(int idx); - Vector get_child(int idx, int child_idx); - int get_child_count(int idx); - Array get_children(int idx); + bool is_hole(int idx); - bool is_hole(int idx); + //-------------------------------------------------------------------------- + // Configuration methods + //-------------------------------------------------------------------------- -//------------------------------------------------------------------------------ -// Configuration methods -//------------------------------------------------------------------------------ + // Path and execute configuration, define these before adding new paths + // Each path added will have the same configuration as the previous one + // -------------------------------------------------------------------- + void set_mode(ClipMode p_mode, bool reuse_solution = true); + ClipMode get_mode() const { return mode; } - // Path and execute configuration, define these before adding new paths - // Each path added will have the same configuration as the previous one - // -------------------------------------------------------------------- - void set_mode(ClipMode p_mode, bool reuse_solution = true); - ClipMode get_mode() const { return mode; } + void set_open(bool p_is_open) { open = p_is_open; } + bool is_open() const { return open; } - void set_open(bool p_is_open) { open = p_is_open; } - bool is_open() const { return open; } + void set_path_type(cl::PathType p_path_type) { path_type = p_path_type; } + cl::PathType get_path_type() const { return path_type; } - void set_path_type(cl::PathType p_path_type) { path_type = p_path_type; } - cl::PathType get_path_type() const { return path_type; } + void set_clip_type(cl::ClipType p_clip_type) { clip_type = p_clip_type; } + cl::ClipType get_clip_type() const { return clip_type; } - void set_clip_type(cl::ClipType p_clip_type) { clip_type = p_clip_type; } - cl::ClipType get_clip_type() const { return clip_type; } + void set_fill_rule(cl::FillRule p_fill_rule) { fill_rule = p_fill_rule; } + cl::FillRule get_fill_rule() const { return fill_rule; } - void set_fill_rule(cl::FillRule p_fill_rule) { fill_rule = p_fill_rule; } - cl::FillRule get_fill_rule() const { return fill_rule; } + // Only relevant in MODE_OFFSET + // ---------------------------- + void set_join_type(cl::JoinType p_join_type) { join_type = p_join_type; } + cl::JoinType get_join_type() const { return join_type; } - // Only relevant in MODE_OFFSET - // ---------------------------- - void set_join_type(cl::JoinType p_join_type) { join_type = p_join_type; } - cl::JoinType get_join_type() const { return join_type; } + void set_end_type(cl::EndType p_end_type) { end_type = p_end_type; } + cl::EndType get_end_type() const { return end_type; } - void set_end_type(cl::EndType p_end_type) { end_type = p_end_type; } - cl::EndType get_end_type() const { return end_type; } + void set_delta(real_t p_delta) { delta = p_delta; } + real_t get_delta() const { return delta; } - void set_delta(real_t p_delta) { delta = p_delta; } - real_t get_delta() const { return delta; } - -//------------------------------------------------------------------------------ + //-------------------------------------------------------------------------- protected: - static void _bind_methods(); + static void _bind_methods(); - cl::Path _scale_up(const Vector& points, real_t scale); - Vector _scale_down(const cl::Path& path, real_t scale); + cl::Path _scale_up(const Vector &points, real_t scale); + Vector _scale_down(const cl::Path &path, real_t scale); - void _build_hierarchy(cl::PolyPath& p_root); + void _build_hierarchy(cl::PolyPath &p_root); private: - bool open; - cl::PathType path_type; - cl::ClipType clip_type; - cl::FillRule fill_rule; - cl::JoinType join_type; - cl::EndType end_type; - real_t delta; - - ClipMode mode; - - cl::Paths solution_closed; - cl::Paths solution_open; - - cl::PolyPath root; - Vector polypaths; - Map path_map; - - cl::Clipper cl; - cl::ClipperOffset co; - cl::ClipperTri ct; + bool open; + cl::PathType path_type; + cl::ClipType clip_type; + cl::FillRule fill_rule; + cl::JoinType join_type; + cl::EndType end_type; + real_t delta; + + ClipMode mode; + + cl::Paths solution_closed; + cl::Paths solution_open; + + cl::PolyPath root; + Vector polypaths; + Map path_map; + + cl::Clipper cl; + cl::ClipperOffset co; + cl::ClipperTri ct; }; VARIANT_ENUM_CAST(ClipMode); diff --git a/modules/clipper/lib/LICENSE.md b/modules/clipper/lib/LICENSE.md deleted file mode 100644 index 5debeca16e3c..000000000000 --- a/modules/clipper/lib/LICENSE.md +++ /dev/null @@ -1,27 +0,0 @@ -The Clipper code library, the "Software" (that includes Delphi, C++ & C# -source code, accompanying samples and documentation), has been released -under the following license, terms and conditions: - -# Boost Software License - Version 1.0 - August 17th, 2003 - -Permission is hereby granted, free of charge, to any person or organization -obtaining a copy of the software and accompanying documentation covered by -this license (the "Software") to use, reproduce, display, distribute, -execute, and transmit the Software, and to prepare derivative works of the -Software, and to permit third-parties to whom the Software is furnished to -do so, all subject to the following: - -The copyright notices in the Software and this entire statement, including -the above license grant, this restriction and the following disclaimer, -must be included in all copies of the Software, in whole or in part, and -all derivative works of the Software, unless such copies or derivative -works are solely in the form of machine-executable object code generated by -a source language processor. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT -SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE -FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE, -ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER -DEALINGS IN THE SOFTWARE. \ No newline at end of file diff --git a/modules/clipper/lib/clipper.cpp b/modules/clipper/lib/clipper.cpp deleted file mode 100644 index 00b283d347cb..000000000000 --- a/modules/clipper/lib/clipper.cpp +++ /dev/null @@ -1,1920 +0,0 @@ -/******************************************************************************* -* Author : Angus Johnson * -* Version : 10.0 (beta) * -* Date : 8 Noveber 2017 * -* Website : http://www.angusj.com * -* Copyright : Angus Johnson 2010-2017 * -* Purpose : Base clipping module * -* License : http://www.boost.org/LICENSE_1_0.txt * -*******************************************************************************/ - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include "clipper.h" - -#include - -namespace clipperlib { - - enum VertexFlags { vfNone = 0, vfOpenStart = 1, vfOpenEnd = 2, vfLocalMax = 4, vfLocMin = 8 }; - inline VertexFlags operator|(VertexFlags a, VertexFlags b) { - return static_cast(static_cast(a) | static_cast(b)); - } - inline VertexFlags& operator |=(VertexFlags& a, VertexFlags b) { return a = a | b; } - - struct Vertex { - Point64 pt; - Vertex *next; - Vertex *prev; - VertexFlags flags; - }; - - struct LocalMinima { - Vertex *vertex; - PathType polytype; - bool is_open; - }; - - struct Scanline { - int64_t y; - Scanline *next; - }; - - struct IntersectNode { - Point64 pt; - Active *edge1; - Active *edge2; - }; - - struct LocMinSorter { - inline bool operator()(const LocalMinima* locMin1, const LocalMinima* locMin2) { - return locMin2->vertex->pt.y < locMin1->vertex->pt.y; - } - }; - - //------------------------------------------------------------------------------ - // PolyPath methods ... - //------------------------------------------------------------------------------ - - void PolyPath::Clear() - { - for (size_t i = 0; i < childs_.size(); ++i) { - childs_[i]->Clear(); - delete childs_[i]; - } - childs_.resize(0); - } - //------------------------------------------------------------------------------ - - PolyPath::PolyPath() - { - parent_ = nullptr; - } - //------------------------------------------------------------------------------ - - PolyPath::PolyPath(PolyPath *parent, const Path &path) - { - parent_ = parent; - path_ = path; - } - //------------------------------------------------------------------------------ - - int PolyPath::ChildCount() const { return (int)childs_.size(); } - - //------------------------------------------------------------------------------ - - PolyPath& PolyPath::AddChild(const Path &path) - { - PolyPath* child = new PolyPath(this, path); - childs_.push_back(child); - return *child; - } - //------------------------------------------------------------------------------ - - PolyPath& PolyPath::GetChild(unsigned index) - { - if (index < 0 || index >= childs_.size()) - throw ClipperException("invalid range in PolyPath::GetChild."); - return *childs_[index]; - } - //------------------------------------------------------------------------------ - - PolyPath* PolyPath::GetParent() const { return parent_; } - - //------------------------------------------------------------------------------ - Path &PolyPath::GetPath() { return path_; } - - //------------------------------------------------------------------------------ - bool PolyPath::IsHole() const - { - bool result = true; - PolyPath* pp = parent_; - while (pp) { - result = !result; - pp = pp->parent_; - } - return result; - } - - //------------------------------------------------------------------------------ - // miscellaneous functions ... - //------------------------------------------------------------------------------ - - inline int64_t Round(double val) - { - if ((val < 0)) return static_cast(val - 0.5); - else return static_cast(val + 0.5); - } - //------------------------------------------------------------------------------ - - inline double Abs(double val) { return val < 0 ? -val : val; } - //------------------------------------------------------------------------------ - - inline int Abs(int val) { return val < 0 ? -val : val; } - //------------------------------------------------------------------------------ - - inline bool IsOdd(int val) { return val & 1 ? true : false; } - //------------------------------------------------------------------------------ - - inline bool IsHotEdge(const Active &e) { return (e.outrec); } - //------------------------------------------------------------------------------ - - inline bool IsOpen(const Active &e) { return (e.local_min->is_open); } - //------------------------------------------------------------------------------ - - inline bool IsStartSide(const Active &e) { return (&e == e.outrec->start_e); } - //------------------------------------------------------------------------------ - - inline void SwapSides(OutRec &outrec) - { - Active *e2 = outrec.start_e; - outrec.start_e = outrec.end_e; - outrec.end_e = e2; - outrec.pts = outrec.pts->next; - } - //------------------------------------------------------------------------------ - - bool FixOrientation(Active &e) - { - bool result = true; - Active* e2 = &e; - while (e2->prev_in_ael) { - e2 = e2->prev_in_ael; - if (e2->outrec && !IsOpen(*e2)) result = !result; - } - if (result != IsStartSide(e)) { - if (result) e.outrec->flag = orOuter; - else e.outrec->flag = orInner; - SwapSides(*e.outrec); - return true; //all fixed - } - else return false; //no fix needed - } - //------------------------------------------------------------------------------ - - inline bool IsHorizontal(const Active &e) { return (e.dx == CLIPPER_HORIZONTAL); } - //------------------------------------------------------------------------------ - - inline int64_t TopX(const Active &edge, const int64_t currentY) - { - return (currentY == edge.top.y) ? - edge.top.x : - edge.bot.x + Round(edge.dx *(currentY - edge.bot.y)); - } - //------------------------------------------------------------------------------ - - inline int64_t GetTopDeltaX(const Active &e1, const Active &e2) - { - return (e1.top.y > e2.top.y) ? - TopX(e2, e1.top.y) - e1.top.x : - e2.top.x - TopX(e1, e2.top.y); - } - //---------------------------------------------------------------------------- - - inline void SwapActives(Active *&e1, Active *&e2) { - Active *e = e1; e1 = e2; e2 = e; - } - //---------------------------------------------------------------------- - - inline void MoveEdgeToFollowLeftInAEL(Active &e, Active &eLeft) - { - Active *aelPrev, *aelNext; - //extract first ... - aelPrev = e.prev_in_ael; - aelNext = e.next_in_ael; - aelPrev->next_in_ael = aelNext; - if (aelNext) aelNext->prev_in_ael = aelPrev; - //now reinsert ... - e.next_in_ael = eLeft.next_in_ael; - eLeft.next_in_ael->prev_in_ael = &e; - e.prev_in_ael = &eLeft; - eLeft.next_in_ael = &e; - } - //---------------------------------------------------------------------------- - - inline bool E2InsertsBeforeE1(const Active &e1, const Active &e2, bool prefer_left) - { - if (prefer_left) { - return e2.curr.x == e1.curr.x ? - GetTopDeltaX(e1, e2) < 0 : e2.curr.x < e1.curr.x; - } - else - return e2.curr.x == e1.curr.x ? - GetTopDeltaX(e1, e2) <= 0 : e2.curr.x <= e1.curr.x; - } - //------------------------------------------------------------------------------ - - inline PathType GetPolyType(const Active &e) { return e.local_min->polytype; } - //------------------------------------------------------------------------------ - - inline bool IsSamePolyType(const Active &e1, const Active &e2) - { - return e1.local_min->polytype == e2.local_min->polytype; - } - //------------------------------------------------------------------------------ - - Point64 GetIntersectPoint(const Active &e1, const Active &e2) - { - double b1, b2; - if (e1.dx == e2.dx) return Point64(TopX(e1, e1.curr.y), e1.curr.y); - - if (e1.dx == 0) { - if (IsHorizontal(e2)) return Point64(e1.bot.x, e2.bot.y); - b2 = e2.bot.y - (e2.bot.x / e2.dx); - return Point64(e1.bot.x, Round(e1.bot.x / e2.dx + b2)); - } - else if (e2.dx == 0) { - if (IsHorizontal(e1)) return Point64(e2.bot.x, e1.bot.y); - b1 = e1.bot.y - (e1.bot.x / e1.dx); - return Point64(e2.bot.x, Round(e2.bot.x / e1.dx + b1)); - } - else { - b1 = e1.bot.x - e1.bot.y * e1.dx; - b2 = e2.bot.x - e2.bot.y * e2.dx; - double q = (b2 - b1) / (e1.dx - e2.dx); - return (std::fabs(e1.dx) < std::fabs(e2.dx)) ? - Point64(Round(e1.dx * q + b1), Round(q)) : - Point64(Round(e2.dx * q + b2), Round(q)); - } - } - //------------------------------------------------------------------------------ - - inline void SetDx(Active &e) - { - int64_t dy = (e.top.y - e.bot.y); - e.dx = (dy == 0) ? CLIPPER_HORIZONTAL : (double)(e.top.x - e.bot.x) / dy; - } - //--------------------------------------------------------------------------- - - inline Vertex& NextVertex(Active &e) - { - return (e.wind_dx > 0 ? *e.vertex_top->next : *e.vertex_top->prev); - } - //------------------------------------------------------------------------------ - - inline bool IsMaxima(const Active &e) - { - return (e.vertex_top->flags & vfLocalMax); - } - //------------------------------------------------------------------------------ - - void TerminateHotOpen(Active &e) { - if (e.outrec->start_e == &e) - e.outrec->start_e = NULL; - else - e.outrec->end_e = NULL; - e.outrec = NULL; - } - //------------------------------------------------------------------------------ - - Active *GetMaximaPair(const Active &e) - { - Active *e2; - if (IsHorizontal(e)) { - //we can't be sure whether the MaximaPair is on the left or right, so ... - e2 = e.prev_in_ael; - while (e2 && e2->curr.x >= e.top.x) { - if (e2->vertex_top == e.vertex_top) return e2; //Found! - e2 = e2->prev_in_ael; - } - e2 = e.next_in_ael; - while (e2 && (TopX(*e2, e.top.y) <= e.top.x)) { - if (e2->vertex_top == e.vertex_top) return e2; //Found! - e2 = e2->next_in_ael; - } - return NULL; - } - else { - e2 = e.next_in_ael; - while (e2) { - if (e2->vertex_top == e.vertex_top) return e2; //Found! - e2 = e2->next_in_ael; - } - return NULL; - } - } - //------------------------------------------------------------------------------ - - inline int PointCount(OutPt *op) - { - if (!op) return 0; - OutPt *p = op; - int cnt = 0; - do { - cnt++; - p = p->next; - } while (p != op); - return cnt; - } - //------------------------------------------------------------------------------ - - inline void DisposeOutPts(OutPt *&op) - { - if (!op) return; - op->prev->next = NULL; - while (op) { - OutPt *tmpPp = op; - op = op->next; - delete tmpPp; - } - } - //------------------------------------------------------------------------------ - - bool IntersectListSort(IntersectNode *node1, IntersectNode *node2) - { - return (node2->pt.y < node1->pt.y); - } - //------------------------------------------------------------------------------ - - inline void SetOrientation(OutRec &outrec, Active &e1, Active &e2) - { - outrec.start_e = &e1; - outrec.end_e = &e2; - e1.outrec = &outrec; - e2.outrec = &outrec; - } - //------------------------------------------------------------------------------ - - void SwapOutrecs(Active &e1, Active &e2) - { - OutRec *or1 = e1.outrec; - OutRec *or2 = e2.outrec; - if (or1 == or2) { - Active *e = or1->start_e; - or1->start_e = or1->end_e; - or1->end_e = e; - return; - } - if (or1) { - if (&e1 == or1->start_e) or1->start_e = &e2; - else or1->end_e = &e2; - } - if (or2) { - if (&e2 == or2->start_e) or2->start_e = &e1; - else or2->end_e = &e1; - } - e1.outrec = or2; - e2.outrec = or1; - } - //------------------------------------------------------------------------------ - - inline bool EdgesAdjacentInSel(const IntersectNode &inode) - { - return (inode.edge1->next_in_sel == inode.edge2) || (inode.edge1->prev_in_sel == inode.edge2); - } - - //------------------------------------------------------------------------------ - // Clipper class methods ... - //------------------------------------------------------------------------------ - - Clipper::Clipper() - { - Clear(); - } - //--------------------------- --------------------------------------------------- - - Clipper::~Clipper() - { - Clear(); - } - //------------------------------------------------------------------------------ - - void Clipper::CleanUp() - { - while (actives_) DeleteFromAEL(*actives_); - scanline_list_ = ScanlineList(); //resets priority_queue - DisposeAllOutRecs(); - } - //------------------------------------------------------------------------------ - - void Clipper::Clear() - { - DisposeVerticesAndLocalMinima(); - curr_loc_min_ = minima_list_.begin(); - minima_list_sorted_ = false; - has_open_paths_ = false; - } - //------------------------------------------------------------------------------ - - void Clipper::Reset() - { - if (!minima_list_sorted_) { - std::sort(minima_list_.begin(), minima_list_.end(), LocMinSorter()); - minima_list_sorted_ = true; - } - for (MinimaList::const_iterator i = minima_list_.begin(); i != minima_list_.end(); ++i) - InsertScanline((*i)->vertex->pt.y); - curr_loc_min_ = minima_list_.begin(); - - actives_ = NULL; - sel_ = NULL; - } - //------------------------------------------------------------------------------ - - inline void Clipper::InsertScanline(int64_t y) { scanline_list_.push(y); } - //------------------------------------------------------------------------------ - - bool Clipper::PopScanline(int64_t &y) - { - if (scanline_list_.empty()) return false; - y = scanline_list_.top(); - scanline_list_.pop(); - while (!scanline_list_.empty() && y == scanline_list_.top()) - scanline_list_.pop(); // Pop duplicates. - return true; - } - //------------------------------------------------------------------------------ - - bool Clipper::PopLocalMinima(int64_t y, LocalMinima *&local_minima) - { - if (curr_loc_min_ == minima_list_.end() || (*curr_loc_min_)->vertex->pt.y != y) return false; - local_minima = (*curr_loc_min_); - ++curr_loc_min_; - return true; - } - //------------------------------------------------------------------------------ - - void Clipper::DisposeAllOutRecs() - { - for (OutRecList::const_iterator i = outrec_list_.begin(); i != outrec_list_.end(); ++i) { - if ((*i)->pts) DisposeOutPts((*i)->pts); - delete (*i); - } - outrec_list_.resize(0); - } - //------------------------------------------------------------------------------ - - void Clipper::DisposeVerticesAndLocalMinima() - { - for (MinimaList::iterator ml_iter = minima_list_.begin(); - ml_iter != minima_list_.end(); ++ml_iter) - delete (*ml_iter); - minima_list_.clear(); - VerticesList::iterator vl_iter; - for (vl_iter = vertex_list_.begin(); vl_iter != vertex_list_.end(); ++vl_iter) - delete[] (*vl_iter); - vertex_list_.clear(); - } - //------------------------------------------------------------------------------ - - void Clipper::AddLocMin(Vertex &vert, PathType polytype, bool is_open) - { - //make sure the vertex is added only once ... - if (vfLocMin & vert.flags) return; - vert.flags |= vfLocMin; - - LocalMinima *lm = new LocalMinima(); - lm->vertex = | - lm->polytype = polytype; - lm->is_open = is_open; - minima_list_.push_back(lm); - } - //---------------------------------------------------------------------------- - - void Clipper::AddPathToVertexList(const Path &path, PathType polytype, bool is_open) - { - int path_len = (int)path.size(); - while (path_len > 1 && (path[path_len - 1] == path[0])) --path_len; - if (path_len < 2) return; - - int i = 1; - bool p0_is_minima = false, p0_is_maxima = false, going_up; - //find the first non-horizontal segment in the path ... - while ((i < path_len) && (path[i].y == path[0].y)) ++i; - bool is_flat = (i == path_len); - if (is_flat) { - if (!is_open) return; //Ignore closed paths that have ZERO area. - going_up = false; //And this just stops a compiler warning. - } - else - { - going_up = path[i].y < path[0].y; //because I'm using an inverted Y-axis display - if (going_up) { - i = path_len - 1; - while (path[i].y == path[0].y) --i; - p0_is_minima = path[i].y < path[0].y; //p[0].y == a minima - } - else { - i = path_len - 1; - while (path[i].y == path[0].y) --i; - p0_is_maxima = path[i].y > path[0].y; //p[0].y == a maxima - } - } - - Vertex *vertices = new Vertex [path_len]; - vertex_list_.push_back(vertices); - - vertices[0].pt = path[0]; - vertices[0].flags = vfNone; - - if (is_open) { - vertices[0].flags |= vfOpenStart; - if (going_up) AddLocMin(vertices[0], polytype, is_open); - else vertices[0].flags |= vfLocalMax; - } - - //nb: polygon orientation is determined later (see InsertLocalMinimaIntoAEL). - i = 0; - for (int j = 1; j < path_len; ++j) { - if (path[j] == vertices[i].pt) continue; //ie skips duplicates - vertices[j].pt = path[j]; - vertices[j].flags = vfNone; - vertices[i].next = &vertices[j]; - vertices[j].prev = &vertices[i]; - if (path[j].y > path[i].y && going_up) { - vertices[i].flags |= vfLocalMax; - going_up = false; - } - else if (path[j].y < path[i].y && !going_up) { - going_up = true; - AddLocMin(vertices[i], polytype, is_open); - } - i = j; - } - //i: index of the last vertex in the path. - vertices[i].next = &vertices[0]; - vertices[0].prev = &vertices[i]; - - if (is_open) { - vertices[i].flags |= vfOpenEnd; - if (going_up) - vertices[i].flags |= vfLocalMax; - else AddLocMin(vertices[i], polytype, is_open); - } - else if (going_up) { - //going up so find local maxima ... - Vertex *v = &vertices[i]; - while (v->next->pt.y <= v->pt.y) v = v->next; - v->flags |= vfLocalMax; - if (p0_is_minima) AddLocMin(vertices[0], polytype, is_open); - } - else { - //going down so find local minima ... - Vertex *v = &vertices[i]; - while (v->next->pt.y >= v->pt.y) v = v->next; - AddLocMin(*v, polytype, is_open); - if (p0_is_maxima) - vertices[0].flags |= vfLocalMax; - } - } - //------------------------------------------------------------------------------ - - void Clipper::AddPath(const Path &path, PathType polytype, bool is_open) - { - if (is_open) { - if (polytype == ptClip) - throw ClipperException("AddPath: Only subject paths may be open."); - has_open_paths_ = true; - } - minima_list_sorted_ = false; - AddPathToVertexList(path, polytype, is_open); - } - //------------------------------------------------------------------------------ - - void Clipper::AddPaths(const Paths &paths, PathType polytype, bool is_open) - { - for (Paths::size_type i = 0; i < paths.size(); ++i) - AddPath(paths[i], polytype, is_open); - } - //------------------------------------------------------------------------------ - - bool Clipper::IsContributingClosed(const Active& e) const - { - switch (fillrule_) { - case frNonZero: - if (Abs(e.wind_cnt) != 1) return false; - break; - case frPositive: - if (e.wind_cnt != 1) return false; - break; - case frNegative: - if (e.wind_cnt != -1) return false; - break; - } - - switch (cliptype_) { - case ctIntersection: - switch (fillrule_) { - case frEvenOdd: - case frNonZero: return (e.wind_cnt2 != 0); - case frPositive: return (e.wind_cnt2 > 0); - case frNegative: return (e.wind_cnt2 < 0); - } - break; - case ctUnion: - switch (fillrule_) { - case frEvenOdd: - case frNonZero: return (e.wind_cnt2 == 0); - case frPositive: return (e.wind_cnt2 <= 0); - case frNegative: return (e.wind_cnt2 >= 0); - } - break; - case ctDifference: - if (GetPolyType(e) == ptSubject) - switch (fillrule_) { - case frEvenOdd: - case frNonZero: return (e.wind_cnt2 == 0); - case frPositive: return (e.wind_cnt2 <= 0); - case frNegative: return (e.wind_cnt2 >= 0); - } - else - switch (fillrule_) { - case frEvenOdd: - case frNonZero: return (e.wind_cnt2 != 0); - case frPositive: return (e.wind_cnt2 > 0); - case frNegative: return (e.wind_cnt2 < 0); - }; - break; - case ctXor: return true; //XOr is always contributing unless open - } - return false; //we should never get here - } - //------------------------------------------------------------------------------ - - inline bool Clipper::IsContributingOpen(const Active& e) const - { - switch (cliptype_) { - case ctIntersection: return (e.wind_cnt2 != 0); - case ctUnion: return (e.wind_cnt == 0 && e.wind_cnt2 == 0); - case ctDifference: return (e.wind_cnt2 == 0); - case ctXor: return (e.wind_cnt != 0) != (e.wind_cnt2 != 0); - } - return false; //stops compiler error - } - //------------------------------------------------------------------------------ - - void Clipper::SetWindingLeftEdgeClosed(Active &e) - { - //Wind counts generally refer to polygon regions not edges, so here an edge's - //WindCnt indicates the higher of the two wind counts of the regions touching - //the edge. (Note also that adjacent region wind counts only ever differ - //by one, and open paths have no meaningful wind directions or counts.) - - Active *e2 = e.prev_in_ael; - //find the nearest closed path edge of the same PolyType in AEL (heading left) - PathType pt = GetPolyType(e); - while (e2 && (GetPolyType(*e2) != pt || IsOpen(*e2))) e2 = e2->prev_in_ael; - - if (!e2) { - e.wind_cnt = e.wind_dx; - e2 = actives_; - } - else if (fillrule_ == frEvenOdd) { - e.wind_cnt = e.wind_dx; - e.wind_cnt2 = e2->wind_cnt2; - e2 = e2->next_in_ael; - } - else { - //NonZero, Positive, or Negative filling here ... - //if e's WindCnt is in the SAME direction as its WindDx, then e is either - //an outer left or a hole right boundary, so edge must be inside 'e'. - //(neither e.WindCnt nor e.WindDx should ever be 0) - if (e2->wind_cnt * e2->wind_dx < 0) { - //opposite directions so edge is outside 'e' ... - if (Abs(e2->wind_cnt) > 1) { - //outside prev poly but still inside another. - if (e2->wind_dx * e.wind_dx < 0) - //reversing direction so use the same WC - e.wind_cnt = e2->wind_cnt; - else - //otherwise keep 'reducing' the WC by 1 (ie towards 0) ... - e.wind_cnt = e2->wind_cnt + e.wind_dx; - } - else - //now outside all polys of same polytype so set own WC ... - e.wind_cnt = (IsOpen(e) ? 1 : e.wind_dx); - } - else { - //edge must be inside 'e' - if (e2->wind_dx * e.wind_dx < 0) - //reversing direction so use the same WC - e.wind_cnt = e2->wind_cnt; - else - //otherwise keep 'increasing' the WC by 1 (ie away from 0) ... - e.wind_cnt = e2->wind_cnt + e.wind_dx; - }; - e.wind_cnt2 = e2->wind_cnt2; - e2 = e2->next_in_ael; //ie get ready to calc WindCnt2 - } - - //update wind_cnt2 ... - if (fillrule_ == frEvenOdd) - while (e2 != &e) { - if (GetPolyType(*e2) != pt && !IsOpen(*e2)) - e.wind_cnt2 = (e.wind_cnt2 == 0 ? 1 : 0); - e2 = e2->next_in_ael; - } - else - while (e2 != &e) { - if (GetPolyType(*e2) != pt && !IsOpen(*e2)) - e.wind_cnt2 += e2->wind_dx; - e2 = e2->next_in_ael; - } - } - //------------------------------------------------------------------------------ - - void Clipper::SetWindingLeftEdgeOpen(Active &e) - { - Active *e2 = actives_; - if (fillrule_ == frEvenOdd) { - int cnt1 = 0, cnt2 = 0; - while (e2 != &e) { - if (GetPolyType(*e2) == ptClip) cnt2++; - else if (!IsOpen(*e2)) cnt1++; - e2 = e2->next_in_ael; - } - e.wind_cnt = (IsOdd(cnt1) ? 1 : 0); - e.wind_cnt2 = (IsOdd(cnt2) ? 1 : 0); - } - else { - while (e2 != &e) { - if (GetPolyType(*e2) == ptClip) e.wind_cnt2 += e2->wind_dx; - else if (!IsOpen(*e2)) e.wind_cnt += e2->wind_dx; - e2 = e2->next_in_ael; - } - } - } - //------------------------------------------------------------------------------ - - void Clipper::InsertEdgeIntoAEL(Active &e1, Active *e2) - { - if (!actives_) { - e1.prev_in_ael = NULL; - e1.next_in_ael = NULL; - actives_ = &e1; - return; - } - if (!e2) { - if (E2InsertsBeforeE1(*actives_, e1, false)) { - e1.prev_in_ael = NULL; - e1.next_in_ael = actives_; - actives_->prev_in_ael = &e1; - actives_ = &e1; - return; - } - e2 = actives_; - while (e2->next_in_ael && - E2InsertsBeforeE1(e1, *e2->next_in_ael, false)) - e2 = e2->next_in_ael; - } - else { - while (e2->next_in_ael && - E2InsertsBeforeE1(e1, *e2->next_in_ael, true)) - e2 = e2->next_in_ael; - } - e1.next_in_ael = e2->next_in_ael; - if (e2->next_in_ael) e2->next_in_ael->prev_in_ael = &e1; - e1.prev_in_ael = e2; - e2->next_in_ael = &e1; - } - //---------------------------------------------------------------------- - - void Clipper::InsertLocalMinimaIntoAEL(int64_t bot_y) - { - LocalMinima *local_minima; - Active *left_bound, *right_bound; - //Add any local minima at BotY ... - while (PopLocalMinima(bot_y, local_minima)) { - if ((local_minima->vertex->flags & vfOpenStart) > 0) { - left_bound = NULL; - } - else { - left_bound = new Active(); - left_bound->bot = local_minima->vertex->pt; - left_bound->curr = left_bound->bot; - left_bound->vertex_top = local_minima->vertex->prev; //ie descending - left_bound->top = left_bound->vertex_top->pt; - left_bound->wind_dx = -1; - left_bound->local_min = local_minima; - SetDx(*left_bound); - } - - if ((local_minima->vertex->flags & vfOpenEnd) > 0) { - right_bound = NULL; - } - else { - right_bound = new Active(); - right_bound->bot = local_minima->vertex->pt; - right_bound->curr = right_bound->bot; - right_bound->vertex_top = local_minima->vertex->next; //ie ascending - right_bound->top = right_bound->vertex_top->pt; - right_bound->wind_dx = 1; - right_bound->local_min = local_minima; - SetDx(*right_bound); - } - - //Currently LeftB is just the descending bound and RightB is the ascending. - //Now if the LeftB isn't on the left of RightB then we need swap them. - if (left_bound && right_bound) { - if (IsHorizontal(*left_bound)) { - if (left_bound->top.x > left_bound->bot.x) SwapActives(left_bound, right_bound); - } - else if (IsHorizontal(*right_bound)) { - if (right_bound->top.x < right_bound->bot.x) SwapActives(left_bound, right_bound); - } - else if (left_bound->dx < right_bound->dx) SwapActives(left_bound, right_bound); - } - else if (!left_bound) { - left_bound = right_bound; - right_bound = NULL; - } - - bool contributing; - InsertEdgeIntoAEL(*left_bound, NULL); //insert left edge - if (IsOpen(*left_bound)) { - SetWindingLeftEdgeOpen(*left_bound); - contributing = IsContributingOpen(*left_bound); - } - else { - SetWindingLeftEdgeClosed(*left_bound); - contributing = IsContributingClosed(*left_bound); - } - - if (right_bound != NULL) { - right_bound->wind_cnt = left_bound->wind_cnt; - right_bound->wind_cnt2 = left_bound->wind_cnt2; - InsertEdgeIntoAEL(*right_bound, left_bound); //insert right edge - if (contributing) - AddLocalMinPoly(*left_bound, *right_bound, left_bound->bot); - if (IsHorizontal(*right_bound)) PushHorz(*right_bound); - else InsertScanline(right_bound->top.y); - } - else if (contributing) - StartOpenPath(*left_bound, left_bound->bot); - - if (IsHorizontal(*left_bound)) PushHorz(*left_bound); - else InsertScanline(left_bound->top.y); - - if (right_bound && left_bound->next_in_ael != right_bound) { - //intersect edges that are between left and right bounds ... - Active *e = right_bound->next_in_ael; - MoveEdgeToFollowLeftInAEL(*right_bound, *left_bound); - while (right_bound->next_in_ael != e) { - //nb: For calculating winding counts etc, IntersectEdges() assumes - //that rightB will be to the right of e ABOVE the intersection ... - IntersectEdges(*right_bound, *right_bound->next_in_ael, right_bound->bot); - SwapPositionsInAEL(*right_bound, *right_bound->next_in_ael); - } //while - } //if - - } //while (PopLocalMinima()) - } - //------------------------------------------------------------------------------ - - inline void Clipper::PushHorz(Active &e) - { - e.next_in_sel = (sel_ ? sel_ : NULL); - sel_ = &e; - } - //------------------------------------------------------------------------------ - - inline bool Clipper::PopHorz(Active *&e) - { - e = sel_; - if (!e) return false; - sel_ = sel_->next_in_sel; - return true; - } - //------------------------------------------------------------------------------ - - OutRec* Clipper::GetOwner(const Active *e) - { - if (IsHorizontal(*e) && e->top.x < e->bot.x) { - e = e->next_in_ael; - while (e && (!IsHotEdge(*e) || IsOpen(*e))) - e = e->next_in_ael; - if (!e) return NULL; - return ((e->outrec->flag == orOuter) == (e->outrec->start_e == e)) ? - e->outrec->owner : e->outrec; - } - else { - e = e->prev_in_ael; - while (e && (!IsHotEdge(*e) || IsOpen(*e))) - e = e->prev_in_ael; - if (!e) return NULL; - return ((e->outrec->flag == orOuter) == (e->outrec->end_e == e)) ? - e->outrec->owner : e->outrec; - } - } - //------------------------------------------------------------------------------ - - void Clipper::AddLocalMinPoly(Active &e1, Active &e2, const Point64 pt) - { - OutRec *outrec = CreateOutRec(); - outrec->idx = (unsigned)outrec_list_.size(); - outrec_list_.push_back(outrec); - outrec->owner = GetOwner(&e1); - outrec->polypath = NULL; - - if (IsOpen(e1)) - outrec->flag = orOpen; - else if (!outrec->owner || outrec->owner->flag == orInner) - outrec->flag = orOuter; - else - outrec->flag = orInner; - - //now set orientation ... - bool swap_sides_needed = false; - if (IsHorizontal(e1)) { - if (e1.top.x > e1.bot.x) swap_sides_needed = true; - } - else if (IsHorizontal(e2)) { - if (e2.top.x < e2.bot.x) swap_sides_needed = true; - } - else if (e1.dx < e2.dx) swap_sides_needed = true; - if ((outrec->flag == orOuter) != swap_sides_needed) - SetOrientation(*outrec, e1, e2); - else - SetOrientation(*outrec, e2, e1); - - OutPt *op = CreateOutPt(); - op->pt = pt; - op->next = op; - op->prev = op; - outrec->pts = op; - } - //------------------------------------------------------------------------------ - - void Clipper::AddLocalMaxPoly(Active &e1, Active &e2, const Point64 pt) - { - if (!IsHotEdge(e2)) - throw new ClipperException("Error in AddLocalMaxPoly()."); - AddOutPt(e1, pt); - if (e1.outrec == e2.outrec) { - e1.outrec->start_e = NULL; - e1.outrec->end_e = NULL; - e1.outrec = NULL; - e2.outrec = NULL; - } - //and to preserve the winding orientation of outrec ... - else if (e1.outrec->idx < e2.outrec->idx) - JoinOutrecPaths(e1, e2); else - JoinOutrecPaths(e2, e1); - } - //------------------------------------------------------------------------------ - - void Clipper::JoinOutrecPaths(Active &e1, Active &e2) - { - - if (IsStartSide(e1) == IsStartSide(e2)) { - //one or other edge orientation is wrong... - if (IsOpen(e1)) SwapSides(*e2.outrec); - else if (!FixOrientation(e1) && !FixOrientation(e2)) - throw new ClipperException("Error in JoinOutrecPaths()"); - if (e1.outrec->owner == e2.outrec) e1.outrec->owner = e2.outrec->owner; - } - - //join E2 outrec path onto E1 outrec path and then delete E2 outrec path - //pointers. (nb: Only very rarely do the joining ends share the same coords.) - OutPt *p1_st = e1.outrec->pts; - OutPt *p2_st = e2.outrec->pts; - OutPt *p1_end = p1_st->next; - OutPt *p2_end = p2_st->next; - if (IsStartSide(e1)) { - p2_end->prev = p1_st; - p1_st->next = p2_end; - p2_st->next = p1_end; - p1_end->prev = p2_st; - e1.outrec->pts = p2_st; - e1.outrec->start_e = e2.outrec->start_e; - if (e1.outrec->start_e) //ie closed path - e1.outrec->start_e->outrec = e1.outrec; - } - else { - p1_end->prev = p2_st; - p2_st->next = p1_end; - p1_st->next = p2_end; - p2_end->prev = p1_st; - e1.outrec->end_e = e2.outrec->end_e; - if (e1.outrec->end_e) //ie closed path - e1.outrec->end_e->outrec = e1.outrec; - } - - //after joining, the E2.OutRec contains not vertices ... - e2.outrec->start_e = NULL; - e2.outrec->end_e = NULL; - e2.outrec->pts = NULL; - e2.outrec->owner = e1.outrec; //this may be redundant - - //and e1 and e2 are maxima and are about to be dropped from the Actives list. - e1.outrec = NULL; - e2.outrec = NULL; - } - //------------------------------------------------------------------------------ - - inline void Clipper::TerminateHotOpen(Active &e) - { - if (e.outrec->start_e == &e) e.outrec->start_e = NULL; - else e.outrec->end_e = NULL; - e.outrec = NULL; - } - //------------------------------------------------------------------------------ - - OutPt* Clipper::CreateOutPt() - { - //this is a virtual method as descendant classes may need - //to produce descendant classes of OutPt ... - return new OutPt(); - } - //------------------------------------------------------------------------------ - - OutRec* Clipper::CreateOutRec() - { - //this is a virtual method as descendant classes may need - //to produce descendant classes of OutRec ... - return new OutRec(); - } - //------------------------------------------------------------------------------ - - OutPt* Clipper::AddOutPt(Active &e, const Point64 pt) - { - //Outrec.pts[0]: a circular double-linked-list of POutPt. - bool to_start = IsStartSide(e); - OutPt *start_op = e.outrec->pts; - OutPt *end_op = start_op->next; - if (to_start) { - if (pt == start_op->pt) return start_op; - } - else if (pt == end_op->pt) return end_op; - - OutPt *new_op = CreateOutPt(); - new_op->pt = pt; - end_op->prev = new_op; - new_op->prev = start_op; - new_op->next = end_op; - start_op->next = new_op; - if (to_start) e.outrec->pts = new_op; - return new_op; - } - //------------------------------------------------------------------------------ - - void Clipper::StartOpenPath(Active &e, const Point64 pt) - { - OutRec *outrec = CreateOutRec(); - outrec->idx = (unsigned)outrec_list_.size(); - outrec_list_.push_back(outrec); - outrec->flag = orOpen; - outrec->owner = NULL; - outrec->polypath = NULL; - outrec->end_e = NULL; - outrec->start_e = NULL; - e.outrec = outrec; - - OutPt *op = CreateOutPt(); - op->pt = pt; - op->next = op; - op->prev = op; - outrec->pts = op; - } - //------------------------------------------------------------------------------ - - inline void Clipper::UpdateEdgeIntoAEL(Active *e) - { - e->bot = e->top; - e->vertex_top = &NextVertex(*e); - e->top = e->vertex_top->pt; - e->curr = e->bot; - SetDx(*e); - if (!IsHorizontal(*e)) InsertScanline(e->top.y); - } - //------------------------------------------------------------------------------ - - void Clipper::IntersectEdges(Active &e1, Active &e2, const Point64 pt) - { - e1.curr = pt; - e2.curr = pt; - - //if either edge is an OPEN path ... - if (has_open_paths_ && (IsOpen(e1) || IsOpen(e2))) { - if (IsOpen(e1) && IsOpen(e2)) return; //ignore lines that intersect - Active *edge_o, *edge_c; - if (IsOpen(e1)) { edge_o = &e1; edge_c = &e2; } - else { edge_o = &e2; edge_c = &e1; } - - switch (cliptype_) { - case ctIntersection: - case ctDifference: - if (IsSamePolyType(*edge_o, *edge_c) || (Abs(edge_c->wind_cnt) != 1)) return; - break; - case ctUnion: - if (IsHotEdge(*edge_o) != ((Abs(edge_c->wind_cnt) != 1) || - (IsHotEdge(*edge_o) != (edge_c->wind_cnt != 0)))) return; //just works! - break; - case ctXor: - if (Abs(edge_c->wind_cnt) != 1) return; - break; - } - //toggle contribution ... - if (IsHotEdge(*edge_o)) { - AddOutPt(*edge_o, pt); - TerminateHotOpen(*edge_o); - } - else StartOpenPath(*edge_o, pt); - return; - } - - //update winding counts... - //assumes that e1 will be to the right of e2 ABOVE the intersection - int old_e1_windcnt, old_e2_windcnt; - if (e1.local_min->polytype == e2.local_min->polytype) { - if (fillrule_ == frEvenOdd) { - old_e1_windcnt = e1.wind_cnt; - e1.wind_cnt = e2.wind_cnt; - e2.wind_cnt = old_e1_windcnt; - } - else { - if (e1.wind_cnt + e2.wind_dx == 0) e1.wind_cnt = -e1.wind_cnt; - else e1.wind_cnt += e2.wind_dx; - if (e2.wind_cnt - e1.wind_dx == 0) e2.wind_cnt = -e2.wind_cnt; - else e2.wind_cnt -= e1.wind_dx; - } - } - else { - if (fillrule_ != frEvenOdd) e1.wind_cnt2 += e2.wind_dx; - else e1.wind_cnt2 = (e1.wind_cnt2 == 0 ? 1 : 0); - if (fillrule_ != frEvenOdd) e2.wind_cnt2 -= e1.wind_dx; - else e2.wind_cnt2 = (e2.wind_cnt2 == 0 ? 1 : 0); - } - - switch (fillrule_) { - case frPositive: - old_e1_windcnt = e1.wind_cnt; - old_e2_windcnt = e2.wind_cnt; - break; - case frNegative: - old_e1_windcnt = -e1.wind_cnt; - old_e2_windcnt = -e2.wind_cnt; - break; - default: - old_e1_windcnt = Abs(e1.wind_cnt); - old_e2_windcnt = Abs(e2.wind_cnt); - break; - } - - if (IsHotEdge(e1) && IsHotEdge(e2)) { - if ((old_e1_windcnt != 0 && old_e1_windcnt != 1) || (old_e2_windcnt != 0 && old_e2_windcnt != 1) || - (e1.local_min->polytype != e2.local_min->polytype && cliptype_ != ctXor)) - { - AddLocalMaxPoly(e1, e2, pt); - } - else if (IsStartSide(e1)) { - AddLocalMaxPoly(e1, e2, pt); - AddLocalMinPoly(e1, e2, pt); - } - else { - AddOutPt(e1, pt); - AddOutPt(e2, pt); - SwapOutrecs(e1, e2); - } - } - else if (IsHotEdge(e1)) { - if (old_e2_windcnt == 0 || old_e2_windcnt == 1) { - AddOutPt(e1, pt); - SwapOutrecs(e1, e2); - } - } - else if (IsHotEdge(e2)) { - if (old_e1_windcnt == 0 || old_e1_windcnt == 1) { - AddOutPt(e2, pt); - SwapOutrecs(e1, e2); - } - } - else if ((old_e1_windcnt == 0 || old_e1_windcnt == 1) && - (old_e2_windcnt == 0 || old_e2_windcnt == 1)) - { - //neither edge is currently contributing ... - int64_t e1Wc2, e2Wc2; - switch (fillrule_) { - case frPositive: - e1Wc2 = e1.wind_cnt2; - e2Wc2 = e2.wind_cnt2; - break; - case frNegative: - e1Wc2 = -e1.wind_cnt2; - e2Wc2 = -e2.wind_cnt2; - break; - default: - e1Wc2 = Abs(e1.wind_cnt2); - e2Wc2 = Abs(e2.wind_cnt2); - break; - } - - if (!IsSamePolyType(e1, e2)) { - AddLocalMinPoly(e1, e2, pt); - } - else if (old_e1_windcnt == 1 && old_e2_windcnt == 1) - switch (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 (((GetPolyType(e1) == ptClip) && (e1Wc2 > 0) && (e2Wc2 > 0)) || - ((GetPolyType(e1) == ptSubject) && (e1Wc2 <= 0) && (e2Wc2 <= 0))) - AddLocalMinPoly(e1, e2, pt); - break; - case ctXor: - AddLocalMinPoly(e1, e2, pt); - break; - } - } - } - //------------------------------------------------------------------------------ - - inline void Clipper::DeleteFromAEL(Active &e) - { - Active* prev = e.prev_in_ael; - Active* next = e.next_in_ael; - if (!prev && !next && (&e != actives_)) return; //already deleted - if (prev) prev->next_in_ael = next; - else actives_ = next; - if (next) next->prev_in_ael = prev; - delete &e; - } - //------------------------------------------------------------------------------ - - inline void Clipper::CopyAELToSEL() - { - Active* e = actives_; - sel_ = e; - while (e) { - e->prev_in_sel = e->prev_in_ael; - e->next_in_sel = e->next_in_ael; - e = e->next_in_ael; - } - } - //------------------------------------------------------------------------------ - - inline void Clipper::CopyActivesToSELAdjustCurrX(const int64_t top_y) - { - Active* e = actives_; - sel_ = e; - while (e) { - e->prev_in_sel = e->prev_in_ael; - e->next_in_sel = e->next_in_ael; - e->curr.x = TopX(*e, top_y); - e = e->next_in_ael; - } - } - //------------------------------------------------------------------------------ - - bool Clipper::ExecuteInternal(ClipType ct, FillRule ft) - { - if (ct == ctNone) return true; - fillrule_ = ft; - cliptype_ = ct; - Reset(); - - int64_t y; - if (!PopScanline(y)) { return false; } - for (;;) { - InsertLocalMinimaIntoAEL(y); - Active *e; - while (PopHorz(e)) ProcessHorizontal(*e); - if (!PopScanline(y)) break; //Y is now at the top of the scanbeam - ProcessIntersections(y); - DoTopOfScanbeam(y); - } - return true; - } - //------------------------------------------------------------------------------ - - bool Clipper::Execute(ClipType clipType, Paths &solution_closed, FillRule ft) - { - solution_closed.clear(); - if (!ExecuteInternal(clipType, ft)) return false; - BuildResult(solution_closed, NULL); - CleanUp(); - return true; - } - //------------------------------------------------------------------------------ - - bool Clipper::Execute(ClipType clipType, Paths &solution_closed, Paths &solution_open, FillRule ft) - { - solution_closed.clear(); - solution_open.clear(); - if (!ExecuteInternal(clipType, ft)) return false; - BuildResult(solution_closed, &solution_open); - CleanUp(); - return true; - } - //------------------------------------------------------------------------------ - - bool Clipper::Execute(ClipType clipType, PolyPath &solution_closed, Paths &solution_open, FillRule ft) - { - solution_closed.Clear(); - if (!ExecuteInternal(clipType, ft)) return false; - BuildResult2(solution_closed, NULL); - CleanUp(); - return true; - } - //------------------------------------------------------------------------------ - - void Clipper::ProcessIntersections(const int64_t top_y) - { - BuildIntersectList(top_y); - if (intersect_list_.size() == 0) return; - FixupIntersectionOrder(); - ProcessIntersectList(); - } - //------------------------------------------------------------------------------ - - inline void Clipper::DisposeIntersectNodes() - { - for (IntersectList::iterator node_iter = intersect_list_.begin(); - node_iter != intersect_list_.end(); ++node_iter) - delete (*node_iter); - intersect_list_.resize(0); - } - //------------------------------------------------------------------------------ - - void Clipper::InsertNewIntersectNode(Active &e1, Active &e2, int64_t top_y) - { - Point64 pt = GetIntersectPoint(e1, e2); - - //Rounding errors can occasionally place the calculated intersection - //point either below or above the scanbeam, so check and correct ... - if (pt.y > e1.curr.y) { - pt.y = e1.curr.y; //e.curr.y is still the bottom of scanbeam - //use the more vertical of the 2 edges to derive pt.X ... - if (Abs(e1.dx) < Abs(e2.dx)) pt.x = TopX(e1, pt.y); - else pt.x = TopX(e2, pt.y); - } - else if (pt.y < top_y) { - pt.y = top_y; //top_y is at the top of the scanbeam - - if (e1.top.y == top_y) pt.x = e1.top.x; - else if (e2.top.y == top_y) pt.x = e2.top.x; - else if (Abs(e1.dx) < Abs(e2.dx)) pt.x = e1.curr.x; - else pt.x = e2.curr.x; - } - - IntersectNode *node = new IntersectNode(); - node->edge1 = &e1; - node->edge2 = &e2; - node->pt = pt; - intersect_list_.push_back(node); - } - //------------------------------------------------------------------------------ - - void Clipper::BuildIntersectList(const int64_t top_y) - { - if (!actives_ || !actives_->next_in_ael) return; - CopyActivesToSELAdjustCurrX(top_y); - - //Merge sort actives_ into their new positions at the top of scanbeam, and - //create an intersection node every time an edge crosses over another ... - //see also https://stackoverflow.com/a/46319131/359538 - int mul = 1; - while (true) { - - Active *first = sel_, *second = NULL, *baseE, *prev_base = NULL, *tmp; - //sort successive larger 'mul' count of nodes ... - while (first) { - if (mul == 1) { - second = first->next_in_sel; - if (!second) { - first->merge_jump = NULL; - break; - } - first->merge_jump = second->next_in_sel; - } - else { - second = first->merge_jump; - if (!second) { - first->merge_jump = NULL; - break; - } - first->merge_jump = second->merge_jump; - } - - //now sort first and second groups ... - baseE = first; - int lCnt = mul, rCnt = mul; - while (lCnt > 0 && rCnt > 0) { - if (second->curr.x < first->curr.x) { - // create one or more Intersect nodes /////////// - tmp = second->prev_in_sel; - for (int i = 0; i < lCnt; ++i) { - //create a new intersect node... - InsertNewIntersectNode(*tmp, *second, top_y); - tmp = tmp->prev_in_sel; - } - ///////////////////////////////////////////////// - - if (first == baseE) { - if (prev_base) prev_base->merge_jump = second; - baseE = second; - baseE->merge_jump = first->merge_jump; - if (!first->prev_in_sel) sel_ = second; - } - tmp = second->next_in_sel; - //now move the out of place edge to it's new position in SEL ... - Insert2Before1InSel(*first, *second); - second = tmp; - if (!second) break; - --rCnt; - } - else { - first = first->next_in_sel; - --lCnt; - } - } - first = baseE->merge_jump; - prev_base = baseE; - } - if (!sel_->merge_jump) break; - else mul <<= 1; - } - } - //------------------------------------------------------------------------------ - - bool Clipper::ProcessIntersectList() - { - for (IntersectList::iterator node_iter = intersect_list_.begin(); - node_iter != intersect_list_.end(); ++node_iter) { - IntersectNode *iNode = *node_iter; - IntersectEdges(*iNode->edge1, *iNode->edge2, iNode->pt); - SwapPositionsInAEL(*iNode->edge1, *iNode->edge2); - } - DisposeIntersectNodes(); - return true; - } - //------------------------------------------------------------------------------ - - void Clipper::FixupIntersectionOrder() - { - size_t cnt = intersect_list_.size(); - if (cnt < 2) return; - //It's important that edge intersections are processed from the bottom up, - //but it's also crucial that intersections only occur between adjacent edges. - //The first sort here (a quicksort), arranges intersections relative to their - //vertical positions within the scanbeam ... - std::sort(intersect_list_.begin(), intersect_list_.end(), IntersectListSort); - - //Now we simulate processing these intersections, and as we do, we make sure - //that the intersecting edges remain adjacent. If they aren't, this simulated - //intersection is delayed until such time as these edges do become adjacent. - CopyAELToSEL(); - for (size_t i = 0; i < cnt; ++i) { - if (!EdgesAdjacentInSel(*intersect_list_[i])) { - size_t j = i + 1; - while (!EdgesAdjacentInSel(*intersect_list_[j])) j++; - std::swap(intersect_list_[i], intersect_list_[j]); - } - SwapPositionsInSEL(*intersect_list_[i]->edge1, *intersect_list_[i]->edge2); - } - } - //------------------------------------------------------------------------------ - - void Clipper::SwapPositionsInAEL(Active &e1, Active &e2) - { - //check that one or other edge hasn't already been removed from AEL ... - if (e1.next_in_ael == e1.prev_in_ael || - e2.next_in_ael == e2.prev_in_ael) return; - - Active *next, *prev; - if (e1.next_in_ael == &e2) { - next = e2.next_in_ael; - if (next) next->prev_in_ael = &e1; - prev = e1.prev_in_ael; - if (prev) prev->next_in_ael = &e2; - e2.prev_in_ael = prev; - e2.next_in_ael = &e1; - e1.prev_in_ael = &e2; - e1.next_in_ael = next; - } - else if (e2.next_in_ael == &e1) { - next = e1.next_in_ael; - if (next) next->prev_in_ael = &e2; - prev = e2.prev_in_ael; - if (prev) prev->next_in_ael = &e1; - e1.prev_in_ael = prev; - e1.next_in_ael = &e2; - e2.prev_in_ael = &e1; - e2.next_in_ael = next; - } - else { - next = e1.next_in_ael; - prev = e1.prev_in_ael; - e1.next_in_ael = e2.next_in_ael; - if (e1.next_in_ael) e1.next_in_ael->prev_in_ael = &e1; - e1.prev_in_ael = e2.prev_in_ael; - if (e1.prev_in_ael) e1.prev_in_ael->next_in_ael = &e1; - e2.next_in_ael = next; - if (e2.next_in_ael) e2.next_in_ael->prev_in_ael = &e2; - e2.prev_in_ael = prev; - if (e2.prev_in_ael) e2.prev_in_ael->next_in_ael = &e2; - } - - if (!e1.prev_in_ael) actives_ = &e1; - else if (!e2.prev_in_ael) actives_ = &e2; - } - //------------------------------------------------------------------------------ - - void Clipper::SwapPositionsInSEL(Active &e1, Active &e2) - { - if (!e1.next_in_sel && !e1.prev_in_sel) return; - if (!e2.next_in_sel && !e2.prev_in_sel) return; - - if (e1.next_in_sel == &e2) { - Active* Next = e2.next_in_sel; - if (Next) Next->prev_in_sel = &e1; - Active* Prev = e1.prev_in_sel; - if (Prev) Prev->next_in_sel = &e2; - e2.prev_in_sel = Prev; - e2.next_in_sel = &e1; - e1.prev_in_sel = &e2; - e1.next_in_sel = Next; - } - else if (e2.next_in_sel == &e1) { - Active* Next = e1.next_in_sel; - if (Next) Next->prev_in_sel = &e2; - Active* Prev = e2.prev_in_sel; - if (Prev) Prev->next_in_sel = &e1; - e1.prev_in_sel = Prev; - e1.next_in_sel = &e2; - e2.prev_in_sel = &e1; - e2.next_in_sel = Next; - } - else { - Active* Next = e1.next_in_sel; - Active* Prev = e1.prev_in_sel; - e1.next_in_sel = e2.next_in_sel; - if (e1.next_in_sel) e1.next_in_sel->prev_in_sel = &e1; - e1.prev_in_sel = e2.prev_in_sel; - if (e1.prev_in_sel) e1.prev_in_sel->next_in_sel = &e1; - e2.next_in_sel = Next; - if (e2.next_in_sel) e2.next_in_sel->prev_in_sel = &e2; - e2.prev_in_sel = Prev; - if (e2.prev_in_sel) e2.prev_in_sel->next_in_sel = &e2; - } - - if (!e1.prev_in_sel) sel_ = &e1; - else if (!e2.prev_in_sel) sel_ = &e2; - } - //------------------------------------------------------------------------------ - - void Clipper::Insert2Before1InSel(Active &first, Active &second) - { - //remove second from list ... - Active *prev = second.prev_in_sel; - Active *next = second.next_in_sel; - prev->next_in_sel = next; //always a prev since we're moving from right to left - if (next) next->prev_in_sel = prev; - //insert back into list ... - prev = first.prev_in_sel; - if (prev) prev->next_in_sel = &second; - first.prev_in_sel = &second; - second.prev_in_sel = prev; - second.next_in_sel = &first; - } - //------------------------------------------------------------------------------ - - bool Clipper::ResetHorzDirection(Active &horz, Active *max_pair, int64_t &horz_left, int64_t &horz_right) - { - if (horz.bot.x == horz.top.x) { - //the horizontal edge is going nowhere ... - horz_left = horz.curr.x; - horz_right = horz.curr.x; - Active *e = horz.next_in_ael; - while (e && e != max_pair) e = e->next_in_ael; - return e != NULL; - } - else if (horz.curr.x < horz.top.x) { - horz_left = horz.curr.x; - horz_right = horz.top.x; - return true; - } - else { - horz_left = horz.top.x; - horz_right = horz.curr.x; - return false; //right to left - } - } - //------------------------------------------------------------------------------ - - void Clipper::ProcessHorizontal(Active &horz) - /******************************************************************************* - * 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 the bottom vertices of * - * other HEs[#] and with non-horizontal edges [*]. Once these intersections * - * are completed, intermediate HEs are 'promoted' to the next edge in their * - * bounds, and they in turn may be intersected[%] by other HEs. * - * * - * eg: 3 horizontals at a scanline: / | / / * - * | / | (HE3)o ========%========== o * - * o ======= o(HE2) / | / / * - * o ============#=========*======*========#=========o (HE1) * - * / | / | / * - *******************************************************************************/ - { - Point64 pt; - //with closed paths, simplify consecutive horizontals into a 'single' edge ... - if (!IsOpen(horz)) { - pt = horz.bot; - while (!IsMaxima(horz) && NextVertex(horz).pt.y == pt.y) - UpdateEdgeIntoAEL(&horz); - horz.bot = pt; - horz.curr = pt; - }; - - Active *max_pair = NULL; - if (IsMaxima(horz) && (!IsOpen(horz) || - ((horz.vertex_top->flags & (vfOpenStart | vfOpenEnd)) == 0))) - max_pair = GetMaximaPair(horz); - - int64_t horz_left, horz_right; - bool is_left_to_right = ResetHorzDirection(horz, max_pair, horz_left, horz_right); - if (IsHotEdge(horz)) AddOutPt(horz, horz.curr); - - while (true) { //loops through consec. horizontal edges (if open) - Active *e; - bool isMax = IsMaxima(horz); - if (is_left_to_right) - e = horz.next_in_ael; else - e = horz.prev_in_ael; - while (e) { - //break if we've gone past the } of the horizontal ... - if ((is_left_to_right && (e->curr.x > horz_right)) || - (!is_left_to_right && (e->curr.x < horz_left))) break; - //or if we've got to the } of an intermediate horizontal edge ... - if (e->curr.x == horz.top.x && !isMax && !IsHorizontal(*e)) { - pt = NextVertex(horz).pt; - if (is_left_to_right && (TopX(*e, pt.y) >= pt.x) || - (!is_left_to_right && (TopX(*e, pt.y) <= pt.x))) break; - }; - - if (e == max_pair) { - if (IsHotEdge(horz)) { - if (is_left_to_right) - AddLocalMaxPoly(horz, *e, horz.top); - else - AddLocalMaxPoly(*e, horz, horz.top); - } - DeleteFromAEL(*e); - DeleteFromAEL(horz); - return; - }; - - if (is_left_to_right) { - pt = Point64(e->curr.x, horz.curr.y); - IntersectEdges(horz, *e, pt); - } - else { - pt = Point64(e->curr.x, horz.curr.y); - IntersectEdges(*e, horz, pt); - } - - Active *next_e; - if (is_left_to_right) next_e = e->next_in_ael; - else next_e = e->prev_in_ael; - SwapPositionsInAEL(horz, *e); - e = next_e; - } - - //check if we've finished with (consecutive) horizontals ... - if (isMax || NextVertex(horz).pt.y != horz.top.y) break; - - //still more horizontals in bound to process ... - UpdateEdgeIntoAEL(&horz); - is_left_to_right = ResetHorzDirection(horz, max_pair, horz_left, horz_right); - - if (IsOpen(horz)) { - if (IsMaxima(horz)) max_pair = GetMaximaPair(horz); - if (IsHotEdge(horz)) AddOutPt(horz, horz.bot); - } - } - - if (IsHotEdge(horz)) AddOutPt(horz, horz.top); - if (!IsOpen(horz)) - UpdateEdgeIntoAEL(&horz); //this is the } of an intermediate horiz. - else if (!IsMaxima(horz)) - UpdateEdgeIntoAEL(&horz); - else if (!max_pair) //ie open at top - DeleteFromAEL(horz); - else if (IsHotEdge(horz)) - AddLocalMaxPoly(horz, *max_pair, horz.top); - else { - DeleteFromAEL(*max_pair); DeleteFromAEL(horz); - } - } - //------------------------------------------------------------------------------ - - void Clipper::DoTopOfScanbeam(const int64_t y) - { - sel_ = NULL; //reused to flag horizontals - Active *e = actives_; - while (e) { - //nb: E will never be horizontal at this point - if (e->top.y == y) { - e->curr = e->top; //needed for horizontal processing - if (IsMaxima(*e)) { - e = DoMaxima(*e); //TOP OF BOUND (MAXIMA) - continue; - } - else { - //INTERMEDIATE VERTEX ... - UpdateEdgeIntoAEL(e); - if (IsHotEdge(*e))AddOutPt(*e, e->bot); - if (IsHorizontal(*e)) - PushHorz(*e); //horizontals are processed later - } - } - else { - e->curr.y = y; - e->curr.x = TopX(*e, y); - } - e = e->next_in_ael; - } - } - //------------------------------------------------------------------------------ - - Active* Clipper::DoMaxima(Active &e) - { - Active *next_e, *prev_e, *max_pair; - prev_e = e.prev_in_ael; - next_e = e.next_in_ael; - if (IsOpen(e) && ((e.vertex_top->flags & (vfOpenStart | vfOpenEnd)) != 0)) { - if (IsHotEdge(e)) AddOutPt(e, e.top); - if (!IsHorizontal(e)) { - if (IsHotEdge(e)) TerminateHotOpen(e); - DeleteFromAEL(e); - } - return next_e; - } - else { - max_pair = GetMaximaPair(e); - if (!max_pair) return next_e; //eMaxPair is horizontal - } - - //only non-horizontal maxima here. - //process any edges between maxima pair ... - while (next_e != max_pair) { - IntersectEdges(e, *next_e, e.top); - SwapPositionsInAEL(e, *next_e); - next_e = e.next_in_ael; - } - - if (IsOpen(e)) { - if (IsHotEdge(e)) { - if (max_pair) - AddLocalMaxPoly(e, *max_pair, e.top); else - AddOutPt(e, e.top); - } - if (max_pair) DeleteFromAEL(*max_pair); - DeleteFromAEL(e); - return (prev_e ? prev_e->next_in_ael : actives_); - } - //here E.next_in_ael == ENext == EMaxPair ... - if (IsHotEdge(e)) - AddLocalMaxPoly(e, *max_pair, e.top); - - DeleteFromAEL(e); - DeleteFromAEL(*max_pair); - return (prev_e ? prev_e->next_in_ael : actives_); - } - //------------------------------------------------------------------------------ - - void Clipper::BuildResult(Paths &solution_closed, Paths *solution_open) - { - solution_closed.resize(0); - solution_closed.reserve(outrec_list_.size()); - if (solution_open) { - solution_open->resize(0); - solution_open->reserve(outrec_list_.size()); - } - - for (OutRecList::const_iterator ol_iter = outrec_list_.begin(); - ol_iter != outrec_list_.end(); ++ol_iter) - { - OutRec *outrec = *ol_iter; - if (!outrec->pts) continue; - OutPt *op = outrec->pts->next; - int cnt = PointCount(op); - //fixup for duplicate start and } points ... - if (op->pt == outrec->pts->pt) cnt--; - - bool is_open = (outrec->flag == orOpen); - if (cnt < 2 || (!is_open && cnt == 2) || (is_open && !solution_open)) continue; - Path p; - p.reserve(cnt); - for (int i = 0; i < cnt; i++) { p.push_back(op->pt); op = op->next; } - if (is_open) solution_open->push_back(p); - else solution_closed.push_back(p); - } - } - //------------------------------------------------------------------------------ - - void Clipper::BuildResult2(PolyPath &pt, Paths *solution_open) - { - pt.Clear(); - if (solution_open) { - solution_open->resize(0); - solution_open->reserve(outrec_list_.size()); - } - - for (OutRecList::const_iterator ol_iter = outrec_list_.begin(); - ol_iter != outrec_list_.end(); ++ol_iter) - { - OutRec *outrec = *ol_iter; - if (!outrec->pts) continue; - OutPt *op = outrec->pts->next; - int cnt = PointCount(op); - //fixup for duplicate start and } points ... - if (op->pt == outrec->pts->pt) cnt--; - - bool is_open = (outrec->flag == orOpen); - if (cnt < 2 || (!is_open && cnt == 2) || (is_open && !solution_open)) continue; - - Path p; - p.reserve(cnt); - for (int i = 0; i < cnt; i++) { p.push_back(op->pt); op = op->next; } - if (is_open) - solution_open->push_back(p); - else if (outrec->owner && outrec->owner->polypath) - outrec->polypath = &outrec->owner->polypath->AddChild(p); - else - outrec->polypath = &pt.AddChild(p); - } - } - //------------------------------------------------------------------------------ - - Rect64 Clipper::GetBounds() - { - if (vertex_list_.size() == 0) return Rect64(0, 0, 0, 0); - Rect64 result = Rect64(INT64_MAX, INT64_MAX, INT64_MIN, INT64_MIN); - VerticesList::const_iterator it = vertex_list_.begin(); - while (it != vertex_list_.end()) { - Vertex *v = *it, *v2 = v; - do { - if (v2->pt.x < result.left) result.left = v2->pt.x; - if (v2->pt.x > result.right) result.right = v2->pt.x; - if (v2->pt.y < result.top) result.top = v2->pt.y; - if (v2->pt.y > result.bottom) result.bottom = v2->pt.y; - v2 = v2->next; - } while (v2 != v); - ++it; - } - return result; - } - //------------------------------------------------------------------------------ - - std::ostream& operator <<(std::ostream &s, const Point64 &pt) - { - s << pt.x << "," << pt.y << " "; - return s; - } - //------------------------------------------------------------------------------ - - std::ostream& operator <<(std::ostream &s, const Path &path) - { - if (path.empty()) return s; - Path::size_type last = path.size() -1; - for (Path::size_type i = 0; i < last; i++) s << path[i] << " "; - s << path[last] << "\n"; - return s; - } - //------------------------------------------------------------------------------ - - std::ostream& operator <<(std::ostream &s, const Paths &paths) - { - for (Paths::size_type i = 0; i < paths.size(); i++) s << paths[i]; - s << "\n"; - return s; - } - //------------------------------------------------------------------------------ - -} //clipperlib namespace diff --git a/modules/clipper/register_types.cpp b/modules/clipper/register_types.cpp index f6dc3e25f325..df33a5b38db8 100644 --- a/modules/clipper/register_types.cpp +++ b/modules/clipper/register_types.cpp @@ -3,9 +3,9 @@ void register_clipper_types() { - ClassDB::register_class(); + ClassDB::register_class(); } void unregister_clipper_types() { - // nothing to do here + // nothing to do here } diff --git a/thirdparty/misc/clipper.cpp b/thirdparty/misc/clipper.cpp index d3143fe5ab66..7637e95f5097 100644 --- a/thirdparty/misc/clipper.cpp +++ b/thirdparty/misc/clipper.cpp @@ -1,4629 +1,1921 @@ /******************************************************************************* -* * * Author : Angus Johnson * -* Version : 6.4.2 * -* Date : 27 February 2017 * +* Version : 10.0 (beta) * +* Date : 8 Noveber 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 * -* * +* Purpose : Base clipping module * +* License : http://www.boost.org/LICENSE_1_0.txt * *******************************************************************************/ -/******************************************************************************* -* * -* This is a translation of the Delphi Clipper library and the naming style * -* used has retained a Delphi flavour. * -* * -*******************************************************************************/ - -#include "clipper.hpp" +#include #include #include #include +#include #include #include -#include #include #include +#include "stdint.h" +#include "clipper.h" -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(val - 0.5); - else return static_cast(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(): 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; - } +#include +namespace clipperlib { - Int128(const Int128 &val): lo(val.lo), hi(val.hi){} + enum VertexFlags { vfNone = 0, vfOpenStart = 1, vfOpenEnd = 2, vfLocalMax = 4, vfLocMin = 8 }; + inline VertexFlags operator|(VertexFlags a, VertexFlags b) { + return static_cast(static_cast(a) | static_cast(b)); + } + inline VertexFlags& operator |=(VertexFlags& a, VertexFlags b) { return a = a | b; } - 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; - } + struct Vertex { + Point64 pt; + Vertex *next; + Vertex *prev; + VertexFlags flags; + }; - bool operator == (const Int128 &val) const - {return (hi == val.hi && lo == val.lo);} + struct LocalMinima { + Vertex *vertex; + PathType polytype; + bool is_open; + }; - bool operator != (const Int128 &val) const - { return !(*this == val);} + struct Scanline { + int64_t y; + Scanline *next; + }; - bool operator > (const Int128 &val) const - { - if (hi != val.hi) - return hi > val.hi; - else - return lo > val.lo; - } + struct IntersectNode { + Point64 pt; + Active *edge1; + Active *edge2; + }; - bool operator < (const Int128 &val) const - { - if (hi != val.hi) - return hi < val.hi; - else - return lo < val.lo; + struct LocMinSorter { + inline bool operator()(const LocalMinima* locMin1, const LocalMinima* locMin2) { + return locMin2->vertex->pt.y < locMin1->vertex->pt.y; } + }; - 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; - } + //------------------------------------------------------------------------------ + // PolyPath methods ... + //------------------------------------------------------------------------------ - Int128 operator + (const Int128 &rhs) const - { - Int128 result(*this); - result+= rhs; - return result; + void PolyPath::Clear() + { + for (size_t i = 0; i < childs_.size(); ++i) { + childs_[i]->Clear(); + delete childs_[i]; } + childs_.resize(0); + } + //------------------------------------------------------------------------------ - Int128& operator -= (const Int128 &rhs) - { - *this += -rhs; - return *this; - } + PolyPath::PolyPath() + { + parent_ = NULL; + } + //------------------------------------------------------------------------------ - Int128 operator - (const Int128 &rhs) const - { - Int128 result(*this); - result -= rhs; - return result; - } + PolyPath::PolyPath(PolyPath *parent, const Path &path) + { + parent_ = parent; + path_ = path; + } + //------------------------------------------------------------------------------ - Int128 operator-() const //unary negation - { - if (lo == 0) - return Int128(-hi, 0); - else - return Int128(~hi, ~lo + 1); - } + int PolyPath::ChildCount() const { return (int)childs_.size(); } - 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) + PolyPath& PolyPath::AddChild(const Path &path) { - a += ((double)poly[j].X + poly[i].X) * ((double)poly[j].Y - poly[i].Y); - j = i; + PolyPath* child = new PolyPath(this, path); + childs_.push_back(child); + return *child; } - 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 + //------------------------------------------------------------------------------ + + PolyPath& PolyPath::GetChild(unsigned index) { - if (pp2->Pt == Pt) return true; - pp2 = pp2->Next; + if (index < 0 || index >= childs_.size()) + throw ClipperException("invalid range in PolyPath::GetChild."); + return *childs_[index]; } - 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(;;) + //------------------------------------------------------------------------------ + + PolyPath* PolyPath::GetParent() const { return parent_; } + + //------------------------------------------------------------------------------ + Path &PolyPath::GetPath() { return path_; } + + //------------------------------------------------------------------------------ + bool PolyPath::IsHole() const { - 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; + bool result = true; + PolyPath* pp = parent_; + while (pp) { + result = !result; + pp = pp->parent_; } - 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; + return result; } - 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) + + //------------------------------------------------------------------------------ + // miscellaneous functions ... + //------------------------------------------------------------------------------ + + inline int64_t Round(double val) { - ip.Y = Edge1.Curr.Y; - ip.X = TopX(Edge1, ip.Y); - return; + if ((val < 0)) return static_cast(val - 0.5); + else return static_cast(val + 0.5); } - else if (Edge1.Dx == 0) + //------------------------------------------------------------------------------ + + inline double Abs(double val) { return val < 0 ? -val : val; } + //------------------------------------------------------------------------------ + + inline int Abs(int val) { return val < 0 ? -val : val; } + //------------------------------------------------------------------------------ + + inline bool IsOdd(int val) { return val & 1 ? true : false; } + //------------------------------------------------------------------------------ + + inline bool IsHotEdge(const Active &e) { return (e.outrec); } + //------------------------------------------------------------------------------ + + inline bool IsOpen(const Active &e) { return (e.local_min->is_open); } + //------------------------------------------------------------------------------ + + inline bool IsStartSide(const Active &e) { return (&e == e.outrec->start_e); } + //------------------------------------------------------------------------------ + + inline void SwapSides(OutRec &outrec) { - ip.X = Edge1.Bot.X; - if (IsHorizontal(Edge2)) - ip.Y = Edge2.Bot.Y; - else - { - b2 = Edge2.Bot.Y - (Edge2.Bot.X / Edge2.Dx); - ip.Y = Round(ip.X / Edge2.Dx + b2); - } + Active *e2 = outrec.start_e; + outrec.start_e = outrec.end_e; + outrec.end_e = e2; + outrec.pts = outrec.pts->next; } - else if (Edge2.Dx == 0) + //------------------------------------------------------------------------------ + + bool FixOrientation(Active &e) { - ip.X = Edge2.Bot.X; - if (IsHorizontal(Edge1)) - ip.Y = Edge1.Bot.Y; - else - { - b1 = Edge1.Bot.Y - (Edge1.Bot.X / Edge1.Dx); - ip.Y = Round(ip.X / Edge1.Dx + b1); + bool result = true; + Active* e2 = &e; + while (e2->prev_in_ael) { + e2 = e2->prev_in_ael; + if (e2->outrec && !IsOpen(*e2)) result = !result; } - } - 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); + if (result != IsStartSide(e)) { + if (result) e.outrec->flag = orOuter; + else e.outrec->flag = orInner; + SwapSides(*e.outrec); + return true; //all fixed + } + else return false; //no fix needed } + //------------------------------------------------------------------------------ - 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) + inline bool IsHorizontal(const Active &e) { return (e.dx == CLIPPER_HORIZONTAL); } + //------------------------------------------------------------------------------ + + inline int64_t TopX(const Active &edge, const int64_t currentY) { - 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); + return (currentY == edge.top.y) ? + edge.top.x : + edge.bot.x + Round(edge.dx *(currentY - edge.bot.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 ) + //------------------------------------------------------------------------------ + + inline int64_t GetTopDeltaX(const Active &e1, const Active &e2) { - OutPt *tmpPp = pp; - pp = pp->Next; - delete tmpPp; + return (e1.top.y > e2.top.y) ? + TopX(e2, e1.top.y) - e1.top.x : + e2.top.x - TopX(e1, e2.top.y); } -} -//------------------------------------------------------------------------------ - -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; + //---------------------------------------------------------------------------- + + inline void SwapActives(Active *&e1, Active *&e2) { + Active *e = e1; e1 = e2; e2 = e; } - 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 + //---------------------------------------------------------------------- + + inline void MoveEdgeToFollowLeftInAEL(Active &e, Active &eLeft) { - 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; + Active *aelPrev, *aelNext; + //extract first ... + aelPrev = e.prev_in_ael; + aelNext = e.next_in_ael; + aelPrev->next_in_ael = aelNext; + if (aelNext) aelNext->prev_in_ael = aelPrev; + //now reinsert ... + e.next_in_ael = eLeft.next_in_ael; + eLeft.next_in_ael->prev_in_ael = &e; + e.prev_in_ael = &eLeft; + eLeft.next_in_ael = &e; } -} -//------------------------------------------------------------------------------ - -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) + //---------------------------------------------------------------------------- + + inline bool E2InsertsBeforeE1(const Active &e1, const Active &e2, bool prefer_left) { - 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; - } + if (prefer_left) { + return e2.curr.x == e1.curr.x ? + GetTopDeltaX(e1, e2) < 0 : e2.curr.x < e1.curr.x; } - p = p->Next; + else + return e2.curr.x == e1.curr.x ? + GetTopDeltaX(e1, e2) <= 0 : e2.curr.x <= e1.curr.x; } - if (dups) + //------------------------------------------------------------------------------ + + inline PathType GetPolyType(const Active &e) { return e.local_min->polytype; } + //------------------------------------------------------------------------------ + + inline bool IsSamePolyType(const Active &e1, const Active &e2) { - //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 e1.local_min->polytype == e2.local_min->polytype; } - 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) + //------------------------------------------------------------------------------ + + Point64 GetIntersectPoint(const Active &e1, const Active &e2) { - if (Pt.X > hiRange || Pt.Y > hiRange || -Pt.X > hiRange || -Pt.Y > hiRange) - throw clipperException("Coordinate outside allowed range"); + double b1, b2; + if (e1.dx == e2.dx) return Point64(TopX(e1, e1.curr.y), e1.curr.y); + + if (e1.dx == 0) { + if (IsHorizontal(e2)) return Point64(e1.bot.x, e2.bot.y); + b2 = e2.bot.y - (e2.bot.x / e2.dx); + return Point64(e1.bot.x, Round(e1.bot.x / e2.dx + b2)); + } + else if (e2.dx == 0) { + if (IsHorizontal(e1)) return Point64(e2.bot.x, e1.bot.y); + b1 = e1.bot.y - (e1.bot.x / e1.dx); + return Point64(e2.bot.x, Round(e2.bot.x / e1.dx + b1)); + } + else { + b1 = e1.bot.x - e1.bot.y * e1.dx; + b2 = e2.bot.x - e2.bot.y * e2.dx; + double q = (b2 - b1) / (e1.dx - e2.dx); + return (std::fabs(e1.dx) < std::fabs(e2.dx)) ? + Point64(Round(e1.dx * q + b1), Round(q)) : + Point64(Round(e2.dx * q + b2), Round(q)); + } } - else if (Pt.X > loRange|| Pt.Y > loRange || -Pt.X > loRange || -Pt.Y > loRange) + //------------------------------------------------------------------------------ + + inline void SetDx(Active &e) { - useFullRange = true; - RangeTest(Pt, useFullRange); + int64_t dy = (e.top.y - e.bot.y); + e.dx = (dy == 0) ? CLIPPER_HORIZONTAL : (double)(e.top.x - e.bot.x) / dy; } -} -//------------------------------------------------------------------------------ + //--------------------------------------------------------------------------- -TEdge* FindNextLocMin(TEdge* E) -{ - for (;;) + inline Vertex& NextVertex(Active &e) { - 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.wind_dx > 0 ? *e.vertex_top->next : *e.vertex_top->prev); } - return E; -} -//------------------------------------------------------------------------------ - -TEdge* ClipperBase::ProcessBound(TEdge* E, bool NextIsForward) -{ - TEdge *Result = E; - TEdge *Horz = 0; + //------------------------------------------------------------------------------ - if (E->OutIdx == Skip) + inline bool IsMaxima(const Active &e) { - //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; - } + return (e.vertex_top->flags & vfLocalMax); + } + //------------------------------------------------------------------------------ - if (E == Result) - { - if (NextIsForward) Result = E->Next; - else Result = E->Prev; - } + void TerminateHotOpen(Active &e) { + if (e.outrec->start_e == &e) + e.outrec->start_e = NULL; 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; + e.outrec->end_e = NULL; + e.outrec = NULL; } + //------------------------------------------------------------------------------ - TEdge *EStart; - - if (IsHorizontal(*E)) + Active *GetMaximaPair(const Active &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); + Active *e2; + if (IsHorizontal(e)) { + //we can't be sure whether the MaximaPair is on the left or right, so ... + e2 = e.prev_in_ael; + while (e2 && e2->curr.x >= e.top.x) { + if (e2->vertex_top == e.vertex_top) return e2; //Found! + e2 = e2->prev_in_ael; } - 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; + e2 = e.next_in_ael; + while (e2 && (TopX(*e2, e.top.y) <= e.top.x)) { + if (e2->vertex_top == e.vertex_top) return e2; //Found! + e2 = e2->next_in_ael; + } + return NULL; } - while (E != Result) - { - E->NextInLML = E->Next; - if (IsHorizontal(*E) && E != EStart && - E->Bot.X != E->Prev->Top.X) ReverseHorizontal(*E); - E = E->Next; + else { + e2 = e.next_in_ael; + while (e2) { + if (e2->vertex_top == e.vertex_top) return e2; //Found! + e2 = e2->next_in_ael; + } + return NULL; } - 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 + } + //------------------------------------------------------------------------------ + + inline int PointCount(OutPt *op) { - 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; - } + if (!op) return 0; + OutPt *p = op; + int cnt = 0; + do { + cnt++; + p = p->next; + } while (p != op); + return cnt; + } + //------------------------------------------------------------------------------ - while (E != Result) - { - E->NextInLML = E->Prev; - if (IsHorizontal(*E) && E != EStart && E->Bot.X != E->Next->Top.X) - ReverseHorizontal(*E); - E = E->Prev; + inline void DisposeOutPts(OutPt *&op) + { + if (!op) return; + op->prev->next = NULL; + while (op) { + OutPt *tmpPp = op; + op = op->next; + delete tmpPp; } - 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 + bool IntersectListSort(IntersectNode *node1, IntersectNode *node2) { - 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]); - } + return (node2->pt.y < node1->pt.y); } - catch(...) + //------------------------------------------------------------------------------ + + inline void SetOrientation(OutRec &outrec, Active &e1, Active &e2) { - delete [] edges; - throw; //range test fails + outrec.start_e = &e1; + outrec.end_e = &e2; + e1.outrec = &outrec; + e2.outrec = &outrec; } - TEdge *eStart = &edges[0]; + //------------------------------------------------------------------------------ - //2. Remove duplicate vertices, and (when closed) collinear edges ... - TEdge *E = eStart, *eLoopStop = eStart; - for (;;) + void SwapOutrecs(Active &e1, Active &e2) { - //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; + OutRec *or1 = e1.outrec; + OutRec *or2 = e2.outrec; + if (or1 == or2) { + Active *e = or1->start_e; + or1->start_e = or1->end_e; + or1->end_e = e; + return; } - 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; + if (or1) { + if (&e1 == or1->start_e) or1->start_e = &e2; + else or1->end_e = &e2; + } + if (or2) { + if (&e2 == or2->start_e) or2->start_e = &e1; + else or2->end_e = &e1; } - E = E->Next; - if ((E == eLoopStop) || (!Closed && E->Next == eStart)) break; + e1.outrec = or2; + e2.outrec = or1; } + //------------------------------------------------------------------------------ - if ((!Closed && (E == E->Next)) || (Closed && (E->Prev == E->Next))) + inline bool EdgesAdjacentInSel(const IntersectNode &inode) { - delete [] edges; - return false; + return (inode.edge1->next_in_sel == inode.edge2) || (inode.edge1->prev_in_sel == inode.edge2); } - if (!Closed) - { - m_HasOpenPaths = true; - eStart->Prev->OutIdx = Skip; - } + //------------------------------------------------------------------------------ + // Clipper class methods ... + //------------------------------------------------------------------------------ - //3. Do second stage of edge initialization ... - E = eStart; - do + Clipper::Clipper() { - InitEdge2(*E, PolyTyp); - E = E->Next; - if (IsFlat && E->Curr.Y != eStart->Curr.Y) IsFlat = false; + Clear(); } - 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) + Clipper::~Clipper() { - 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; + Clear(); } + //------------------------------------------------------------------------------ - m_edges.push_back(edges); - bool leftBoundIsForward; - TEdge* EMin = 0; + void Clipper::CleanUp() + { + while (actives_) DeleteFromAEL(*actives_); + scanline_list_ = ScanlineList(); //resets priority_queue + DisposeAllOutRecs(); + } + //------------------------------------------------------------------------------ - //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; + void Clipper::Clear() + { + DisposeVerticesAndLocalMinima(); + curr_loc_min_ = minima_list_.begin(); + minima_list_sorted_ = false; + has_open_paths_ = false; + } + //------------------------------------------------------------------------------ - for (;;) + void Clipper::Reset() { - 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 (!minima_list_sorted_) { + std::sort(minima_list_.begin(), minima_list_.end(), LocMinSorter()); + minima_list_sorted_ = true; } + for (MinimaList::const_iterator i = minima_list_.begin(); i != minima_list_.end(); ++i) + InsertScanline((*i)->vertex->pt.y); + curr_loc_min_ = minima_list_.begin(); - 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); + actives_ = NULL; + sel_ = NULL; + } + //------------------------------------------------------------------------------ - TEdge* E2 = ProcessBound(locMin.RightBound, !leftBoundIsForward); - if (E2->OutIdx == Skip) E2 = ProcessBound(E2, !leftBoundIsForward); + inline void Clipper::InsertScanline(int64_t y) { scanline_list_.push(y); } + //------------------------------------------------------------------------------ - 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) + bool Clipper::PopScanline(int64_t &y) { - TEdge* edges = m_edges[i]; - delete [] edges; + if (scanline_list_.empty()) return false; + y = scanline_list_.top(); + scanline_list_.pop(); + while (!scanline_list_.empty() && y == scanline_list_.top()) + scanline_list_.pop(); // Pop duplicates. + return true; } - 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::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()) + bool Clipper::PopLocalMinima(int64_t y, LocalMinima *&local_minima) { - result.left = result.top = result.right = result.bottom = 0; - return result; + if (curr_loc_min_ == minima_list_.end() || (*curr_loc_min_)->vertex->pt.y != y) return false; + local_minima = (*curr_loc_min_); + ++curr_loc_min_; + return true; } - 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()) + //------------------------------------------------------------------------------ + + void Clipper::DisposeAllOutRecs() { - //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; + for (OutRecList::const_iterator i = outrec_list_.begin(); i != outrec_list_.end(); ++i) { + if ((*i)->pts) DisposeOutPts((*i)->pts); + delete (*i); } - ++lm; + outrec_list_.resize(0); } - 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) + //------------------------------------------------------------------------------ + + void Clipper::DisposeVerticesAndLocalMinima() { - 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; + for (MinimaList::iterator ml_iter = minima_list_.begin(); + ml_iter != minima_list_.end(); ++ml_iter) + delete (*ml_iter); + minima_list_.clear(); + VerticesList::iterator vl_iter; + for (vl_iter = vertex_list_.begin(); vl_iter != vertex_list_.end(); ++vl_iter) + delete[] (*vl_iter); + vertex_list_.clear(); } - else if (Edge2->NextInAEL == Edge1) + //------------------------------------------------------------------------------ + + void Clipper::AddLocMin(Vertex &vert, PathType polytype, bool is_open) { - 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; + //make sure the vertex is added only once ... + if (vfLocMin & vert.flags) return; + vert.flags |= vfLocMin; + + LocalMinima *lm = new LocalMinima(); + lm->vertex = | + lm->polytype = polytype; + lm->is_open = is_open; + minima_list_.push_back(lm); } - else + //---------------------------------------------------------------------------- + + void Clipper::AddPathToVertexList(const Path &path, PathType polytype, bool is_open) { - 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; - } + int path_len = (int)path.size(); + while (path_len > 1 && (path[path_len - 1] == path[0])) --path_len; + if (path_len < 2) return; - 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()) + int i = 1; + bool p0_is_minima = false, p0_is_maxima = false, going_up; + //find the first non-horizontal segment in the path ... + while ((i < path_len) && (path[i].y == path[0].y)) ++i; + bool is_flat = (i == path_len); + if (is_flat) { + if (!is_open) return; //Ignore closed paths that have ZERO area. + going_up = false; //And this just stops a compiler warning. + } + else { - ProcessHorizontals(); - ClearGhostJoins(); - if (!ProcessIntersections(topY)) - { - succeeded = false; - break; + going_up = path[i].y < path[0].y; //because I'm using an inverted Y-axis display + if (going_up) { + i = path_len - 1; + while (path[i].y == path[0].y) --i; + p0_is_minima = path[i].y < path[0].y; //p[0].y == a minima + } + else { + i = path_len - 1; + while (path[i].y == path[0].y) --i; + p0_is_maxima = path[i].y > path[0].y; //p[0].y == a maxima } - ProcessEdgesAtTopOfScanbeam(topY); - botY = topY; - InsertLocalMinimaIntoAEL(botY); } - } - catch(...) - { - 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); - } + Vertex *vertices = new Vertex [path_len]; + vertex_list_.push_back(vertices); - if (!m_Joins.empty()) JoinCommonEdges(); + vertices[0].pt = path[0]; + vertices[0].flags = vfNone; - //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 (is_open) { + vertices[0].flags |= vfOpenStart; + if (going_up) AddLocMin(vertices[0], polytype, is_open); + else vertices[0].flags |= vfLocalMax; } - if (m_StrictSimple) DoSimplePolygons(); - } - - 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; + //nb: polygon orientation is determined later (see InsertLocalMinimaIntoAEL). + i = 0; + for (int j = 1; j < path_len; ++j) { + if (path[j] == vertices[i].pt) continue; //ie skips duplicates + vertices[j].pt = path[j]; + vertices[j].flags = vfNone; + vertices[i].next = &vertices[j]; + vertices[j].prev = &vertices[i]; + if (path[j].y > path[i].y && going_up) { + vertices[i].flags |= vfLocalMax; + going_up = false; } - edge.WindCnt = (Inside ? 0 : 1); + else if (path[j].y < path[i].y && !going_up) { + going_up = true; + AddLocMin(vertices[i], polytype, is_open); + } + i = j; } - else - { - edge.WindCnt = edge.WindDelta; + //i: index of the last vertex in the path. + vertices[i].next = &vertices[0]; + vertices[0].prev = &vertices[i]; + + if (is_open) { + vertices[i].flags |= vfOpenEnd; + if (going_up) + vertices[i].flags |= vfLocalMax; + else AddLocMin(vertices[i], polytype, is_open); } - 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; + else if (going_up) { + //going up so find local maxima ... + Vertex *v = &vertices[i]; + while (v->next->pt.y <= v->pt.y) v = v->next; + v->flags |= vfLocalMax; + if (p0_is_minima) AddLocMin(vertices[0], polytype, is_open); + } + else { + //going down so find local minima ... + Vertex *v = &vertices[i]; + while (v->next->pt.y >= v->pt.y) v = v->next; + AddLocMin(*v, polytype, is_open); + if (p0_is_maxima) + vertices[0].flags |= vfLocalMax; } - edge.WindCnt2 = e->WindCnt2; - e = e->NextInAEL; //ie get ready to calc WindCnt2 } + //------------------------------------------------------------------------------ - //update WindCnt2 ... - if (IsEvenOddAltFillType(edge)) + void Clipper::AddPath(const Path &path, PathType polytype, bool is_open) { - //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; + if (is_open) { + if (polytype == ptClip) + throw ClipperException("AddPath: Only subject paths may be open."); + has_open_paths_ = true; } + minima_list_sorted_ = false; + AddPathToVertexList(path, polytype, is_open); } -} -//------------------------------------------------------------------------------ - -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) + void Clipper::AddPaths(const Paths &paths, PathType polytype, bool is_open) { - 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; + for (Paths::size_type i = 0; i < paths.size(); ++i) + AddPath(paths[i], polytype, is_open); } + //------------------------------------------------------------------------------ - switch(m_ClipType) + bool Clipper::IsContributingClosed(const Active& e) const { + switch (fillrule_) { + case frNonZero: + if (Abs(e.wind_cnt) != 1) return false; + break; + case frPositive: + if (e.wind_cnt != 1) return false; + break; + case frNegative: + if (e.wind_cnt != -1) return false; + break; + } + + switch (cliptype_) { case ctIntersection: - switch(pft2) - { - case pftEvenOdd: - case pftNonZero: - return (edge.WindCnt2 != 0); - case pftPositive: - return (edge.WindCnt2 > 0); - default: - return (edge.WindCnt2 < 0); + switch (fillrule_) { + case frEvenOdd: + case frNonZero: return (e.wind_cnt2 != 0); + case frPositive: return (e.wind_cnt2 > 0); + case frNegative: return (e.wind_cnt2 < 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); + switch (fillrule_) { + case frEvenOdd: + case frNonZero: return (e.wind_cnt2 == 0); + case frPositive: return (e.wind_cnt2 <= 0); + case frNegative: return (e.wind_cnt2 >= 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); + if (GetPolyType(e) == ptSubject) + switch (fillrule_) { + case frEvenOdd: + case frNonZero: return (e.wind_cnt2 == 0); + case frPositive: return (e.wind_cnt2 <= 0); + case frNegative: return (e.wind_cnt2 >= 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; + switch (fillrule_) { + case frEvenOdd: + case frNonZero: return (e.wind_cnt2 != 0); + case frPositive: return (e.wind_cnt2 > 0); + case frNegative: return (e.wind_cnt2 < 0); + }; break; - default: - return true; + case ctXor: return true; //XOr is always contributing unless open + } + return false; //we should never get here } -} -//------------------------------------------------------------------------------ - -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 + //------------------------------------------------------------------------------ + + inline bool Clipper::IsContributingOpen(const Active& e) const { - 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; + switch (cliptype_) { + case ctIntersection: return (e.wind_cnt2 != 0); + case ctUnion: return (e.wind_cnt == 0 && e.wind_cnt2 == 0); + case ctDifference: return (e.wind_cnt2 == 0); + case ctXor: return (e.wind_cnt != 0) != (e.wind_cnt2 != 0); + } + return false; //stops compiler error } + //------------------------------------------------------------------------------ - if (prevE && prevE->OutIdx >= 0 && prevE->Top.Y < Pt.Y && e->Top.Y < Pt.Y) + void Clipper::SetWindingLeftEdgeClosed(Active &e) { - 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); + //Wind counts generally refer to polygon regions not edges, so here an edge's + //WindCnt indicates the higher of the two wind counts of the regions touching + //the edge. (Note also that adjacent region wind counts only ever differ + //by one, and open paths have no meaningful wind directions or counts.) + + Active *e2 = e.prev_in_ael; + //find the nearest closed path edge of the same PolyType in AEL (heading left) + PathType pt = GetPolyType(e); + while (e2 && (GetPolyType(*e2) != pt || IsOpen(*e2))) e2 = e2->prev_in_ael; + + if (!e2) { + e.wind_cnt = e.wind_dx; + e2 = actives_; + } + else if (fillrule_ == frEvenOdd) { + e.wind_cnt = e.wind_dx; + e.wind_cnt2 = e2->wind_cnt2; + e2 = e2->next_in_ael; } + else { + //NonZero, Positive, or Negative filling here ... + //if e's WindCnt is in the SAME direction as its WindDx, then e is either + //an outer left or a hole right boundary, so edge must be inside 'e'. + //(neither e.WindCnt nor e.WindDx should ever be 0) + if (e2->wind_cnt * e2->wind_dx < 0) { + //opposite directions so edge is outside 'e' ... + if (Abs(e2->wind_cnt) > 1) { + //outside prev poly but still inside another. + if (e2->wind_dx * e.wind_dx < 0) + //reversing direction so use the same WC + e.wind_cnt = e2->wind_cnt; + else + //otherwise keep 'reducing' the WC by 1 (ie towards 0) ... + e.wind_cnt = e2->wind_cnt + e.wind_dx; + } + else + //now outside all polys of same polytype so set own WC ... + e.wind_cnt = (IsOpen(e) ? 1 : e.wind_dx); + } + else { + //edge must be inside 'e' + if (e2->wind_dx * e.wind_dx < 0) + //reversing direction so use the same WC + e.wind_cnt = e2->wind_cnt; + else + //otherwise keep 'increasing' the WC by 1 (ie away from 0) ... + e.wind_cnt = e2->wind_cnt + e.wind_dx; + }; + e.wind_cnt2 = e2->wind_cnt2; + e2 = e2->next_in_ael; //ie get ready to calc WindCnt2 + } + + //update wind_cnt2 ... + if (fillrule_ == frEvenOdd) + while (e2 != &e) { + if (GetPolyType(*e2) != pt && !IsOpen(*e2)) + e.wind_cnt2 = (e.wind_cnt2 == 0 ? 1 : 0); + e2 = e2->next_in_ael; + } + else + while (e2 != &e) { + if (GetPolyType(*e2) != pt && !IsOpen(*e2)) + e.wind_cnt2 += e2->wind_dx; + e2 = e2->next_in_ael; + } } - 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); - } - else if (!rb) - { - InsertEdgeIntoAEL(lb, 0); - SetWindingCount(*lb); - if (IsContributing(*lb)) - Op1 = AddOutPt(lb, lb->Bot); - 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); - 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.size() > 0 && (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); + void Clipper::SetWindingLeftEdgeOpen(Active &e) + { + Active *e2 = actives_; + if (fillrule_ == frEvenOdd) { + int cnt1 = 0, cnt2 = 0; + while (e2 != &e) { + if (GetPolyType(*e2) == ptClip) cnt2++; + else if (!IsOpen(*e2)) cnt1++; + e2 = e2->next_in_ael; + } + e.wind_cnt = (IsOdd(cnt1) ? 1 : 0); + e.wind_cnt2 = (IsOdd(cnt2) ? 1 : 0); + } + else { + while (e2 != &e) { + if (GetPolyType(*e2) == ptClip) e.wind_cnt2 += e2->wind_dx; + else if (!IsOpen(*e2)) e.wind_cnt += e2->wind_dx; + e2 = e2->next_in_ael; } } + } + //------------------------------------------------------------------------------ - 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); + void Clipper::InsertEdgeIntoAEL(Active &e1, Active *e2) + { + if (!actives_) { + e1.prev_in_ael = NULL; + e1.next_in_ael = NULL; + actives_ = &e1; + return; } - - 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); + if (!e2) { + if (E2InsertsBeforeE1(*actives_, e1, false)) { + e1.prev_in_ael = NULL; + e1.next_in_ael = actives_; + actives_->prev_in_ael = &e1; + actives_ = &e1; + return; + } + e2 = actives_; + while (e2->next_in_ael && + E2InsertsBeforeE1(e1, *e2->next_in_ael, false)) + e2 = e2->next_in_ael; + } + else { + while (e2->next_in_ael && + E2InsertsBeforeE1(e1, *e2->next_in_ael, true)) + e2 = e2->next_in_ael; + } + e1.next_in_ael = e2->next_in_ael; + if (e2->next_in_ael) e2->next_in_ael->prev_in_ael = &e1; + e1.prev_in_ael = e2; + e2->next_in_ael = &e1; + } + //---------------------------------------------------------------------- + + void Clipper::InsertLocalMinimaIntoAEL(int64_t bot_y) + { + LocalMinima *local_minima; + Active *left_bound, *right_bound; + //Add any local minima at BotY ... + while (PopLocalMinima(bot_y, local_minima)) { + if ((local_minima->vertex->flags & vfOpenStart) > 0) { + left_bound = NULL; + } + else { + left_bound = new Active(); + left_bound->bot = local_minima->vertex->pt; + left_bound->curr = left_bound->bot; + left_bound->vertex_top = local_minima->vertex->prev; //ie descending + left_bound->top = left_bound->vertex_top->pt; + left_bound->wind_dx = -1; + left_bound->local_min = local_minima; + SetDx(*left_bound); } - 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; - } + if ((local_minima->vertex->flags & vfOpenEnd) > 0) { + right_bound = NULL; + } + else { + right_bound = new Active(); + right_bound->bot = local_minima->vertex->pt; + right_bound->curr = right_bound->bot; + right_bound->vertex_top = local_minima->vertex->next; //ie ascending + right_bound->top = right_bound->vertex_top->pt; + right_bound->wind_dx = 1; + right_bound->local_min = local_minima; + SetDx(*right_bound); } - } - - } -} -//------------------------------------------------------------------------------ - -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; + //Currently LeftB is just the descending bound and RightB is the ascending. + //Now if the LeftB isn't on the left of RightB then we need swap them. + if (left_bound && right_bound) { + if (IsHorizontal(*left_bound)) { + if (left_bound->top.x > left_bound->bot.x) SwapActives(left_bound, right_bound); } - } - else - { - if (e1Contributing) - { - AddOutPt(e2, Pt); - if (e2Contributing) e2->OutIdx = Unassigned; + else if (IsHorizontal(*right_bound)) { + if (right_bound->top.x < right_bound->bot.x) SwapActives(left_bound, right_bound); } + else if (left_bound->dx < right_bound->dx) SwapActives(left_bound, right_bound); } - } - 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 (!left_bound) { + left_bound = right_bound; + right_bound = NULL; } - else if ((e2->WindDelta == 0) && (abs(e1->WindCnt) == 1) && - (m_ClipType != ctUnion || e1->WindCnt2 == 0)) - { - AddOutPt(e2, Pt); - if (e2Contributing) e2->OutIdx = Unassigned; + + bool contributing; + InsertEdgeIntoAEL(*left_bound, NULL); //insert left edge + if (IsOpen(*left_bound)) { + SetWindingLeftEdgeOpen(*left_bound); + contributing = IsContributingOpen(*left_bound); + } + else { + SetWindingLeftEdgeClosed(*left_bound); + contributing = IsContributingClosed(*left_bound); } - } - 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; - } + if (right_bound != NULL) { + right_bound->wind_cnt = left_bound->wind_cnt; + right_bound->wind_cnt2 = left_bound->wind_cnt2; + InsertEdgeIntoAEL(*right_bound, left_bound); //insert right edge + if (contributing) + AddLocalMinPoly(*left_bound, *right_bound, left_bound->bot); + if (IsHorizontal(*right_bound)) PushHorz(*right_bound); + else InsertScanline(right_bound->top.y); + } + else if (contributing) + StartOpenPath(*left_bound, left_bound->bot); - 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; + if (IsHorizontal(*left_bound)) PushHorz(*left_bound); + else InsertScanline(left_bound->top.y); + + if (right_bound && left_bound->next_in_ael != right_bound) { + //intersect edges that are between left and right bounds ... + Active *e = right_bound->next_in_ael; + MoveEdgeToFollowLeftInAEL(*right_bound, *left_bound); + while (right_bound->next_in_ael != e) { + //nb: For calculating winding counts etc, IntersectEdges() assumes + //that rightB will be to the right of e ABOVE the intersection ... + IntersectEdges(*right_bound, *right_bound->next_in_ael, right_bound->bot); + SwapPositionsInAEL(*right_bound, *right_bound->next_in_ael); + } //while + } //if + + } //while (PopLocalMinima()) } + //------------------------------------------------------------------------------ - cInt e1Wc, e2Wc; - switch (e1FillType) + inline void Clipper::PushHorz(Active &e) { - case pftPositive: e1Wc = e1->WindCnt; break; - case pftNegative: e1Wc = -e1->WindCnt; break; - default: e1Wc = Abs(e1->WindCnt); + e.next_in_sel = (sel_ ? sel_ : NULL); + sel_ = &e; } - switch(e2FillType) + //------------------------------------------------------------------------------ + + inline bool Clipper::PopHorz(Active *&e) { - case pftPositive: e2Wc = e2->WindCnt; break; - case pftNegative: e2Wc = -e2->WindCnt; break; - default: e2Wc = Abs(e2->WindCnt); + e = sel_; + if (!e) return false; + sel_ = sel_->next_in_sel; + return true; } + //------------------------------------------------------------------------------ - if ( e1Contributing && e2Contributing ) + OutRec* Clipper::GetOwner(const Active *e) { - if ((e1Wc != 0 && e1Wc != 1) || (e2Wc != 0 && e2Wc != 1) || - (e1->PolyTyp != e2->PolyTyp && m_ClipType != ctXor) ) - { - AddLocalMaxPoly(e1, e2, Pt); + if (IsHorizontal(*e) && e->top.x < e->bot.x) { + e = e->next_in_ael; + while (e && (!IsHotEdge(*e) || IsOpen(*e))) + e = e->next_in_ael; + if (!e) return NULL; + return ((e->outrec->flag == orOuter) == (e->outrec->start_e == e)) ? + e->outrec->owner : e->outrec; } - else - { - AddOutPt(e1, Pt); - AddOutPt(e2, Pt); - SwapSides( *e1 , *e2 ); - SwapPolyIndexes( *e1 , *e2 ); + else { + e = e->prev_in_ael; + while (e && (!IsHotEdge(*e) || IsOpen(*e))) + e = e->prev_in_ael; + if (!e) return NULL; + return ((e->outrec->flag == orOuter) == (e->outrec->end_e == e)) ? + e->outrec->owner : e->outrec; } } - 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)) + //------------------------------------------------------------------------------ + + void Clipper::AddLocalMinPoly(Active &e1, Active &e2, const Point64 pt) { - //neither edge is currently contributing ... + OutRec *outrec = CreateOutRec(); + outrec->idx = (unsigned)outrec_list_.size(); + outrec_list_.push_back(outrec); + outrec->owner = GetOwner(&e1); + outrec->polypath = NULL; - 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 (IsOpen(e1)) + outrec->flag = orOpen; + else if (!outrec->owner || outrec->owner->flag == orInner) + outrec->flag = orOuter; + else + outrec->flag = orInner; - if (e1->PolyTyp != e2->PolyTyp) - { - AddLocalMinPoly(e1, e2, Pt); + //now set orientation ... + bool swap_sides_needed = false; + if (IsHorizontal(e1)) { + if (e1.top.x > e1.bot.x) swap_sides_needed = true; } - 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; + else if (IsHorizontal(e2)) { + if (e2.top.x < e2.bot.x) swap_sides_needed = true; } - e2 = e2->PrevInAEL; - } - if (!eTmp) - { - outrec->FirstLeft = 0; - outrec->IsHole = false; - } - else - { - outrec->FirstLeft = m_PolyOuts[eTmp->OutIdx]; - outrec->IsHole = !outrec->FirstLeft->IsHole; + else if (e1.dx < e2.dx) swap_sides_needed = true; + if ((outrec->flag == orOuter) != swap_sides_needed) + SetOrientation(*outrec, e1, e2); + else + SetOrientation(*outrec, e2, e1); + + OutPt *op = CreateOutPt(); + op->pt = pt; + op->next = op; + op->prev = op; + outrec->pts = op; } -} -//------------------------------------------------------------------------------ - -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 + //------------------------------------------------------------------------------ + + void Clipper::AddLocalMaxPoly(Active &e1, Active &e2, const Point64 pt) { - 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; + if (!IsHotEdge(e2)) + throw new ClipperException("Error in AddLocalMaxPoly()."); + AddOutPt(e1, pt); + if (e1.outrec == e2.outrec) { + e1.outrec->start_e = NULL; + e1.outrec->end_e = NULL; + e1.outrec = NULL; + e2.outrec = NULL; } + //and to preserve the winding orientation of outrec ... + else if (e1.outrec->idx < e2.outrec->idx) + JoinOutrecPaths(e1, e2); else + JoinOutrecPaths(e2, e1); } + //------------------------------------------------------------------------------ - outRec1->BottomPt = 0; - if (holeStateRec == outRec2) + void Clipper::JoinOutrecPaths(Active &e1, Active &e2) { - 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; + if (IsStartSide(e1) == IsStartSide(e2)) { + //one or other edge orientation is wrong... + if (IsOpen(e1)) SwapSides(*e2.outrec); + else if (!FixOrientation(e1) && !FixOrientation(e2)) + throw new ClipperException("Error in JoinOutrecPaths()"); + if (e1.outrec->owner == e2.outrec) e1.outrec->owner = e2.outrec->owner; + } + + //join E2 outrec path onto E1 outrec path and then delete E2 outrec path + //pointers. (nb: Only very rarely do the joining ends share the same coords.) + OutPt *p1_st = e1.outrec->pts; + OutPt *p2_st = e2.outrec->pts; + OutPt *p1_end = p1_st->next; + OutPt *p2_end = p2_st->next; + if (IsStartSide(e1)) { + p2_end->prev = p1_st; + p1_st->next = p2_end; + p2_st->next = p1_end; + p1_end->prev = p2_st; + e1.outrec->pts = p2_st; + e1.outrec->start_e = e2.outrec->start_e; + if (e1.outrec->start_e) //ie closed path + e1.outrec->start_e->outrec = e1.outrec; } - e = e->NextInAEL; - } - - outRec2->Idx = outRec1->Idx; -} -//------------------------------------------------------------------------------ + else { + p1_end->prev = p2_st; + p2_st->next = p1_end; + p1_st->next = p2_end; + p2_end->prev = p1_st; + e1.outrec->end_e = e2.outrec->end_e; + if (e1.outrec->end_e) //ie closed path + e1.outrec->end_e->outrec = e1.outrec; + } + + //after joining, the E2.OutRec contains not vertices ... + e2.outrec->start_e = NULL; + e2.outrec->end_e = NULL; + e2.outrec->pts = NULL; + e2.outrec->owner = e1.outrec; //this may be redundant -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; + //and e1 and e2 are maxima and are about to be dropped from the Actives list. + e1.outrec = NULL; + e2.outrec = NULL; } -} -//------------------------------------------------------------------------------ - -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() -{ - TEdge* horzEdge; - while (PopEdgeFromSEL(horzEdge)) - ProcessHorizontal(horzEdge); -} -//------------------------------------------------------------------------------ - -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 ) + //------------------------------------------------------------------------------ + + inline void Clipper::TerminateHotOpen(Active &e) { - 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; + if (e.outrec->start_e == &e) e.outrec->start_e = NULL; + else e.outrec->end_e = NULL; + e.outrec = NULL; } - else if( Edge2->NextInSEL == Edge1 ) + //------------------------------------------------------------------------------ + + OutPt* Clipper::CreateOutPt() { - 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; + //this is a virtual method as descendant classes may need + //to produce descendant classes of OutPt ... + return new OutPt(); } - else + //------------------------------------------------------------------------------ + + OutRec* Clipper::CreateOutRec() { - 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; + //this is a virtual method as descendant classes may need + //to produce descendant classes of OutRec ... + return new OutRec(); } + //------------------------------------------------------------------------------ - 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; -} -//------------------------------------------------------------------------------ + OutPt* Clipper::AddOutPt(Active &e, const Point64 pt) + { + //Outrec.pts[0]: a circular double-linked-list of POutPt. + bool to_start = IsStartSide(e); + OutPt *start_op = e.outrec->pts; + OutPt *end_op = start_op->next; + if (to_start) { + if (pt == start_op->pt) return start_op; + } + else if (pt == end_op->pt) return end_op; + + OutPt *new_op = CreateOutPt(); + new_op->pt = pt; + end_op->prev = new_op; + new_op->prev = start_op; + new_op->next = end_op; + start_op->next = new_op; + if (to_start) e.outrec->pts = new_op; + return new_op; + } + //------------------------------------------------------------------------------ -void GetHorzDirection(TEdge& HorzEdge, Direction& Dir, cInt& Left, cInt& Right) -{ - if (HorzEdge.Bot.X < HorzEdge.Top.X) + void Clipper::StartOpenPath(Active &e, const Point64 pt) { - Left = HorzEdge.Bot.X; - Right = HorzEdge.Top.X; - Dir = dLeftToRight; - } else + OutRec *outrec = CreateOutRec(); + outrec->idx = (unsigned)outrec_list_.size(); + outrec_list_.push_back(outrec); + outrec->flag = orOpen; + outrec->owner = NULL; + outrec->polypath = NULL; + outrec->end_e = NULL; + outrec->start_e = NULL; + e.outrec = outrec; + + OutPt *op = CreateOutPt(); + op->pt = pt; + op->next = op; + op->prev = op; + outrec->pts = op; + } + //------------------------------------------------------------------------------ + + inline void Clipper::UpdateEdgeIntoAEL(Active *e) { - Left = HorzEdge.Top.X; - Right = HorzEdge.Bot.X; - Dir = dRightToLeft; + e->bot = e->top; + e->vertex_top = &NextVertex(*e); + e->top = e->vertex_top->pt; + e->curr = e->bot; + SetDx(*e); + if (!IsHorizontal(*e)) InsertScanline(e->top.y); } -} -//------------------------------------------------------------------------ + //------------------------------------------------------------------------------ -/******************************************************************************* -* 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); + void Clipper::IntersectEdges(Active &e1, Active &e2, const Point64 pt) + { + e1.curr = pt; + e2.curr = pt; - TEdge* eLastHorz = horzEdge, *eMaxPair = 0; - while (eLastHorz->NextInLML && IsHorizontal(*eLastHorz->NextInLML)) - eLastHorz = eLastHorz->NextInLML; - if (!eLastHorz->NextInLML) - eMaxPair = GetMaximaPair(eLastHorz); + //if either edge is an OPEN path ... + if (has_open_paths_ && (IsOpen(e1) || IsOpen(e2))) { + if (IsOpen(e1) && IsOpen(e2)) return; //ignore lines that intersect + Active *edge_o, *edge_c; + if (IsOpen(e1)) { edge_o = &e1; edge_c = &e2; } + else { edge_o = &e2; edge_c = &e1; } - MaximaList::const_iterator maxIt; - MaximaList::const_reverse_iterator maxRit; - if (m_Maxima.size() > 0) - { - //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(); + switch (cliptype_) { + case ctIntersection: + case ctDifference: + if (IsSamePolyType(*edge_o, *edge_c) || (Abs(edge_c->wind_cnt) != 1)) return; + break; + case ctUnion: + if (IsHotEdge(*edge_o) != ((Abs(edge_c->wind_cnt) != 1) || + (IsHotEdge(*edge_o) != (edge_c->wind_cnt != 0)))) return; //just works! + break; + case ctXor: + if (Abs(edge_c->wind_cnt) != 1) return; + break; } - 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(); + //toggle contribution ... + if (IsHotEdge(*edge_o)) { + AddOutPt(*edge_o, pt); + TerminateHotOpen(*edge_o); } - } - - 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.size() > 0) - { - 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 - { -#ifdef use_xyz - if (dir == dLeftToRight) SetZ(e->Curr, *horzEdge, *e); - else SetZ(e->Curr, *e, *horzEdge); -#endif - 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); + else StartOpenPath(*edge_o, pt); + return; + } + + //update winding counts... + //assumes that e1 will be to the right of e2 ABOVE the intersection + int old_e1_windcnt, old_e2_windcnt; + if (e1.local_min->polytype == e2.local_min->polytype) { + if (fillrule_ == frEvenOdd) { + old_e1_windcnt = e1.wind_cnt; + e1.wind_cnt = e2.wind_cnt; + e2.wind_cnt = old_e1_windcnt; + } + else { + if (e1.wind_cnt + e2.wind_dx == 0) e1.wind_cnt = -e1.wind_cnt; + else e1.wind_cnt += e2.wind_dx; + if (e2.wind_cnt - e1.wind_dx == 0) e2.wind_cnt = -e2.wind_cnt; + else e2.wind_cnt -= e1.wind_dx; + } + } + else { + if (fillrule_ != frEvenOdd) e1.wind_cnt2 += e2.wind_dx; + else e1.wind_cnt2 = (e1.wind_cnt2 == 0 ? 1 : 0); + if (fillrule_ != frEvenOdd) e2.wind_cnt2 -= e1.wind_dx; + else e2.wind_cnt2 = (e2.wind_cnt2 == 0 ? 1 : 0); + } - } //end for (;;) + switch (fillrule_) { + case frPositive: + old_e1_windcnt = e1.wind_cnt; + old_e2_windcnt = e2.wind_cnt; + break; + case frNegative: + old_e1_windcnt = -e1.wind_cnt; + old_e2_windcnt = -e2.wind_cnt; + break; + default: + old_e1_windcnt = Abs(e1.wind_cnt); + old_e2_windcnt = Abs(e2.wind_cnt); + break; + } - if (horzEdge->OutIdx >= 0 && !op1) - { - op1 = GetLastOutPt(horzEdge); - TEdge* eNextHorz = m_SortedEdges; - while (eNextHorz) + if (IsHotEdge(e1) && IsHotEdge(e2)) { + if ((old_e1_windcnt != 0 && old_e1_windcnt != 1) || (old_e2_windcnt != 0 && old_e2_windcnt != 1) || + (e1.local_min->polytype != e2.local_min->polytype && cliptype_ != ctXor)) { - 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; + AddLocalMaxPoly(e1, e2, pt); } - AddGhostJoin(op1, horzEdge->Top); - } - - if (horzEdge->NextInLML) - { - if(horzEdge->OutIdx >= 0) + else if (IsStartSide(e1)) { + AddLocalMaxPoly(e1, e2, pt); + AddLocalMinPoly(e1, e2, pt); + } + else { + AddOutPt(e1, pt); + AddOutPt(e2, pt); + SwapOutrecs(e1, e2); + } + } + else if (IsHotEdge(e1)) { + if (old_e2_windcnt == 0 || old_e2_windcnt == 1) { + AddOutPt(e1, pt); + SwapOutrecs(e1, e2); + } + } + else if (IsHotEdge(e2)) { + if (old_e1_windcnt == 0 || old_e1_windcnt == 1) { + AddOutPt(e2, pt); + SwapOutrecs(e1, e2); + } + } + else if ((old_e1_windcnt == 0 || old_e1_windcnt == 1) && + (old_e2_windcnt == 0 || old_e2_windcnt == 1)) { - op1 = AddOutPt( horzEdge, horzEdge->Top); - 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); + //neither edge is currently contributing ... + int64_t e1Wc2, e2Wc2; + switch (fillrule_) { + case frPositive: + e1Wc2 = e1.wind_cnt2; + e2Wc2 = e2.wind_cnt2; + break; + case frNegative: + e1Wc2 = -e1.wind_cnt2; + e2Wc2 = -e2.wind_cnt2; + break; + default: + e1Wc2 = Abs(e1.wind_cnt2); + e2Wc2 = Abs(e2.wind_cnt2); + break; } - 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); + + if (!IsSamePolyType(e1, e2)) { + AddLocalMinPoly(e1, e2, pt); } + else if (old_e1_windcnt == 1 && old_e2_windcnt == 1) + switch (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 (((GetPolyType(e1) == ptClip) && (e1Wc2 > 0) && (e2Wc2 > 0)) || + ((GetPolyType(e1) == ptSubject) && (e1Wc2 <= 0) && (e2Wc2 <= 0))) + AddLocalMinPoly(e1, e2, pt); + break; + case ctXor: + AddLocalMinPoly(e1, e2, pt); + break; + } } - 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(...) - { - m_SortedEdges = 0; - DisposeIntersectNodes(); - throw clipperException("ProcessIntersections error"); - } - 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 ) + //------------------------------------------------------------------------------ + + inline void Clipper::DeleteFromAEL(Active &e) { - e->PrevInSEL = e->PrevInAEL; - e->NextInSEL = e->NextInAEL; - e->Curr.X = TopX( *e, topY ); - e = e->NextInAEL; + Active* prev = e.prev_in_ael; + Active* next = e.next_in_ael; + if (!prev && !next && (&e != actives_)) return; //already deleted + if (prev) prev->next_in_ael = next; + else actives_ = next; + if (next) next->prev_in_ael = prev; + delete &e; } + //------------------------------------------------------------------------------ - //bubblesort ... - bool isModified; - do + inline void Clipper::CopyAELToSEL() { - 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; + Active* e = actives_; + sel_ = e; + while (e) { + e->prev_in_sel = e->prev_in_ael; + e->next_in_sel = e->next_in_ael; + e = e->next_in_ael; } - 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) + inline void Clipper::CopyActivesToSELAdjustCurrX(const int64_t top_y) { - IntersectNode* iNode = m_IntersectList[i]; - { - IntersectEdges( iNode->Edge1, iNode->Edge2, iNode->Pt); - SwapPositionsInAEL( iNode->Edge1 , iNode->Edge2 ); + Active* e = actives_; + sel_ = e; + while (e) { + e->prev_in_sel = e->prev_in_ael; + e->next_in_sel = e->next_in_ael; + e->curr.x = TopX(*e, top_y); + e = e->next_in_ael; } - delete iNode; } - m_IntersectList.clear(); -} -//------------------------------------------------------------------------------ - -bool IntersectListSort(IntersectNode* node1, IntersectNode* node2) -{ - return node2->Pt.Y < node1->Pt.Y; -} -//------------------------------------------------------------------------------ - -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::sort(m_IntersectList.begin(), m_IntersectList.end(), IntersectListSort); - size_t cnt = m_IntersectList.size(); - for (size_t i = 0; i < cnt; ++i) + //------------------------------------------------------------------------------ + + bool Clipper::ExecuteInternal(ClipType ct, FillRule ft) { - 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]); + if (ct == ctNone) return true; + fillrule_ = ft; + cliptype_ = ct; + Reset(); + + int64_t y; + if (!PopScanline(y)) { return false; } + for (;;) { + InsertLocalMinimaIntoAEL(y); + Active *e; + while (PopHorz(e)) ProcessHorizontal(*e); + if (!PopScanline(y)) break; //Y is now at the top of the scanbeam + ProcessIntersections(y); + DoTopOfScanbeam(y); } - SwapPositionsInSEL(m_IntersectList[i]->Edge1, m_IntersectList[i]->Edge2); + return true; } - return true; -} -//------------------------------------------------------------------------------ - -void Clipper::DoMaxima(TEdge *e) -{ - TEdge* eMaxPair = GetMaximaPairEx(e); - if (!eMaxPair) + //------------------------------------------------------------------------------ + + bool Clipper::Execute(ClipType clipType, Paths &solution_closed, FillRule ft) { - if (e->OutIdx >= 0) - AddOutPt(e, e->Top); - DeleteFromAEL(e); - return; + solution_closed.clear(); + if (!ExecuteInternal(clipType, ft)) return false; + BuildResult(solution_closed, NULL); + CleanUp(); + return true; } + //------------------------------------------------------------------------------ - TEdge* eNext = e->NextInAEL; - while(eNext && eNext != eMaxPair) + bool Clipper::Execute(ClipType clipType, Paths &solution_closed, Paths &solution_open, FillRule ft) { - IntersectEdges(e, eNext, e->Top); - SwapPositionsInAEL(e, eNext); - eNext = e->NextInAEL; + solution_closed.clear(); + solution_open.clear(); + if (!ExecuteInternal(clipType, ft)) return false; + BuildResult(solution_closed, &solution_open); + CleanUp(); + return true; } + //------------------------------------------------------------------------------ - if(e->OutIdx == Unassigned && eMaxPair->OutIdx == Unassigned) + bool Clipper::Execute(ClipType clipType, PolyPath &solution_closed, Paths &solution_open, FillRule ft) { - DeleteFromAEL(e); - DeleteFromAEL(eMaxPair); + solution_closed.Clear(); + if (!ExecuteInternal(clipType, ft)) return false; + BuildResult2(solution_closed, NULL); + CleanUp(); + return true; } - else if( e->OutIdx >= 0 && eMaxPair->OutIdx >= 0 ) + //------------------------------------------------------------------------------ + + void Clipper::ProcessIntersections(const int64_t top_y) { - if (e->OutIdx >= 0) AddLocalMaxPoly(e, eMaxPair, e->Top); - DeleteFromAEL(e); - DeleteFromAEL(eMaxPair); + BuildIntersectList(top_y); + if (intersect_list_.size() == 0) return; + FixupIntersectionOrder(); + ProcessIntersectList(); } -#ifdef use_lines - else if (e->WindDelta == 0) + //------------------------------------------------------------------------------ + + inline void Clipper::DisposeIntersectNodes() { - if (e->OutIdx >= 0) - { - AddOutPt(e, e->Top); - e->OutIdx = Unassigned; - } - DeleteFromAEL(e); + for (IntersectList::iterator node_iter = intersect_list_.begin(); + node_iter != intersect_list_.end(); ++node_iter) + delete (*node_iter); + intersect_list_.resize(0); + } + //------------------------------------------------------------------------------ - 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; - while( e ) + void Clipper::InsertNewIntersectNode(Active &e1, Active &e2, int64_t top_y) { - //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); + Point64 pt = GetIntersectPoint(e1, e2); - if(IsMaximaEdge) - { - TEdge* eMaxPair = GetMaximaPairEx(e); - IsMaximaEdge = (!eMaxPair || !IsHorizontal(*eMaxPair)); + //Rounding errors can occasionally place the calculated intersection + //point either below or above the scanbeam, so check and correct ... + if (pt.y > e1.curr.y) { + pt.y = e1.curr.y; //e.curr.y is still the bottom of scanbeam + //use the more vertical of the 2 edges to derive pt.X ... + if (Abs(e1.dx) < Abs(e2.dx)) pt.x = TopX(e1, pt.y); + else pt.x = TopX(e2, pt.y); } + else if (pt.y < top_y) { + pt.y = top_y; //top_y is at the top of the scanbeam - if(IsMaximaEdge) - { - if (m_StrictSimple) m_Maxima.push_back(e->Top.X); - TEdge* ePrev = e->PrevInAEL; - DoMaxima(e); - if( !ePrev ) e = m_ActiveEdges; - else e = ePrev->NextInAEL; + if (e1.top.y == top_y) pt.x = e1.top.x; + else if (e2.top.y == top_y) pt.x = e2.top.x; + else if (Abs(e1.dx) < Abs(e2.dx)) pt.x = e1.curr.x; + else pt.x = e2.curr.x; } - 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); - AddEdgeToSEL(e); - } - else - { - e->Curr.X = TopX( *e, topY ); - e->Curr.Y = topY; -#ifdef use_xyz - e->Curr.Z = topY == e->Top.Y ? e->Top.Z : (topY == e->Bot.Y ? e->Bot.Z : 0); -#endif - } - - //When StrictlySimple and 'e' is being touched by another edge, then - //make sure both edges have a vertex here ... - if (m_StrictSimple) - { - TEdge* ePrev = e->PrevInAEL; - if ((e->OutIdx >= 0) && (e->WindDelta != 0) && ePrev && (ePrev->OutIdx >= 0) && - (ePrev->Curr.X == e->Curr.X) && (ePrev->WindDelta != 0)) - { - 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 - } - } - e = e->NextInAEL; - } + IntersectNode *node = new IntersectNode(); + node->edge1 = &e1; + node->edge2 = &e2; + node->pt = pt; + intersect_list_.push_back(node); } + //------------------------------------------------------------------------------ - //3. Process horizontals at the Top of the scanbeam ... - m_Maxima.sort(); - ProcessHorizontals(); - m_Maxima.clear(); - - //4. Promote intermediate vertices ... - e = m_ActiveEdges; - while(e) + void Clipper::BuildIntersectList(const int64_t top_y) { - 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 (!actives_ || !actives_->next_in_ael) return; + CopyActivesToSELAdjustCurrX(top_y); - 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; - } + //Merge sort actives_ into their new positions at the top of scanbeam, and + //create an intersection node every time an edge crosses over another ... + //see also https://stackoverflow.com/a/46319131/359538 + int mul = 1; + while (true) { - //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; + Active *first = sel_, *second = NULL, *baseE, *prev_base = NULL, *tmp; + //sort successive larger 'mul' count of nodes ... + while (first) { + if (mul == 1) { + second = first->next_in_sel; + if (!second) { + first->merge_jump = NULL; + break; + } + first->merge_jump = second->next_in_sel; } - else if (pp == lastOK) break; - else - { - if (!lastOK) lastOK = pp; - pp = pp->Next; + else { + second = first->merge_jump; + if (!second) { + first->merge_jump = NULL; + break; + } + first->merge_jump = second->merge_jump; } - } - 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 i = 0; i < cnt; ++i) - { - 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; - } - } + //now sort first and second groups ... + baseE = first; + int lCnt = mul, rCnt = mul; + while (lCnt > 0 && rCnt > 0) { + if (second->curr.x < first->curr.x) { + // create one or more Intersect nodes /////////// + tmp = second->prev_in_sel; + for (int i = 0; i < lCnt; ++i) { + //create a new intersect node... + InsertNewIntersectNode(*tmp, *second, top_y); + tmp = tmp->prev_in_sel; + } + ///////////////////////////////////////////////// - //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); + if (first == baseE) { + if (prev_base) prev_base->merge_jump = second; + baseE = second; + baseE->merge_jump = first->merge_jump; + if (!first->prev_in_sel) sel_ = second; + } + tmp = second->next_in_sel; + //now move the out of place edge to it's new position in SEL ... + Insert2Before1InSel(*first, *second); + second = tmp; + if (!second) break; + --rCnt; + } + else { + first = first->next_in_sel; + --lCnt; + } } - else if (outRec->FirstLeft && outRec->FirstLeft->PolyNd) - outRec->FirstLeft->PolyNd->AddChild(*outRec->PolyNd); - else - polytree.AddChild(*outRec->PolyNd); + first = baseE->merge_jump; + prev_base = baseE; + } + if (!sel_->merge_jump) break; + else mul <<= 1; } -} -//------------------------------------------------------------------------------ - -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) + bool Clipper::ProcessIntersectList() { - 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); + for (IntersectList::iterator node_iter = intersect_list_.begin(); + node_iter != intersect_list_.end(); ++node_iter) { + IntersectNode *iNode = *node_iter; + IntersectEdges(*iNode->edge1, *iNode->edge2, iNode->pt); + SwapPositionsInAEL(*iNode->edge1, *iNode->edge2); } - } - 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)) - { - //Strictly Simple join ... - if (outRec1 != outRec2) return false; - 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; + DisposeIntersectNodes(); + return true; + } + //------------------------------------------------------------------------------ + + void Clipper::FixupIntersectionOrder() + { + size_t cnt = intersect_list_.size(); + if (cnt < 2) return; + //It's important that edge intersections are processed from the bottom up, + //but it's also crucial that intersections only occur between adjacent edges. + //The first sort here (a quicksort), arranges intersections relative to their + //vertical positions within the scanbeam ... + std::sort(intersect_list_.begin(), intersect_list_.end(), IntersectListSort); + + //Now we simulate processing these intersections, and as we do, we make sure + //that the intersecting edges remain adjacent. If they aren't, this simulated + //intersection is delayed until such time as these edges do become adjacent. + CopyAELToSEL(); + for (size_t i = 0; i < cnt; ++i) { + if (!EdgesAdjacentInSel(*intersect_list_[i])) { + size_t j = i + 1; + while (!EdgesAdjacentInSel(*intersect_list_[j])) j++; + std::swap(intersect_list_[i], intersect_list_[j]); + } + SwapPositionsInSEL(*intersect_list_[i]->edge1, *intersect_list_[i]->edge2); + } + } + //------------------------------------------------------------------------------ + + void Clipper::SwapPositionsInAEL(Active &e1, Active &e2) + { + //check that one or other edge hasn't already been removed from AEL ... + if (e1.next_in_ael == e1.prev_in_ael || + e2.next_in_ael == e2.prev_in_ael) return; + + Active *next, *prev; + if (e1.next_in_ael == &e2) { + next = e2.next_in_ael; + if (next) next->prev_in_ael = &e1; + prev = e1.prev_in_ael; + if (prev) prev->next_in_ael = &e2; + e2.prev_in_ael = prev; + e2.next_in_ael = &e1; + e1.prev_in_ael = &e2; + e1.next_in_ael = next; + } + else if (e2.next_in_ael == &e1) { + next = e1.next_in_ael; + if (next) next->prev_in_ael = &e2; + prev = e2.prev_in_ael; + if (prev) prev->next_in_ael = &e1; + e1.prev_in_ael = prev; + e1.next_in_ael = &e2; + e2.prev_in_ael = &e1; + e2.next_in_ael = next; + } + else { + next = e1.next_in_ael; + prev = e1.prev_in_ael; + e1.next_in_ael = e2.next_in_ael; + if (e1.next_in_ael) e1.next_in_ael->prev_in_ael = &e1; + e1.prev_in_ael = e2.prev_in_ael; + if (e1.prev_in_ael) e1.prev_in_ael->next_in_ael = &e1; + e2.next_in_ael = next; + if (e2.next_in_ael) e2.next_in_ael->prev_in_ael = &e2; + e2.prev_in_ael = prev; + if (e2.prev_in_ael) e2.prev_in_ael->next_in_ael = &e2; + } + + if (!e1.prev_in_ael) actives_ = &e1; + else if (!e2.prev_in_ael) actives_ = &e2; + } + //------------------------------------------------------------------------------ + + void Clipper::SwapPositionsInSEL(Active &e1, Active &e2) + { + if (!e1.next_in_sel && !e1.prev_in_sel) return; + if (!e2.next_in_sel && !e2.prev_in_sel) return; + + if (e1.next_in_sel == &e2) { + Active* Next = e2.next_in_sel; + if (Next) Next->prev_in_sel = &e1; + Active* Prev = e1.prev_in_sel; + if (Prev) Prev->next_in_sel = &e2; + e2.prev_in_sel = Prev; + e2.next_in_sel = &e1; + e1.prev_in_sel = &e2; + e1.next_in_sel = Next; + } + else if (e2.next_in_sel == &e1) { + Active* Next = e1.next_in_sel; + if (Next) Next->prev_in_sel = &e2; + Active* Prev = e2.prev_in_sel; + if (Prev) Prev->next_in_sel = &e1; + e1.prev_in_sel = Prev; + e1.next_in_sel = &e2; + e2.prev_in_sel = &e1; + e2.next_in_sel = Next; + } + else { + Active* Next = e1.next_in_sel; + Active* Prev = e1.prev_in_sel; + e1.next_in_sel = e2.next_in_sel; + if (e1.next_in_sel) e1.next_in_sel->prev_in_sel = &e1; + e1.prev_in_sel = e2.prev_in_sel; + if (e1.prev_in_sel) e1.prev_in_sel->next_in_sel = &e1; + e2.next_in_sel = Next; + if (e2.next_in_sel) e2.next_in_sel->prev_in_sel = &e2; + e2.prev_in_sel = Prev; + if (e2.prev_in_sel) e2.prev_in_sel->next_in_sel = &e2; + } + + if (!e1.prev_in_sel) sel_ = &e1; + else if (!e2.prev_in_sel) sel_ = &e2; + } + //------------------------------------------------------------------------------ + + void Clipper::Insert2Before1InSel(Active &first, Active &second) + { + //remove second from list ... + Active *prev = second.prev_in_sel; + Active *next = second.next_in_sel; + prev->next_in_sel = next; //always a prev since we're moving from right to left + if (next) next->prev_in_sel = prev; + //insert back into list ... + prev = first.prev_in_sel; + if (prev) prev->next_in_sel = &second; + first.prev_in_sel = &second; + second.prev_in_sel = prev; + second.next_in_sel = &first; + } + //------------------------------------------------------------------------------ + + bool Clipper::ResetHorzDirection(Active &horz, Active *max_pair, int64_t &horz_left, int64_t &horz_right) + { + if (horz.bot.x == horz.top.x) { + //the horizontal edge is going nowhere ... + horz_left = horz.curr.x; + horz_right = horz.curr.x; + Active *e = horz.next_in_ael; + while (e && e != max_pair) e = e->next_in_ael; + return e != NULL; + } + else if (horz.curr.x < horz.top.x) { + horz_left = horz.curr.x; + horz_right = horz.top.x; 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; + else { + horz_left = horz.top.x; + horz_right = horz.curr.x; + return false; //right to left + } + } + //------------------------------------------------------------------------------ + + void Clipper::ProcessHorizontal(Active &horz) + /******************************************************************************* + * 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 the bottom vertices of * + * other HEs[#] and with non-horizontal edges [*]. Once these intersections * + * are completed, intermediate HEs are 'promoted' to the next edge in their * + * bounds, and they in turn may be intersected[%] by other HEs. * + * * + * eg: 3 horizontals at a scanline: / | / / * + * | / | (HE3)o ========%========== o * + * o ======= o(HE2) / | / / * + * o ============#=========*======*========#=========o (HE1) * + * / | / | / * + *******************************************************************************/ + { + Point64 pt; + //with closed paths, simplify consecutive horizontals into a 'single' edge ... + if (!IsOpen(horz)) { + pt = horz.bot; + while (!IsMaxima(horz) && NextVertex(horz).pt.y == pt.y) + UpdateEdgeIntoAEL(&horz); + horz.bot = pt; + horz.curr = pt; }; - 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)) - 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 ... - OutRec* orfl = OuterOutRec->FirstLeft; - 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 != orfl && firstLeft != InnerOutRec && firstLeft != OuterOutRec) - continue; - if (Poly2ContainsPoly1(outRec->Pts, InnerOutRec->Pts)) - outRec->FirstLeft = InnerOutRec; - else if (Poly2ContainsPoly1(outRec->Pts, OuterOutRec->Pts)) - outRec->FirstLeft = OuterOutRec; - else if (outRec->FirstLeft == InnerOutRec || outRec->FirstLeft == OuterOutRec) - outRec->FirstLeft = orfl; - } -} -//---------------------------------------------------------------------- -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]; - OutRec* firstLeft = ParseFirstLeft(outRec->FirstLeft); - if (outRec->Pts && 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->Pts = join->OutPt1; - outRec1->BottomPt = 0; - outRec2 = CreateOutRec(); - outRec2->Pts = join->OutPt2; - - //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; + Active *max_pair = NULL; + if (IsMaxima(horz) && (!IsOpen(horz) || + ((horz.vertex_top->flags & (vfOpenStart | vfOpenEnd)) == 0))) + max_pair = GetMaximaPair(horz); + + int64_t horz_left, horz_right; + bool is_left_to_right = ResetHorzDirection(horz, max_pair, horz_left, horz_right); + if (IsHotEdge(horz)) AddOutPt(horz, horz.curr); + + while (true) { //loops through consec. horizontal edges (if open) + Active *e; + bool isMax = IsMaxima(horz); + if (is_left_to_right) + e = horz.next_in_ael; else + e = horz.prev_in_ael; + while (e) { + //break if we've gone past the } of the horizontal ... + if ((is_left_to_right && (e->curr.x > horz_right)) || + (!is_left_to_right && (e->curr.x < horz_left))) break; + //or if we've got to the } of an intermediate horizontal edge ... + if (e->curr.x == horz.top.x && !isMax && !IsHorizontal(*e)) { + pt = NextVertex(horz).pt; + if (is_left_to_right && (TopX(*e, pt.y) >= pt.x) || + (!is_left_to_right && (TopX(*e, pt.y) <= pt.x))) break; + }; - if (m_UsingPolyTree) FixupFirstLefts2(outRec1, outRec2); + if (e == max_pair) { + if (IsHotEdge(horz)) { + if (is_left_to_right) + AddLocalMaxPoly(horz, *e, horz.top); + else + AddLocalMaxPoly(*e, horz, horz.top); + } + DeleteFromAEL(*e); + DeleteFromAEL(horz); + return; + }; - 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; + if (is_left_to_right) { + pt = Point64(e->curr.x, horz.curr.y); + IntersectEdges(horz, *e, pt); + } + else { + pt = Point64(e->curr.x, horz.curr.y); + IntersectEdges(*e, horz, pt); + } - //fixup FirstLeft pointers that may need reassigning to OutRec2 - if (m_UsingPolyTree) FixupFirstLefts1(outRec1, outRec2); + Active *next_e; + if (is_left_to_right) next_e = e->next_in_ael; + else next_e = e->prev_in_ael; + SwapPositionsInAEL(horz, *e); + e = next_e; } - - } else - { - //joined 2 polygons together ... - outRec2->Pts = 0; - outRec2->BottomPt = 0; - outRec2->Idx = outRec1->Idx; + //check if we've finished with (consecutive) horizontals ... + if (isMax || NextVertex(horz).pt.y != horz.top.y) break; - outRec1->IsHole = holeStateRec->IsHole; - if (holeStateRec == outRec2) - outRec1->FirstLeft = outRec2->FirstLeft; - outRec2->FirstLeft = outRec1; + //still more horizontals in bound to process ... + UpdateEdgeIntoAEL(&horz); + is_left_to_right = ResetHorzDirection(horz, max_pair, horz_left, horz_right); - if (m_UsingPolyTree) FixupFirstLefts3(outRec2, outRec1); + if (IsOpen(horz)) { + if (IsMaxima(horz)) max_pair = GetMaximaPair(horz); + if (IsHotEdge(horz)) AddOutPt(horz, horz.bot); + } } - } -} - -//------------------------------------------------------------------------------ -// 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 (IsHotEdge(horz)) AddOutPt(horz, horz.top); + if (!IsOpen(horz)) + UpdateEdgeIntoAEL(&horz); //this is the } of an intermediate horiz. + else if (!IsMaxima(horz)) + UpdateEdgeIntoAEL(&horz); + else if (!max_pair) //ie open at top + DeleteFromAEL(horz); + else if (IsHotEdge(horz)) + AddLocalMaxPoly(horz, *max_pair, horz.top); + else { + DeleteFromAEL(*max_pair); DeleteFromAEL(horz); + } + } + //------------------------------------------------------------------------------ + + void Clipper::DoTopOfScanbeam(const int64_t y) + { + sel_ = NULL; //reused to flag horizontals + Active *e = actives_; + while (e) { + //nb: E will never be horizontal at this point + if (e->top.y == y) { + e->curr = e->top; //needed for horizontal processing + if (IsMaxima(*e)) { + e = DoMaxima(*e); //TOP OF BOUND (MAXIMA) + continue; + } + else { + //INTERMEDIATE VERTEX ... + UpdateEdgeIntoAEL(e); + if (IsHotEdge(*e))AddOutPt(*e, e->bot); + if (IsHorizontal(*e)) + PushHorz(*e); //horizontals are processed later + } + } + else { + e->curr.y = y; + e->curr.x = TopX(*e, y); + } + e = e->next_in_ael; } - 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)) + Active* Clipper::DoMaxima(Active &e) { - 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); + Active *next_e, *prev_e, *max_pair; + prev_e = e.prev_in_ael; + next_e = e.next_in_ael; + if (IsOpen(e) && ((e.vertex_top->flags & (vfOpenStart | vfOpenEnd)) != 0)) { + if (IsHotEdge(e)) AddOutPt(e, e.top); + if (!IsHorizontal(e)) { + if (IsHotEdge(e)) TerminateHotOpen(e); + DeleteFromAEL(e); + } + return next_e; } - } -} -//------------------------------------------------------------------------------ - -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.size() > 0) 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 { + max_pair = GetMaximaPair(e); + if (!max_pair) return next_e; //eMaxPair is horizontal } - else - solution.Clear(); - } -} -//------------------------------------------------------------------------------ -void ClipperOffset::DoOffset(double delta) -{ - m_destPolys.clear(); - m_delta = delta; + //only non-horizontal maxima here. + //process any edges between maxima pair ... + while (next_e != max_pair) { + IntersectEdges(e, *next_e, e.top); + SwapPositionsInAEL(e, *next_e); + next_e = e.next_in_ael; + } - //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); + if (IsOpen(e)) { + if (IsHotEdge(e)) { + if (max_pair) + AddLocalMaxPoly(e, *max_pair, e.top); else + AddOutPt(e, e.top); + } + if (max_pair) DeleteFromAEL(*max_pair); + DeleteFromAEL(e); + return (prev_e ? prev_e->next_in_ael : actives_); } - return; + //here E.next_in_ael == ENext == EMaxPair ... + if (IsHotEdge(e)) + AddLocalMaxPoly(e, *max_pair, e.top); + + DeleteFromAEL(e); + DeleteFromAEL(*max_pair); + return (prev_e ? prev_e->next_in_ael : actives_); } + //------------------------------------------------------------------------------ - //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++) + void Clipper::BuildResult(Paths &solution_closed, Paths *solution_open) { - 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; + solution_closed.resize(0); + solution_closed.reserve(outrec_list_.size()); + if (solution_open) { + solution_open->resize(0); + solution_open->reserve(outrec_list_.size()); } - //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) + for (OutRecList::const_iterator ol_iter = outrec_list_.begin(); + ol_iter != outrec_list_.end(); ++ol_iter) { - 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); + OutRec *outrec = *ol_iter; + if (!outrec->pts) continue; + OutPt *op = outrec->pts->next; + int cnt = PointCount(op); + //fixup for duplicate start and } points ... + if (op->pt == outrec->pts->pt) cnt--; - 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); + bool is_open = (outrec->flag == orOpen); + if (cnt < 2 || (!is_open && cnt == 2) || (is_open && !solution_open)) continue; + Path p; + p.reserve(cnt); + for (int i = 0; i < cnt; i++) { p.push_back(op->pt); op = op->next; } + if (is_open) solution_open->push_back(p); + else solution_closed.push_back(p); } } -} -//------------------------------------------------------------------------------ - -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) + //------------------------------------------------------------------------------ + + void Clipper::BuildResult2(PolyPath &pt, Paths *solution_open) { - //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; + pt.Clear(); + if (solution_open) { + solution_open->resize(0); + solution_open->reserve(outrec_list_.size()); } - //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) + for (OutRecList::const_iterator ol_iter = outrec_list_.begin(); + ol_iter != outrec_list_.end(); ++ol_iter) { - 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; + OutRec *outrec = *ol_iter; + if (!outrec->pts) continue; + OutPt *op = outrec->pts->next; + int cnt = PointCount(op); + //fixup for duplicate start and } points ... + if (op->pt == outrec->pts->pt) cnt--; + + bool is_open = (outrec->flag == orOpen); + if (cnt < 2 || (!is_open && cnt == 2) || (is_open && !solution_open)) continue; + + Path p; + p.reserve(cnt); + for (int i = 0; i < cnt; i++) { p.push_back(op->pt); op = op->next; } + if (is_open) + solution_open->push_back(p); + else if (outrec->owner && outrec->owner->polypath) + outrec->polypath = &outrec->owner->polypath->AddChild(p); + else + outrec->polypath = &pt.AddChild(p); } - 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 -//------------------------------------------------------------------------------ - -void Clipper::DoSimplePolygons() -{ - PolyOutList::size_type i = 0; - while (i < m_PolyOuts.size()) + //------------------------------------------------------------------------------ + + Rect64 Clipper::GetBounds() { - OutRec* outrec = m_PolyOuts[i++]; - OutPt* op = outrec->Pts; - if (!op || outrec->IsOpen) continue; - do //for each Pt in Polygon until duplicate found do ... - { - OutPt* op2 = op->Next; - while (op2 != outrec->Pts) - { - if ((op->Pt == op2->Pt) && 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->Pts = op; - OutRec* outrec2 = CreateOutRec(); - outrec2->Pts = op2; - 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); - } - 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); - } - else - { - //the 2 polygons are separate ... - outrec2->IsHole = outrec->IsHole; - outrec2->FirstLeft = outrec->FirstLeft; - if (m_UsingPolyTree) FixupFirstLefts1(outrec, outrec2); - } - op2 = op; //ie get ready for the Next iteration - } - op2 = op2->Next; - } - op = op->Next; + if (vertex_list_.size() == 0) return Rect64(0, 0, 0, 0); + Rect64 result = Rect64(INT64_MAX, INT64_MAX, INT64_MIN, INT64_MIN); + VerticesList::const_iterator it = vertex_list_.begin(); + while (it != vertex_list_.end()) { + Vertex *v = *it, *v2 = v; + do { + if (v2->pt.x < result.left) result.left = v2->pt.x; + if (v2->pt.x > result.right) result.right = v2->pt.x; + if (v2->pt.y < result.top) result.top = v2->pt.y; + if (v2->pt.y > result.bottom) result.bottom = v2->pt.y; + v2 = v2->next; + } while (v2 != v); + ++it; } - while (op != outrec->Pts); - } -} -//------------------------------------------------------------------------------ - -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; + return result; } + //------------------------------------------------------------------------------ - OutPt* outPts = new OutPt[size]; - for (size_t i = 0; i < size; ++i) + std::ostream& operator <<(std::ostream &s, const Point64 &pt) { - outPts[i].Pt = in_poly[i]; - outPts[i].Next = &outPts[(i + 1) % size]; - outPts[i].Next->Prev = &outPts[i]; - outPts[i].Idx = 0; + s << pt.x << "," << pt.y << " "; + return s; } + //------------------------------------------------------------------------------ - double distSqrd = distance * distance; - OutPt* op = &outPts[0]; - while (op->Idx == 0 && op->Next != op->Prev) + std::ostream& operator <<(std::ostream &s, const Path &path) { - 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 (path.empty()) return s; + Path::size_type last = path.size() -1; + for (Path::size_type i = 0; i < last; i++) s << path[i] << " "; + s << path[last] << "\n"; + return s; } + //------------------------------------------------------------------------------ - if (size < 3) size = 0; - out_poly.resize(size); - for (size_t i = 0; i < size; ++i) + std::ostream& operator <<(std::ostream &s, const Paths &paths) { - out_poly[i] = op->Pt; - op = op->Next; + for (Paths::size_type i = 0; i < paths.size(); i++) s << paths[i]; + s << "\n"; + return s; } - 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 +} //clipperlib namespace diff --git a/modules/clipper/lib/clipper.h b/thirdparty/misc/clipper.h similarity index 97% rename from modules/clipper/lib/clipper.h rename to thirdparty/misc/clipper.h index 179589471053..ac5658476f04 100644 --- a/modules/clipper/lib/clipper.h +++ b/thirdparty/misc/clipper.h @@ -49,18 +49,6 @@ struct Point64 { inline Point64 operator+(const Point64 &b) const { return Point64(x + b.x, y + b.y); } - inline void operator+=(const Point64 &b) { - x += b.x; - y += b.y; - } - inline void operator/=(const Point64 &b) { - x /= b.x; - y /= b.y; - } - inline void operator/=(const int64_t& d) { - x /= d; - y /= d; - } }; typedef std::vector< Point64 > Path; diff --git a/thirdparty/misc/clipper.hpp b/thirdparty/misc/clipper.hpp deleted file mode 100644 index 5a19617bb49f..000000000000 --- a/thirdparty/misc/clipper.hpp +++ /dev/null @@ -1,406 +0,0 @@ -/******************************************************************************* -* * -* 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 -#include -#include -#include -#include -#include -#include -#include -#include - -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 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 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 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 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/modules/clipper/lib/clipper_offset.cpp b/thirdparty/misc/clipper_offset.cpp similarity index 100% rename from modules/clipper/lib/clipper_offset.cpp rename to thirdparty/misc/clipper_offset.cpp diff --git a/modules/clipper/lib/clipper_offset.h b/thirdparty/misc/clipper_offset.h similarity index 100% rename from modules/clipper/lib/clipper_offset.h rename to thirdparty/misc/clipper_offset.h diff --git a/modules/clipper/lib/clipper_triangulation.cpp b/thirdparty/misc/clipper_triangulation.cpp similarity index 100% rename from modules/clipper/lib/clipper_triangulation.cpp rename to thirdparty/misc/clipper_triangulation.cpp diff --git a/modules/clipper/lib/clipper_triangulation.h b/thirdparty/misc/clipper_triangulation.h similarity index 100% rename from modules/clipper/lib/clipper_triangulation.h rename to thirdparty/misc/clipper_triangulation.h From 1568871d994a6c22e57320fab23379db20fc709d Mon Sep 17 00:00:00 2001 From: "Andrii Doroshenko (Xrayez)" Date: Thu, 8 Nov 2018 11:50:47 +0200 Subject: [PATCH 3/7] Attempt to fix compile errors and warnings --- modules/clipper/clipper.cpp | 5 ++++- modules/clipper/clipper.h | 9 +++++---- thirdparty/misc/clipper_offset.h | 2 +- thirdparty/misc/clipper_triangulation.cpp | 7 +++---- 4 files changed, 13 insertions(+), 10 deletions(-) diff --git a/modules/clipper/clipper.cpp b/modules/clipper/clipper.cpp index ae9efbd2d3cb..00c352262880 100644 --- a/modules/clipper/clipper.cpp +++ b/modules/clipper/clipper.cpp @@ -103,7 +103,7 @@ Vector Clipper::get_solution(int idx, SolutionType type) { Rect2 Clipper::get_bounds() { - ERR_EXPLAIN("Cannot get bounds in MODE_OFFSET"); + ERR_EXPLAIN("Cannot get solution bounds in MODE_OFFSET"); ERR_FAIL_COND_V(mode == MODE_OFFSET, Rect2()); cl::Rect64 b(0, 0, 0, 0); @@ -114,6 +114,9 @@ Rect2 Clipper::get_bounds() { b = cl.GetBounds(); } break; + case MODE_OFFSET: { + } break; + case MODE_TRIANGULATE: { b = ct.GetBounds(); } break; diff --git a/modules/clipper/clipper.h b/modules/clipper/clipper.h index 0bc18113473f..8202b55bec1b 100644 --- a/modules/clipper/clipper.h +++ b/modules/clipper/clipper.h @@ -91,16 +91,17 @@ class Clipper : public Reference { void _build_hierarchy(cl::PolyPath &p_root); private: + ClipMode mode; + bool open; - cl::PathType path_type; - cl::ClipType clip_type; + cl::FillRule fill_rule; + cl::PathType path_type; cl::JoinType join_type; cl::EndType end_type; + cl::ClipType clip_type; real_t delta; - ClipMode mode; - cl::Paths solution_closed; cl::Paths solution_open; diff --git a/thirdparty/misc/clipper_offset.h b/thirdparty/misc/clipper_offset.h index 0a8f3b985913..8649085583fb 100644 --- a/thirdparty/misc/clipper_offset.h +++ b/thirdparty/misc/clipper_offset.h @@ -50,8 +50,8 @@ namespace clipperlib { Path path_in_, path_out_; NormalsList norms_; NodeList nodes_; - double arc_tolerance_; double miter_limit_; + double arc_tolerance_; //nb: miter_lim_ below is a temp field that differs from miter_limit double delta_, sin_a_, sin_, cos_, miter_lim_, steps_per_radian_; diff --git a/thirdparty/misc/clipper_triangulation.cpp b/thirdparty/misc/clipper_triangulation.cpp index 0f975ad8abfa..98349d61fdac 100644 --- a/thirdparty/misc/clipper_triangulation.cpp +++ b/thirdparty/misc/clipper_triangulation.cpp @@ -312,10 +312,9 @@ namespace clipperlib { void ClipperTri::BuildResult(Paths &paths) { paths.clear(); paths.reserve(triangles_.size()); - for (Paths::const_iterator iter = triangles_.cbegin(); - iter != triangles_.cend(); ++iter) { - ERR_FAIL_COND((*iter).size() != 3); - paths.push_back(*iter); + for (Paths::iterator it = triangles_.begin(); it != triangles_.end(); ++it) { + ERR_FAIL_COND((*it).size() != 3); + paths.push_back(*it); } } //------------------------------------------------------------------------------ From 33ea7f92c5fd6e9c3cd4c6cbb05c8b93ae92adf8 Mon Sep 17 00:00:00 2001 From: "Andrii Doroshenko (Xrayez)" Date: Thu, 8 Nov 2018 12:38:06 +0200 Subject: [PATCH 4/7] Make Clipper exception-safe --- thirdparty/misc/clipper.cpp | 27 +++++++++++++++-------- thirdparty/misc/clipper.h | 11 --------- thirdparty/misc/clipper_offset.cpp | 6 ++--- thirdparty/misc/clipper_triangulation.cpp | 2 +- 4 files changed, 22 insertions(+), 24 deletions(-) diff --git a/thirdparty/misc/clipper.cpp b/thirdparty/misc/clipper.cpp index 7637e95f5097..7aa03d0f6107 100644 --- a/thirdparty/misc/clipper.cpp +++ b/thirdparty/misc/clipper.cpp @@ -8,6 +8,8 @@ * License : http://www.boost.org/LICENSE_1_0.txt * *******************************************************************************/ +#include "core/error_macros.h" + #include #include #include @@ -101,8 +103,8 @@ namespace clipperlib { PolyPath& PolyPath::GetChild(unsigned index) { - if (index < 0 || index >= childs_.size()) - throw ClipperException("invalid range in PolyPath::GetChild."); + // ERR_FAIL_INDEX_V(index, childs_.size(), PolyPath()); + return *childs_[index]; } //------------------------------------------------------------------------------ @@ -590,8 +592,9 @@ namespace clipperlib { void Clipper::AddPath(const Path &path, PathType polytype, bool is_open) { if (is_open) { - if (polytype == ptClip) - throw ClipperException("AddPath: Only subject paths may be open."); + ERR_EXPLAINC("AddPath: Only subject paths may be open."); + ERR_FAIL_COND(polytype == ptClip) + has_open_paths_ = true; } minima_list_sorted_ = false; @@ -965,8 +968,9 @@ namespace clipperlib { void Clipper::AddLocalMaxPoly(Active &e1, Active &e2, const Point64 pt) { - if (!IsHotEdge(e2)) - throw new ClipperException("Error in AddLocalMaxPoly()."); + ERR_EXPLAINC("Error in AddLocalMaxPoly()."); + ERR_FAIL_COND(!IsHotEdge(e2)) + AddOutPt(e1, pt); if (e1.outrec == e2.outrec) { e1.outrec->start_e = NULL; @@ -986,9 +990,14 @@ namespace clipperlib { if (IsStartSide(e1) == IsStartSide(e2)) { //one or other edge orientation is wrong... - if (IsOpen(e1)) SwapSides(*e2.outrec); - else if (!FixOrientation(e1) && !FixOrientation(e2)) - throw new ClipperException("Error in JoinOutrecPaths()"); + if (IsOpen(e1)) { + SwapSides(*e2.outrec); + } + else if (!FixOrientation(e1) && !FixOrientation(e2)) { + ERR_EXPLAINC("Error in JoinOutrecPaths()"); + ERR_FAIL(); + } + if (e1.outrec->owner == e2.outrec) e1.outrec->owner = e2.outrec->owner; } diff --git a/thirdparty/misc/clipper.h b/thirdparty/misc/clipper.h index ac5658476f04..56460407eb9e 100644 --- a/thirdparty/misc/clipper.h +++ b/thirdparty/misc/clipper.h @@ -221,17 +221,6 @@ class Clipper { #define CLIPPER_HORIZONTAL (-DBL_MAX) -class ClipperException : public std::exception -{ - public: - ClipperException(const char* description): descr_(description) {} - virtual ~ClipperException() throw() {} - virtual const char* what() const throw() {return descr_.c_str();} - private: - std::string descr_; -}; -//------------------------------------------------------------------------------ - } //clipperlib namespace #endif //clipper_h diff --git a/thirdparty/misc/clipper_offset.cpp b/thirdparty/misc/clipper_offset.cpp index 7157cae7714e..154fed64eb5a 100644 --- a/thirdparty/misc/clipper_offset.cpp +++ b/thirdparty/misc/clipper_offset.cpp @@ -17,7 +17,7 @@ namespace clipperlib { - #define PI (3.14159265358979323846) + #define PI (3.14159265358979323846) #define TWO_PI (PI * 2) #define DEFAULT_ARC_FRAC (0.02) #define TOLERANCE (1.0E-12) @@ -81,7 +81,7 @@ namespace clipperlib { for (size_t i = 1, last = 0; i < len_path; ++i) { if (last_pt == p[i]) continue; - last++; + last++; path.push_back(p[i]); last_pt = p[i]; //j == path.size() -1; @@ -361,7 +361,7 @@ namespace clipperlib { pt1 = Point64(Round(path_in_[j].x + norms_[j].x * delta_), Round(path_in_[j].y + norms_[j].y * delta_)); path_out_.push_back(pt1); - pt1 = Point64(Round(path_in_[j].x - norms_[j].x * delta_), + pt1 = Point64(Round(path_in_[j].x - norms_[j].x * delta_), Round(path_in_[j].y - norms_[j].y * delta_)); path_out_.push_back(pt1); } diff --git a/thirdparty/misc/clipper_triangulation.cpp b/thirdparty/misc/clipper_triangulation.cpp index 98349d61fdac..94a4412a3c88 100644 --- a/thirdparty/misc/clipper_triangulation.cpp +++ b/thirdparty/misc/clipper_triangulation.cpp @@ -8,7 +8,7 @@ * License : http://www.boost.org/LICENSE_1_0.txt * *******************************************************************************/ -#include "core/reference.h" +#include "core/error_macros.h" #include #include From a23d4a177987f5698062d77d2d337c441649e124 Mon Sep 17 00:00:00 2001 From: "Andrii Doroshenko (Xrayez)" Date: Wed, 28 Nov 2018 16:27:09 +0200 Subject: [PATCH 5/7] Add convenience methods for polygon clipping, offseting and triangulation Open paths clipping is supported via specifying `is_a_open` parameter. --- modules/clipper/clipper.cpp | 148 ++++++++++++++++++++++++++++++++++++ modules/clipper/clipper.h | 17 +++++ 2 files changed, 165 insertions(+) diff --git a/modules/clipper/clipper.cpp b/modules/clipper/clipper.cpp index 00c352262880..e91e18241b59 100644 --- a/modules/clipper/clipper.cpp +++ b/modules/clipper/clipper.cpp @@ -225,6 +225,126 @@ bool Clipper::is_hole(int idx) { return path->IsHole(); } +Array Clipper::merge(const Vector &poly_a, const Vector &poly_b, bool is_a_open) { + + cl::Clipper cl; + + const cl::Path &path_a = _scale_up(poly_a, PRECISION); + const cl::Path &path_b = _scale_up(poly_b, PRECISION); + + cl.AddPath(path_a, cl::PathType::ptSubject, is_a_open); + cl.AddPath(path_b, cl::PathType::ptClip); + + cl::Paths paths_closed; + cl::Paths paths_open; + + cl.Execute(cl::ClipType::ctUnion, paths_closed, paths_open, fill_rule); + + Array polys; + _scale_down_paths(paths_closed, polys, PRECISION); + _scale_down_paths(paths_open, polys, PRECISION); + + return polys; +} + +Array Clipper::clip(const Vector &poly_a, const Vector &poly_b, bool is_a_open) { + + cl::Clipper cl; + + const cl::Path &path_a = _scale_up(poly_a, PRECISION); + const cl::Path &path_b = _scale_up(poly_b, PRECISION); + + cl.AddPath(path_a, cl::PathType::ptSubject, is_a_open); + cl.AddPath(path_b, cl::PathType::ptClip); + + cl::Paths paths_closed; + cl::Paths paths_open; + + cl.Execute(cl::ClipType::ctDifference, paths_closed, paths_open, fill_rule); + + Array polys; + _scale_down_paths(paths_closed, polys, PRECISION); + _scale_down_paths(paths_open, polys, PRECISION); + + return polys; +} + +Array Clipper::intersect(const Vector &poly_a, const Vector &poly_b, bool is_a_open) { + + cl::Clipper cl; + + const cl::Path &path_a = _scale_up(poly_a, PRECISION); + const cl::Path &path_b = _scale_up(poly_b, PRECISION); + + cl.AddPath(path_a, cl::PathType::ptSubject, is_a_open); + cl.AddPath(path_b, cl::PathType::ptClip); + + cl::Paths paths_closed; + cl::Paths paths_open; + + cl.Execute(cl::ClipType::ctIntersection, paths_closed, paths_open, fill_rule); + + Array polys; + _scale_down_paths(paths_closed, polys, PRECISION); + _scale_down_paths(paths_open, polys, PRECISION); + + return polys; +} + +Array Clipper::exclude(const Vector &poly_a, const Vector &poly_b, bool is_a_open) { + + cl::Clipper cl; + + const cl::Path &path_a = _scale_up(poly_a, PRECISION); + const cl::Path &path_b = _scale_up(poly_b, PRECISION); + + cl.AddPath(path_a, cl::PathType::ptSubject, is_a_open); + cl.AddPath(path_b, cl::PathType::ptClip); + + cl::Paths paths_closed; + cl::Paths paths_open; + + cl.Execute(cl::ClipType::ctXor, paths_closed, paths_open, fill_rule); + + Array polys; + _scale_down_paths(paths_closed, polys, PRECISION); + _scale_down_paths(paths_open, polys, PRECISION); + + return polys; +} + +Array Clipper::offset(const Vector &poly, real_t p_offset) { + + cl::ClipperOffset co; + + const cl::Path &path = _scale_up(poly, PRECISION); + co.AddPath(path, join_type, end_type); + + cl::Paths paths; + co.Execute(paths, p_offset * PRECISION); + + Array polys; + _scale_down_paths(paths, polys, PRECISION); + + return polys; +} + +Array Clipper::triangulate(const Vector &poly) { + + cl::ClipperTri ct; + + const cl::Path &path = _scale_up(poly, PRECISION); + ct.AddPath(path, cl::PathType::ptSubject); + + cl::Paths paths; + ct.Execute(cl::ClipType::ctUnion, paths, cl::FillRule::frNonZero); + + Array triangles; + _scale_down_paths(paths, triangles, PRECISION); + + return triangles; +} + //------------------------------------------------------------------------------ void Clipper::_build_hierarchy(cl::PolyPath &p_root) { @@ -309,6 +429,25 @@ _FORCE_INLINE_ Vector Clipper::_scale_down(const cl::Path &path, real_t return points; } +_FORCE_INLINE_ void Clipper::_scale_down_paths(const cl::Paths &paths, Array &dest, real_t scale) { + + for (int i = 0; i < paths.size(); ++i) { + const Vector poly = _scale_down(paths[i], scale); + dest.push_back(poly); + } +} + +_FORCE_INLINE_ void Clipper::_scale_down_paths(const cl::Paths &paths, Vector &dest, real_t scale) { + + for (int i = 0; i < paths.size(); ++i) { + const Vector poly = _scale_down(paths[i], scale); + + for (int j = 0; j < poly.size(); ++j) { + dest.push_back(poly[j]); + } + } +} + void Clipper::_bind_methods() { //-------------------------------------------------------------------------- @@ -334,6 +473,15 @@ void Clipper::_bind_methods() { ADD_PROPERTY(PropertyInfo(Variant::RECT2, "bounds"), "", "get_bounds"); + // Convenience + ClassDB::bind_method(D_METHOD("merge", "poly_a", "poly_b", "is_a_open"), &Clipper::merge, DEFVAL(false)); + ClassDB::bind_method(D_METHOD("clip", "poly_a", "poly_b", "is_a_open"), &Clipper::clip, DEFVAL(false)); + ClassDB::bind_method(D_METHOD("intersect", "poly_a", "poly_b", "is_a_open"), &Clipper::intersect, DEFVAL(false)); + ClassDB::bind_method(D_METHOD("exclude", "poly_a", "poly_b", "is_a_open"), &Clipper::exclude, DEFVAL(false)); + + ClassDB::bind_method(D_METHOD("offset", "poly", "offset"), &Clipper::offset); + ClassDB::bind_method(D_METHOD("triangulate", "poly"), &Clipper::triangulate); + //-------------------------------------------------------------------------- // Configuration methods //-------------------------------------------------------------------------- diff --git a/modules/clipper/clipper.h b/modules/clipper/clipper.h index 8202b55bec1b..7a0da19fe299 100644 --- a/modules/clipper/clipper.h +++ b/modules/clipper/clipper.h @@ -48,6 +48,20 @@ class Clipper : public Reference { bool is_hole(int idx); + // The following convenience methods can be described as: + // - union: a + b + // - difference: a - b + // - intersection: a * b (common area) + // - xor: a ^ b (all but common area) + + Array merge(const Vector &poly_a, const Vector &poly_b, bool is_a_open = false); + Array clip(const Vector &poly_a, const Vector &poly_b, bool is_a_open = false); + Array intersect(const Vector &poly_a, const Vector &poly_b, bool is_a_open = false); + Array exclude(const Vector &poly_a, const Vector &poly_b, bool is_a_open = false); + + Array offset(const Vector &poly, real_t p_offset); // negative to shrink, positive to expand + Array triangulate(const Vector &poly); + //-------------------------------------------------------------------------- // Configuration methods //-------------------------------------------------------------------------- @@ -88,6 +102,9 @@ class Clipper : public Reference { cl::Path _scale_up(const Vector &points, real_t scale); Vector _scale_down(const cl::Path &path, real_t scale); + void _scale_down_paths(const cl::Paths &paths, Array &dest, real_t scale); + void _scale_down_paths(const cl::Paths &paths, Vector &dest, real_t scale); + void _build_hierarchy(cl::PolyPath &p_root); private: From 627bb45c0f62103aa03461c7e082756443cbb237 Mon Sep 17 00:00:00 2001 From: "Andrii Doroshenko (Xrayez)" Date: Thu, 29 Nov 2018 11:55:04 +0200 Subject: [PATCH 6/7] Attempt to fix enums --- modules/clipper/clipper.cpp | 44 ++++++++++++++++++------------------- 1 file changed, 22 insertions(+), 22 deletions(-) diff --git a/modules/clipper/clipper.cpp b/modules/clipper/clipper.cpp index e91e18241b59..06ec2d3bea9c 100644 --- a/modules/clipper/clipper.cpp +++ b/modules/clipper/clipper.cpp @@ -227,18 +227,18 @@ bool Clipper::is_hole(int idx) { Array Clipper::merge(const Vector &poly_a, const Vector &poly_b, bool is_a_open) { - cl::Clipper cl; + cl::Clipper clp; const cl::Path &path_a = _scale_up(poly_a, PRECISION); const cl::Path &path_b = _scale_up(poly_b, PRECISION); - cl.AddPath(path_a, cl::PathType::ptSubject, is_a_open); - cl.AddPath(path_b, cl::PathType::ptClip); + clp.AddPath(path_a, cl::ptSubject, is_a_open); + clp.AddPath(path_b, cl::ptClip); cl::Paths paths_closed; cl::Paths paths_open; - cl.Execute(cl::ClipType::ctUnion, paths_closed, paths_open, fill_rule); + clp.Execute(cl::ctUnion, paths_closed, paths_open, fill_rule); Array polys; _scale_down_paths(paths_closed, polys, PRECISION); @@ -249,18 +249,18 @@ Array Clipper::merge(const Vector &poly_a, const Vector &poly_ Array Clipper::clip(const Vector &poly_a, const Vector &poly_b, bool is_a_open) { - cl::Clipper cl; + cl::Clipper clp; const cl::Path &path_a = _scale_up(poly_a, PRECISION); const cl::Path &path_b = _scale_up(poly_b, PRECISION); - cl.AddPath(path_a, cl::PathType::ptSubject, is_a_open); - cl.AddPath(path_b, cl::PathType::ptClip); + clp.AddPath(path_a, cl::ptSubject, is_a_open); + clp.AddPath(path_b, cl::ptClip); cl::Paths paths_closed; cl::Paths paths_open; - cl.Execute(cl::ClipType::ctDifference, paths_closed, paths_open, fill_rule); + clp.Execute(cl::ctDifference, paths_closed, paths_open, fill_rule); Array polys; _scale_down_paths(paths_closed, polys, PRECISION); @@ -271,18 +271,18 @@ Array Clipper::clip(const Vector &poly_a, const Vector &poly_b Array Clipper::intersect(const Vector &poly_a, const Vector &poly_b, bool is_a_open) { - cl::Clipper cl; + cl::Clipper clp; const cl::Path &path_a = _scale_up(poly_a, PRECISION); const cl::Path &path_b = _scale_up(poly_b, PRECISION); - cl.AddPath(path_a, cl::PathType::ptSubject, is_a_open); - cl.AddPath(path_b, cl::PathType::ptClip); + clp.AddPath(path_a, cl::ptSubject, is_a_open); + clp.AddPath(path_b, cl::ptClip); cl::Paths paths_closed; cl::Paths paths_open; - cl.Execute(cl::ClipType::ctIntersection, paths_closed, paths_open, fill_rule); + clp.Execute(cl::ctIntersection, paths_closed, paths_open, fill_rule); Array polys; _scale_down_paths(paths_closed, polys, PRECISION); @@ -293,18 +293,18 @@ Array Clipper::intersect(const Vector &poly_a, const Vector &p Array Clipper::exclude(const Vector &poly_a, const Vector &poly_b, bool is_a_open) { - cl::Clipper cl; + cl::Clipper clp; const cl::Path &path_a = _scale_up(poly_a, PRECISION); const cl::Path &path_b = _scale_up(poly_b, PRECISION); - cl.AddPath(path_a, cl::PathType::ptSubject, is_a_open); - cl.AddPath(path_b, cl::PathType::ptClip); + clp.AddPath(path_a, cl::ptSubject, is_a_open); + clp.AddPath(path_b, cl::ptClip); cl::Paths paths_closed; cl::Paths paths_open; - cl.Execute(cl::ClipType::ctXor, paths_closed, paths_open, fill_rule); + clp.Execute(cl::ctXor, paths_closed, paths_open, fill_rule); Array polys; _scale_down_paths(paths_closed, polys, PRECISION); @@ -315,13 +315,13 @@ Array Clipper::exclude(const Vector &poly_a, const Vector &pol Array Clipper::offset(const Vector &poly, real_t p_offset) { - cl::ClipperOffset co; + cl::ClipperOffset clo; const cl::Path &path = _scale_up(poly, PRECISION); - co.AddPath(path, join_type, end_type); + clo.AddPath(path, join_type, end_type); cl::Paths paths; - co.Execute(paths, p_offset * PRECISION); + clo.Execute(paths, p_offset * PRECISION); Array polys; _scale_down_paths(paths, polys, PRECISION); @@ -331,13 +331,13 @@ Array Clipper::offset(const Vector &poly, real_t p_offset) { Array Clipper::triangulate(const Vector &poly) { - cl::ClipperTri ct; + cl::ClipperTri clt; const cl::Path &path = _scale_up(poly, PRECISION); - ct.AddPath(path, cl::PathType::ptSubject); + clt.AddPath(path, cl::ptSubject); cl::Paths paths; - ct.Execute(cl::ClipType::ctUnion, paths, cl::FillRule::frNonZero); + clt.Execute(cl::ctUnion, paths, cl::frNonZero); Array triangles; _scale_down_paths(paths, triangles, PRECISION); From a2e12c3c98bb3e38228ae742ae893c9783c72cd8 Mon Sep 17 00:00:00 2001 From: "Andrii Doroshenko (Xrayez)" Date: Wed, 6 Mar 2019 00:24:30 +0200 Subject: [PATCH 7/7] Fix Werror=sign-compare for paths size --- modules/clipper/clipper.cpp | 10 +++++----- modules/clipper/clipper.h | 4 ++-- 2 files changed, 7 insertions(+), 7 deletions(-) diff --git a/modules/clipper/clipper.cpp b/modules/clipper/clipper.cpp index 06ec2d3bea9c..501e6a67013a 100644 --- a/modules/clipper/clipper.cpp +++ b/modules/clipper/clipper.cpp @@ -63,7 +63,7 @@ void Clipper::execute(bool build_hierarchy) { } } -int Clipper::get_solution_count(SolutionType type) const { +size_t Clipper::get_solution_count(SolutionType type) const { switch (type) { @@ -78,7 +78,7 @@ int Clipper::get_solution_count(SolutionType type) const { return -1; } -Vector Clipper::get_solution(int idx, SolutionType type) { +Vector Clipper::get_solution(size_t idx, SolutionType type) { switch (type) { @@ -421,7 +421,7 @@ _FORCE_INLINE_ Vector Clipper::_scale_down(const cl::Path &path, real_t Vector points; points.resize(path.size()); - for (int i = 0; i != path.size(); ++i) { + for (size_t i = 0; i != path.size(); ++i) { points.write[i] = Point2( static_cast(path[i].x) / scale, static_cast(path[i].y) / scale); @@ -431,7 +431,7 @@ _FORCE_INLINE_ Vector Clipper::_scale_down(const cl::Path &path, real_t _FORCE_INLINE_ void Clipper::_scale_down_paths(const cl::Paths &paths, Array &dest, real_t scale) { - for (int i = 0; i < paths.size(); ++i) { + for (size_t i = 0; i < paths.size(); ++i) { const Vector poly = _scale_down(paths[i], scale); dest.push_back(poly); } @@ -439,7 +439,7 @@ _FORCE_INLINE_ void Clipper::_scale_down_paths(const cl::Paths &paths, Array &de _FORCE_INLINE_ void Clipper::_scale_down_paths(const cl::Paths &paths, Vector &dest, real_t scale) { - for (int i = 0; i < paths.size(); ++i) { + for (size_t i = 0; i < paths.size(); ++i) { const Vector poly = _scale_down(paths[i], scale); for (int j = 0; j < poly.size(); ++j) { diff --git a/modules/clipper/clipper.h b/modules/clipper/clipper.h index 7a0da19fe299..a9a2724e1c19 100644 --- a/modules/clipper/clipper.h +++ b/modules/clipper/clipper.h @@ -32,8 +32,8 @@ class Clipper : public Reference { void add_points(const Vector &points); void execute(bool build_hierarchy = false); - int get_solution_count(SolutionType type = TYPE_CLOSED) const; - Vector get_solution(int idx, SolutionType type = TYPE_CLOSED); + size_t get_solution_count(SolutionType type = TYPE_CLOSED) const; + Vector get_solution(size_t idx, SolutionType type = TYPE_CLOSED); Rect2 get_bounds(); void clear();