pax_global_header00006660000000000000000000000064143424361560014522gustar00rootroot0000000000000052 comment=c9760eefb484ad5c431b0048cc7403f90f8c8fa8 mapbox_earcut_python-1.0.1/000077500000000000000000000000001434243615600157535ustar00rootroot00000000000000mapbox_earcut_python-1.0.1/.github/000077500000000000000000000000001434243615600173135ustar00rootroot00000000000000mapbox_earcut_python-1.0.1/.github/dependabot.yml000066400000000000000000000001661434243615600221460ustar00rootroot00000000000000version: 2 updates: - package-ecosystem: "github-actions" directory: "/" schedule: interval: "weekly" mapbox_earcut_python-1.0.1/.github/workflows/000077500000000000000000000000001434243615600213505ustar00rootroot00000000000000mapbox_earcut_python-1.0.1/.github/workflows/build.yml000066400000000000000000000016521434243615600231760ustar00rootroot00000000000000name: Build on: [push, pull_request, workflow_call] jobs: build_wheels: name: Build wheels on ${{ matrix.os }} runs-on: ${{ matrix.os }} strategy: matrix: os: [ubuntu-20.04, windows-2019, macos-11] steps: - uses: actions/checkout@v3 with: submodules: recursive - name: Build wheels uses: pypa/cibuildwheel@v2.11.2 env: CIBW_ARCHS_MACOS: x86_64 arm64 CIBW_TEST_SKIP: "*_arm64 *_universal2:arm64" - name: Show files run: ls -lh wheelhouse shell: bash - uses: actions/upload-artifact@v3 with: path: ./wheelhouse/*.whl build_sdist: name: Build source distribution runs-on: ubuntu-latest steps: - uses: actions/checkout@v3 - name: Build sdist run: pipx run build --sdist - uses: actions/upload-artifact@v3 with: path: dist/*.tar.gz mapbox_earcut_python-1.0.1/.github/workflows/release.yml000066400000000000000000000015621434243615600235170ustar00rootroot00000000000000name: Release on: push: tags: - "v*.*.*" jobs: build: uses: ./.github/workflows/build.yml create_release: needs: [build] runs-on: ubuntu-latest steps: - name: Checkout uses: actions/checkout@v2 - name: Download wheels uses: actions/download-artifact@v3 with: name: artifact path: dist - name: Release uses: softprops/action-gh-release@v1 with: body_path: ./CHANGELOG.md files: "dist/*" upload_pypi: needs: [build, create_release] runs-on: ubuntu-latest steps: - name: Download wheels uses: actions/download-artifact@v3 with: name: artifact path: dist - name: Publish to pipy uses: pypa/gh-action-pypi-publish@v1.5.2 with: user: __token__ password: ${{ secrets.pypi_password }}mapbox_earcut_python-1.0.1/.gitignore000066400000000000000000000001261434243615600177420ustar00rootroot00000000000000.vscode .idea .vs venv tmp *.egg-info build dist .eggs *.so __pycache__ .pytest_cache mapbox_earcut_python-1.0.1/.gitmodules000066400000000000000000000001271434243615600201300ustar00rootroot00000000000000[submodule "pybind11"] path = pybind11 url = https://github.com/pybind/pybind11.git mapbox_earcut_python-1.0.1/CHANGELOG.md000066400000000000000000000014531434243615600175670ustar00rootroot00000000000000# Changelog ## [1.0.1] ### Fixed - Outdated `__version__` attribute ### Changed - Update `earcut.hpp` to 2.2.4 ### Added - Build for Mac ARM (apple silicon) - Build for Python 3.11 and 3.10 ## [1.0.0] ### Changed - Update `earcut.hpp` to 2.2.3 (with fixed includes, latest version from master). - Change versioning scheme to enable semantic versioning independently from upstream versioning. ## [1.0.0] ### Changed - Update `earcut.hpp` to 2.2.3 (with fixed includes, latest version from master). - Change versioning scheme to enable semantic versioning independently from upstream versioning. ## [0.12.11] - 2021-11-04 ### Fixed - Out-of-bounds memory access on empty input (thanks @musicinmybrain). - Missing import in earcut.hpp (thanks @Groctel). - `__version__` attribute stringification. mapbox_earcut_python-1.0.1/LICENSE.md000066400000000000000000000016521434243615600173630ustar00rootroot00000000000000The bindings to the earcut library are licensed under the following terms: > ISC License > > Copyright (c) 2018, Samuel Kogler > > Permission to use, copy, modify, and/or distribute this software for any purpose > with or without fee is hereby granted, provided that the above copyright notice > and this permission notice appear in all copies. > > THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH > REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND > FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, > INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS > OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER > TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF > THIS SOFTWARE. For the license of the actual earcut library, see the license file in the include folder.mapbox_earcut_python-1.0.1/MANIFEST.in000066400000000000000000000000711434243615600175070ustar00rootroot00000000000000recursive-include include * recursive-include pybind11 * mapbox_earcut_python-1.0.1/README.md000066400000000000000000000026441434243615600172400ustar00rootroot00000000000000# mapbox_earcut Python bindings for the C++ implementation of the Mapbox Earcut library, which provides very fast and quite robust triangulation of 2D polygons. Original code: [earcut.hpp](https://github.com/mapbox/earcut.hpp) Original description: > The library implements a modified ear slicing algorithm, optimized by > [z-order curve](http://en.wikipedia.org/wiki/Z-order_curve) hashing and > extended to handle holes, twisted polygons, degeneracies and self-intersections > in a way that doesn't _guarantee_ correctness of triangulation, but attempts to > always produce acceptable results for practical data like geographical shapes. Provided functions (depending on dtype of vertex data): ```python triangulate_float32 triangulate_float64 triangulate_int32 triangulate_int64 ``` Example: ```python import mapbox_earcut as earcut import numpy as np # A Nx2 array of vertices. Must be 2D. verts = np.array([[0, 0], [1, 0], [1, 1]]).reshape(-1, 2) # An array of end-indices for each ring. # The first ring is the outer contour of the polygon. # Subsequent ones are holes. # This implies that the last index must always be equal to the size of verts! rings = np.array([3]) result = earcut.triangulate_float32(verts, rings) # Result is an np.ndarray with dtype np.uint32 and shape (3,) # containing indices into the verts array. print(verts[result]) # [[1 0] # [1 1] # [0 0]] ``` mapbox_earcut_python-1.0.1/RELEASING.md000066400000000000000000000001621434243615600176050ustar00rootroot00000000000000# Releasing a new version 1. Update CHANGELOG.md 2. Update VERSION in setup.py 3. `git tag` 4. `git push --tags` mapbox_earcut_python-1.0.1/include/000077500000000000000000000000001434243615600173765ustar00rootroot00000000000000mapbox_earcut_python-1.0.1/include/mapbox/000077500000000000000000000000001434243615600206645ustar00rootroot00000000000000mapbox_earcut_python-1.0.1/include/mapbox/LICENSE000066400000000000000000000013421434243615600216710ustar00rootroot00000000000000ISC License Copyright (c) 2015, Mapbox Permission to use, copy, modify, and/or distribute this software for any purpose with or without fee is hereby granted, provided that the above copyright notice and this permission notice appear in all copies. THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. mapbox_earcut_python-1.0.1/include/mapbox/earcut.hpp000066400000000000000000000607001434243615600226630ustar00rootroot00000000000000#pragma once #include #include #include #include #include #include #include #include namespace mapbox { namespace util { template struct nth { inline static typename std::tuple_element::type get(const T& t) { return std::get(t); }; }; } namespace detail { template class Earcut { public: std::vector indices; std::size_t vertices = 0; template void operator()(const Polygon& points); private: struct Node { Node(N index, double x_, double y_) : i(index), x(x_), y(y_) {} Node(const Node&) = delete; Node& operator=(const Node&) = delete; Node(Node&&) = delete; Node& operator=(Node&&) = delete; const N i; const double x; const double y; // previous and next vertice nodes in a polygon ring Node* prev = nullptr; Node* next = nullptr; // z-order curve value int32_t z = 0; // previous and next nodes in z-order Node* prevZ = nullptr; Node* nextZ = nullptr; // indicates whether this is a steiner point bool steiner = false; }; template Node* linkedList(const Ring& points, const bool clockwise); Node* filterPoints(Node* start, Node* end = nullptr); void earcutLinked(Node* ear, int pass = 0); bool isEar(Node* ear); bool isEarHashed(Node* ear); Node* cureLocalIntersections(Node* start); void splitEarcut(Node* start); template Node* eliminateHoles(const Polygon& points, Node* outerNode); Node* eliminateHole(Node* hole, Node* outerNode); Node* findHoleBridge(Node* hole, Node* outerNode); bool sectorContainsSector(const Node* m, const Node* p); void indexCurve(Node* start); Node* sortLinked(Node* list); int32_t zOrder(const double x_, const double y_); Node* getLeftmost(Node* start); bool pointInTriangle(double ax, double ay, double bx, double by, double cx, double cy, double px, double py) const; bool isValidDiagonal(Node* a, Node* b); double area(const Node* p, const Node* q, const Node* r) const; bool equals(const Node* p1, const Node* p2); bool intersects(const Node* p1, const Node* q1, const Node* p2, const Node* q2); bool onSegment(const Node* p, const Node* q, const Node* r); int sign(double val); bool intersectsPolygon(const Node* a, const Node* b); bool locallyInside(const Node* a, const Node* b); bool middleInside(const Node* a, const Node* b); Node* splitPolygon(Node* a, Node* b); template Node* insertNode(std::size_t i, const Point& p, Node* last); void removeNode(Node* p); bool hashing; double minX, maxX; double minY, maxY; double inv_size = 0; template > class ObjectPool { public: ObjectPool() { } ObjectPool(std::size_t blockSize_) { reset(blockSize_); } ~ObjectPool() { clear(); } template T* construct(Args&&... args) { if (currentIndex >= blockSize) { currentBlock = alloc_traits::allocate(alloc, blockSize); allocations.emplace_back(currentBlock); currentIndex = 0; } T* object = ¤tBlock[currentIndex++]; alloc_traits::construct(alloc, object, std::forward(args)...); return object; } void reset(std::size_t newBlockSize) { for (auto allocation : allocations) { alloc_traits::deallocate(alloc, allocation, blockSize); } allocations.clear(); blockSize = std::max(1, newBlockSize); currentBlock = nullptr; currentIndex = blockSize; } void clear() { reset(blockSize); } private: T* currentBlock = nullptr; std::size_t currentIndex = 1; std::size_t blockSize = 1; std::vector allocations; Alloc alloc; typedef typename std::allocator_traits alloc_traits; }; ObjectPool nodes; }; template template void Earcut::operator()(const Polygon& points) { // reset indices.clear(); vertices = 0; if (points.empty()) return; double x; double y; int threshold = 80; std::size_t len = 0; for (size_t i = 0; threshold >= 0 && i < points.size(); i++) { threshold -= static_cast(points[i].size()); len += points[i].size(); } //estimate size of nodes and indices nodes.reset(len * 3 / 2); indices.reserve(len + points[0].size()); Node* outerNode = linkedList(points[0], true); if (!outerNode || outerNode->prev == outerNode->next) return; if (points.size() > 1) outerNode = eliminateHoles(points, outerNode); // if the shape is not too simple, we'll use z-order curve hash later; calculate polygon bbox hashing = threshold < 0; if (hashing) { Node* p = outerNode->next; minX = maxX = outerNode->x; minY = maxY = outerNode->y; do { x = p->x; y = p->y; minX = std::min(minX, x); minY = std::min(minY, y); maxX = std::max(maxX, x); maxY = std::max(maxY, y); p = p->next; } while (p != outerNode); // minX, minY and inv_size are later used to transform coords into integers for z-order calculation inv_size = std::max(maxX - minX, maxY - minY); inv_size = inv_size != .0 ? (32767. / inv_size) : .0; } earcutLinked(outerNode); nodes.clear(); } // create a circular doubly linked list from polygon points in the specified winding order template template typename Earcut::Node* Earcut::linkedList(const Ring& points, const bool clockwise) { using Point = typename Ring::value_type; double sum = 0; const std::size_t len = points.size(); std::size_t i, j; Node* last = nullptr; // calculate original winding order of a polygon ring for (i = 0, j = len > 0 ? len - 1 : 0; i < len; j = i++) { const auto& p1 = points[i]; const auto& p2 = points[j]; const double p20 = util::nth<0, Point>::get(p2); const double p10 = util::nth<0, Point>::get(p1); const double p11 = util::nth<1, Point>::get(p1); const double p21 = util::nth<1, Point>::get(p2); sum += (p20 - p10) * (p11 + p21); } // link points into circular doubly-linked list in the specified winding order if (clockwise == (sum > 0)) { for (i = 0; i < len; i++) last = insertNode(vertices + i, points[i], last); } else { for (i = len; i-- > 0;) last = insertNode(vertices + i, points[i], last); } if (last && equals(last, last->next)) { removeNode(last); last = last->next; } vertices += len; return last; } // eliminate colinear or duplicate points template typename Earcut::Node* Earcut::filterPoints(Node* start, Node* end) { if (!end) end = start; Node* p = start; bool again; do { again = false; if (!p->steiner && (equals(p, p->next) || area(p->prev, p, p->next) == 0)) { removeNode(p); p = end = p->prev; if (p == p->next) break; again = true; } else { p = p->next; } } while (again || p != end); return end; } // main ear slicing loop which triangulates a polygon (given as a linked list) template void Earcut::earcutLinked(Node* ear, int pass) { if (!ear) return; // interlink polygon nodes in z-order if (!pass && hashing) indexCurve(ear); Node* stop = ear; Node* prev; Node* next; int iterations = 0; // iterate through ears, slicing them one by one while (ear->prev != ear->next) { iterations++; prev = ear->prev; next = ear->next; if (hashing ? isEarHashed(ear) : isEar(ear)) { // cut off the triangle indices.emplace_back(prev->i); indices.emplace_back(ear->i); indices.emplace_back(next->i); removeNode(ear); // skipping the next vertice leads to less sliver triangles ear = next->next; stop = next->next; continue; } ear = next; // if we looped through the whole remaining polygon and can't find any more ears if (ear == stop) { // try filtering points and slicing again if (!pass) earcutLinked(filterPoints(ear), 1); // if this didn't work, try curing all small self-intersections locally else if (pass == 1) { ear = cureLocalIntersections(filterPoints(ear)); earcutLinked(ear, 2); // as a last resort, try splitting the remaining polygon into two } else if (pass == 2) splitEarcut(ear); break; } } } // check whether a polygon node forms a valid ear with adjacent nodes template bool Earcut::isEar(Node* ear) { const Node* a = ear->prev; const Node* b = ear; const Node* c = ear->next; if (area(a, b, c) >= 0) return false; // reflex, can't be an ear // now make sure we don't have other points inside the potential ear Node* p = ear->next->next; while (p != ear->prev) { if (pointInTriangle(a->x, a->y, b->x, b->y, c->x, c->y, p->x, p->y) && area(p->prev, p, p->next) >= 0) return false; p = p->next; } return true; } template bool Earcut::isEarHashed(Node* ear) { const Node* a = ear->prev; const Node* b = ear; const Node* c = ear->next; if (area(a, b, c) >= 0) return false; // reflex, can't be an ear // triangle bbox; min & max are calculated like this for speed const double minTX = std::min(a->x, std::min(b->x, c->x)); const double minTY = std::min(a->y, std::min(b->y, c->y)); const double maxTX = std::max(a->x, std::max(b->x, c->x)); const double maxTY = std::max(a->y, std::max(b->y, c->y)); // z-order range for the current triangle bbox; const int32_t minZ = zOrder(minTX, minTY); const int32_t maxZ = zOrder(maxTX, maxTY); // first look for points inside the triangle in increasing z-order Node* p = ear->nextZ; while (p && p->z <= maxZ) { if (p != ear->prev && p != ear->next && pointInTriangle(a->x, a->y, b->x, b->y, c->x, c->y, p->x, p->y) && area(p->prev, p, p->next) >= 0) return false; p = p->nextZ; } // then look for points in decreasing z-order p = ear->prevZ; while (p && p->z >= minZ) { if (p != ear->prev && p != ear->next && pointInTriangle(a->x, a->y, b->x, b->y, c->x, c->y, p->x, p->y) && area(p->prev, p, p->next) >= 0) return false; p = p->prevZ; } return true; } // go through all polygon nodes and cure small local self-intersections template typename Earcut::Node* Earcut::cureLocalIntersections(Node* start) { Node* p = start; do { Node* a = p->prev; Node* b = p->next->next; // a self-intersection where edge (v[i-1],v[i]) intersects (v[i+1],v[i+2]) if (!equals(a, b) && intersects(a, p, p->next, b) && locallyInside(a, b) && locallyInside(b, a)) { indices.emplace_back(a->i); indices.emplace_back(p->i); indices.emplace_back(b->i); // remove two nodes involved removeNode(p); removeNode(p->next); p = start = b; } p = p->next; } while (p != start); return filterPoints(p); } // try splitting polygon into two and triangulate them independently template void Earcut::splitEarcut(Node* start) { // look for a valid diagonal that divides the polygon into two Node* a = start; do { Node* b = a->next->next; while (b != a->prev) { if (a->i != b->i && isValidDiagonal(a, b)) { // split the polygon in two by the diagonal Node* c = splitPolygon(a, b); // filter colinear points around the cuts a = filterPoints(a, a->next); c = filterPoints(c, c->next); // run earcut on each half earcutLinked(a); earcutLinked(c); return; } b = b->next; } a = a->next; } while (a != start); } // link every hole into the outer loop, producing a single-ring polygon without holes template template typename Earcut::Node* Earcut::eliminateHoles(const Polygon& points, Node* outerNode) { const size_t len = points.size(); std::vector queue; for (size_t i = 1; i < len; i++) { Node* list = linkedList(points[i], false); if (list) { if (list == list->next) list->steiner = true; queue.push_back(getLeftmost(list)); } } std::sort(queue.begin(), queue.end(), [](const Node* a, const Node* b) { return a->x < b->x; }); // process holes from left to right for (size_t i = 0; i < queue.size(); i++) { outerNode = eliminateHole(queue[i], outerNode); } return outerNode; } // find a bridge between vertices that connects hole with an outer ring and and link it template typename Earcut::Node* Earcut::eliminateHole(Node* hole, Node* outerNode) { Node* bridge = findHoleBridge(hole, outerNode); if (!bridge) { return outerNode; } Node* bridgeReverse = splitPolygon(bridge, hole); // filter collinear points around the cuts filterPoints(bridgeReverse, bridgeReverse->next); // Check if input node was removed by the filtering return filterPoints(bridge, bridge->next); } // David Eberly's algorithm for finding a bridge between hole and outer polygon template typename Earcut::Node* Earcut::findHoleBridge(Node* hole, Node* outerNode) { Node* p = outerNode; double hx = hole->x; double hy = hole->y; double qx = -std::numeric_limits::infinity(); Node* m = nullptr; // find a segment intersected by a ray from the hole's leftmost Vertex to the left; // segment's endpoint with lesser x will be potential connection Vertex do { if (hy <= p->y && hy >= p->next->y && p->next->y != p->y) { double x = p->x + (hy - p->y) * (p->next->x - p->x) / (p->next->y - p->y); if (x <= hx && x > qx) { qx = x; m = p->x < p->next->x ? p : p->next; if (x == hx) return m; // hole touches outer segment; pick leftmost endpoint } } p = p->next; } while (p != outerNode); if (!m) return 0; // look for points inside the triangle of hole Vertex, segment intersection and endpoint; // if there are no points found, we have a valid connection; // otherwise choose the Vertex of the minimum angle with the ray as connection Vertex const Node* stop = m; double tanMin = std::numeric_limits::infinity(); double tanCur = 0; p = m; double mx = m->x; double my = m->y; do { if (hx >= p->x && p->x >= mx && hx != p->x && pointInTriangle(hy < my ? hx : qx, hy, mx, my, hy < my ? qx : hx, hy, p->x, p->y)) { tanCur = std::abs(hy - p->y) / (hx - p->x); // tangential if (locallyInside(p, hole) && (tanCur < tanMin || (tanCur == tanMin && (p->x > m->x || sectorContainsSector(m, p))))) { m = p; tanMin = tanCur; } } p = p->next; } while (p != stop); return m; } // whether sector in vertex m contains sector in vertex p in the same coordinates template bool Earcut::sectorContainsSector(const Node* m, const Node* p) { return area(m->prev, m, p->prev) < 0 && area(p->next, m, m->next) < 0; } // interlink polygon nodes in z-order template void Earcut::indexCurve(Node* start) { assert(start); Node* p = start; do { p->z = p->z ? p->z : zOrder(p->x, p->y); p->prevZ = p->prev; p->nextZ = p->next; p = p->next; } while (p != start); p->prevZ->nextZ = nullptr; p->prevZ = nullptr; sortLinked(p); } // Simon Tatham's linked list merge sort algorithm // http://www.chiark.greenend.org.uk/~sgtatham/algorithms/listsort.html template typename Earcut::Node* Earcut::sortLinked(Node* list) { assert(list); Node* p; Node* q; Node* e; Node* tail; int i, numMerges, pSize, qSize; int inSize = 1; for (;;) { p = list; list = nullptr; tail = nullptr; numMerges = 0; while (p) { numMerges++; q = p; pSize = 0; for (i = 0; i < inSize; i++) { pSize++; q = q->nextZ; if (!q) break; } qSize = inSize; while (pSize > 0 || (qSize > 0 && q)) { if (pSize == 0) { e = q; q = q->nextZ; qSize--; } else if (qSize == 0 || !q) { e = p; p = p->nextZ; pSize--; } else if (p->z <= q->z) { e = p; p = p->nextZ; pSize--; } else { e = q; q = q->nextZ; qSize--; } if (tail) tail->nextZ = e; else list = e; e->prevZ = tail; tail = e; } p = q; } tail->nextZ = nullptr; if (numMerges <= 1) return list; inSize *= 2; } } // z-order of a Vertex given coords and size of the data bounding box template int32_t Earcut::zOrder(const double x_, const double y_) { // coords are transformed into non-negative 15-bit integer range int32_t x = static_cast((x_ - minX) * inv_size); int32_t y = static_cast((y_ - minY) * inv_size); x = (x | (x << 8)) & 0x00FF00FF; x = (x | (x << 4)) & 0x0F0F0F0F; x = (x | (x << 2)) & 0x33333333; x = (x | (x << 1)) & 0x55555555; y = (y | (y << 8)) & 0x00FF00FF; y = (y | (y << 4)) & 0x0F0F0F0F; y = (y | (y << 2)) & 0x33333333; y = (y | (y << 1)) & 0x55555555; return x | (y << 1); } // find the leftmost node of a polygon ring template typename Earcut::Node* Earcut::getLeftmost(Node* start) { Node* p = start; Node* leftmost = start; do { if (p->x < leftmost->x || (p->x == leftmost->x && p->y < leftmost->y)) leftmost = p; p = p->next; } while (p != start); return leftmost; } // check if a point lies within a convex triangle template bool Earcut::pointInTriangle(double ax, double ay, double bx, double by, double cx, double cy, double px, double py) const { return (cx - px) * (ay - py) >= (ax - px) * (cy - py) && (ax - px) * (by - py) >= (bx - px) * (ay - py) && (bx - px) * (cy - py) >= (cx - px) * (by - py); } // check if a diagonal between two polygon nodes is valid (lies in polygon interior) template bool Earcut::isValidDiagonal(Node* a, Node* b) { return a->next->i != b->i && a->prev->i != b->i && !intersectsPolygon(a, b) && // dones't intersect other edges ((locallyInside(a, b) && locallyInside(b, a) && middleInside(a, b) && // locally visible (area(a->prev, a, b->prev) != 0.0 || area(a, b->prev, b) != 0.0)) || // does not create opposite-facing sectors (equals(a, b) && area(a->prev, a, a->next) > 0 && area(b->prev, b, b->next) > 0)); // special zero-length case } // signed area of a triangle template double Earcut::area(const Node* p, const Node* q, const Node* r) const { return (q->y - p->y) * (r->x - q->x) - (q->x - p->x) * (r->y - q->y); } // check if two points are equal template bool Earcut::equals(const Node* p1, const Node* p2) { return p1->x == p2->x && p1->y == p2->y; } // check if two segments intersect template bool Earcut::intersects(const Node* p1, const Node* q1, const Node* p2, const Node* q2) { int o1 = sign(area(p1, q1, p2)); int o2 = sign(area(p1, q1, q2)); int o3 = sign(area(p2, q2, p1)); int o4 = sign(area(p2, q2, q1)); if (o1 != o2 && o3 != o4) return true; // general case if (o1 == 0 && onSegment(p1, p2, q1)) return true; // p1, q1 and p2 are collinear and p2 lies on p1q1 if (o2 == 0 && onSegment(p1, q2, q1)) return true; // p1, q1 and q2 are collinear and q2 lies on p1q1 if (o3 == 0 && onSegment(p2, p1, q2)) return true; // p2, q2 and p1 are collinear and p1 lies on p2q2 if (o4 == 0 && onSegment(p2, q1, q2)) return true; // p2, q2 and q1 are collinear and q1 lies on p2q2 return false; } // for collinear points p, q, r, check if point q lies on segment pr template bool Earcut::onSegment(const Node* p, const Node* q, const Node* r) { return q->x <= std::max(p->x, r->x) && q->x >= std::min(p->x, r->x) && q->y <= std::max(p->y, r->y) && q->y >= std::min(p->y, r->y); } template int Earcut::sign(double val) { return (0.0 < val) - (val < 0.0); } // check if a polygon diagonal intersects any polygon segments template bool Earcut::intersectsPolygon(const Node* a, const Node* b) { const Node* p = a; do { if (p->i != a->i && p->next->i != a->i && p->i != b->i && p->next->i != b->i && intersects(p, p->next, a, b)) return true; p = p->next; } while (p != a); return false; } // check if a polygon diagonal is locally inside the polygon template bool Earcut::locallyInside(const Node* a, const Node* b) { return area(a->prev, a, a->next) < 0 ? area(a, b, a->next) >= 0 && area(a, a->prev, b) >= 0 : area(a, b, a->prev) < 0 || area(a, a->next, b) < 0; } // check if the middle Vertex of a polygon diagonal is inside the polygon template bool Earcut::middleInside(const Node* a, const Node* b) { const Node* p = a; bool inside = false; double px = (a->x + b->x) / 2; double py = (a->y + b->y) / 2; do { if (((p->y > py) != (p->next->y > py)) && p->next->y != p->y && (px < (p->next->x - p->x) * (py - p->y) / (p->next->y - p->y) + p->x)) inside = !inside; p = p->next; } while (p != a); return inside; } // link two polygon vertices with a bridge; if the vertices belong to the same ring, it splits // polygon into two; if one belongs to the outer ring and another to a hole, it merges it into a // single ring template typename Earcut::Node* Earcut::splitPolygon(Node* a, Node* b) { Node* a2 = nodes.construct(a->i, a->x, a->y); Node* b2 = nodes.construct(b->i, b->x, b->y); Node* an = a->next; Node* bp = b->prev; a->next = b; b->prev = a; a2->next = an; an->prev = a2; b2->next = a2; a2->prev = b2; bp->next = b2; b2->prev = bp; return b2; } // create a node and util::optionally link it with previous one (in a circular doubly linked list) template template typename Earcut::Node* Earcut::insertNode(std::size_t i, const Point& pt, Node* last) { Node* p = nodes.construct(static_cast(i), util::nth<0, Point>::get(pt), util::nth<1, Point>::get(pt)); if (!last) { p->prev = p; p->next = p; } else { assert(last); p->next = last->next; p->prev = last; last->next->prev = p; last->next = p; } return p; } template void Earcut::removeNode(Node* p) { p->next->prev = p->prev; p->prev->next = p->next; if (p->prevZ) p->prevZ->nextZ = p->nextZ; if (p->nextZ) p->nextZ->prevZ = p->prevZ; } } template std::vector earcut(const Polygon& poly) { mapbox::detail::Earcut earcut; earcut(poly); return std::move(earcut.indices); } } mapbox_earcut_python-1.0.1/pyproject.toml000066400000000000000000000001761434243615600206730ustar00rootroot00000000000000[build-system] requires = [ "setuptools>=42", "wheel", "pybind11~=2.6", ] build-backend = "setuptools.build_meta" mapbox_earcut_python-1.0.1/setup.py000066400000000000000000000023421434243615600174660ustar00rootroot00000000000000import os from setuptools import setup from pybind11.setup_helpers import Pybind11Extension, build_ext FILE_DIR = os.path.dirname(os.path.abspath(__file__)) VERSION = '1.0.1' ext_modules = [ Pybind11Extension('mapbox_earcut', ['src/main.cpp'], include_dirs=['include'], define_macros = [('VERSION_INFO', VERSION)], ), ] def get_readme_contents(): with open(os.path.join(FILE_DIR, 'README.md'), 'r') as readme_file: return readme_file.read() setup( name='mapbox_earcut', version=VERSION, url='https://github.com/skogler/mapbox_earcut_python', author='Samuel Kogler', author_email='samuel.kogler@gmail.com', description= 'Python bindings for the mapbox earcut C++ polygon triangulation library.', long_description=get_readme_contents(), long_description_content_type='text/markdown', license='ISC', ext_modules=ext_modules, install_requires=['numpy'], extras_require={'test': 'pytest'}, cmdclass=dict(build_ext=build_ext), zip_safe=False, project_urls={ 'Source': 'https://github.com/skogler/mapbox_earcut_python', 'Original C++ Source': 'https://github.com/mapbox/earcut.hpp', }, include_package_data = True ) mapbox_earcut_python-1.0.1/src/000077500000000000000000000000001434243615600165425ustar00rootroot00000000000000mapbox_earcut_python-1.0.1/src/main.cpp000066400000000000000000000061501434243615600201740ustar00rootroot00000000000000#include #include #include #include #include #define IDENT_TO_STR(x) #x #define MACRO_TO_STR(x) IDENT_TO_STR(x) namespace py = pybind11; //! vertices: (nverts, 2) numpy array //! ring_end_indices: the end indices for each ring. The last value must be equal to the number of input vertices. template py::array_t triangulate(py::array_t vertices, py::array_t ring_end_indices) { if (vertices.ndim() != 2) { throw std::domain_error("The shape of vertices is not (nverts, 2)!"); } if (ring_end_indices.ndim() != 1) { throw std::domain_error("ring_end_indices must be one-dimensional!"); } auto v = vertices.unchecked(); if (v.shape(1) != 2) { throw std::domain_error("The second dimension of vertices is not 2!"); } auto r = ring_end_indices.template unchecked<1>(); const auto num_rings = r.shape(0); const auto num_verts = v.shape(0); if (num_rings > 0) { if (r(num_rings - 1) != num_verts) { throw std::invalid_argument("The last value of ring_end_indices must be equal to the number of vertices!"); } } else if (num_verts > 0) { throw std::invalid_argument("ring_end_indices is empty, but vertices is not! This seems like it might not be intentional."); } using Point = std::array; std::vector> polygon; for (int ring = 0; ring < r.shape(0); ++ring) { const int start = ring == 0 ? 0 : r(ring - 1); const int end = r(ring); if (end <= start) { throw std::invalid_argument("ring_end_indices must be in strictly increasing order!"); } if (end > num_verts) { throw std::invalid_argument("ring_end_indices cannot contain values larger than the number of vertices!"); } std::vector ring_verts; for (int idx = start; idx < end; ++idx) { ring_verts.push_back(Point{ v(idx, 0), v(idx, 1) }); } polygon.push_back(ring_verts); } std::vector indices = mapbox::earcut(polygon); return py::array( indices.size(), indices.data() ); } PYBIND11_MODULE(mapbox_earcut, m) { m.doc() = R"pbdoc( Python bindings to mapbox/earcut.hpp ----------------------- .. currentmodule:: mapbox_earcut .. autosummary:: :toctree: _generate add subtract )pbdoc"; m.def("triangulate_int32", &triangulate); m.def("triangulate_int64", &triangulate); m.def("triangulate_float32", &triangulate); m.def("triangulate_float64", &triangulate); #ifdef VERSION_INFO m.attr("__version__") = MACRO_TO_STR(VERSION_INFO) ; #else m.attr("__version__") = "dev"; #endif } mapbox_earcut_python-1.0.1/tests/000077500000000000000000000000001434243615600171155ustar00rootroot00000000000000mapbox_earcut_python-1.0.1/tests/test_earcut.py000066400000000000000000000072661434243615600220240ustar00rootroot00000000000000import mapbox_earcut as earcut import numpy as np import pytest def test_valid_triangulation_float32(): verts = np.array([[0, 0], [1, 0], [1, 1]], dtype=np.float32).reshape(-1, 2) rings = np.array([3]) result = earcut.triangulate_float32(verts, rings) assert result.dtype == np.uint32 assert result.shape == (3, ) assert np.all(result == np.array([1, 2, 0])) def test_valid_triangulation_float64(): verts = np.array([[0, 0], [1, 0], [1, 1]], dtype=np.float64).reshape(-1, 2) rings = np.array([3]) result = earcut.triangulate_float32(verts, rings) assert result.dtype == np.uint32 assert result.shape == (3, ) assert np.all(result == np.array([1, 2, 0])) def test_valid_triangulation_int32(): verts = np.array([[0, 0], [1, 0], [1, 1]], dtype=np.int32).reshape(-1, 2) rings = np.array([3]) result = earcut.triangulate_float32(verts, rings) assert result.dtype == np.uint32 assert result.shape == (3, ) assert np.all(result == np.array([1, 2, 0])) def test_inverted_vertex_order(): verts = np.array( list(reversed([[0, 0], [1, 0], [1, 1]])), dtype=np.int32).reshape( -1, 2) rings = np.array([3]) result = earcut.triangulate_float32(verts, rings) assert result.dtype == np.uint32 assert result.shape == (3, ) assert np.all(result == np.array([1, 0, 2])) def test_no_triangles(): verts = np.array([[0, 0], [1, 0], [1, 1]], dtype=np.int32).reshape(-1, 2) rings = np.array([2, 3]) result = earcut.triangulate_float32(verts, rings) assert result.dtype == np.uint32 assert result.shape == (0, ) def test_valid_triangulation_int64(): verts = np.array([[0, 0], [1, 0], [1, 1]], dtype=np.int64).reshape(-1, 2) rings = np.array([3]) result = earcut.triangulate_float32(verts, rings) assert result.dtype == np.uint32 assert result.shape == (3, ) assert np.all(result == np.array([1, 2, 0])) def test_end_index_too_large(): verts = np.array([[0, 0], [1, 0], [1, 1]]).reshape(-1, 2) rings = np.array([5]) with pytest.raises(ValueError): result = earcut.triangulate_float32(verts, rings) def test_end_index_too_small(): verts = np.array([[0, 0], [1, 0], [1, 1]]).reshape(-1, 2) rings = np.array([2]) with pytest.raises(ValueError): result = earcut.triangulate_float32(verts, rings) def test_end_index_neg(): verts = np.array([[0, 0], [1, 0], [1, 1]]).reshape(-1, 2) rings = np.array([-1]) with pytest.raises(ValueError): result = earcut.triangulate_float32(verts, rings) def test_rings_not_increasing(): verts = np.array([[0, 0], [1, 0], [1, 1]]).reshape(-1, 2) rings = np.array([3, 0, 3]) with pytest.raises(ValueError): result = earcut.triangulate_float32(verts, rings) def test_rings_same(): verts = np.array([[0, 0], [1, 0], [1, 1]]).reshape(-1, 2) rings = np.array([3, 3]) with pytest.raises(ValueError): result = earcut.triangulate_float32(verts, rings) def test_no_rings(): verts = np.array([[0, 0], [1, 0], [1, 1]]).reshape(-1, 2) rings = np.array([]) with pytest.raises(ValueError): result = earcut.triangulate_float32(verts, rings) def test_no_rings(): verts = np.array([[0, 0], [1, 0], [1, 1]]).reshape(-1, 2) rings = np.array([]) with pytest.raises(ValueError): result = earcut.triangulate_float32(verts, rings) def test_empty_data(): verts = np.array([]).reshape(-1, 2) rings = np.array([]) result = earcut.triangulate_float32(verts, rings) assert result.shape == (0, )