diff options
author | Caolán McNamara <caolanm@redhat.com> | 2022-03-21 15:33:06 +0000 |
---|---|---|
committer | Caolán McNamara <caolanm@redhat.com> | 2022-03-21 17:35:37 +0100 |
commit | f4474b2967f9c7b3b82239c6e9c66850964c6e8b (patch) | |
tree | e99d6724ebb93015ced117e7c134a2028c5b9b47 /include/basegfx/polygon/b2dpolygoncutandtouch.hxx | |
parent | 79b5ff92b17fde902c2f9db3e806f1c77a387dff (diff) |
ofz#45878 add a way to set some limit on hugely complex clips
Change-Id: I6bbf7c6068560e3bb656560fb5c6cc2ed72cecd4
Reviewed-on: https://gerrit.libreoffice.org/c/core/+/131907
Tested-by: Jenkins
Reviewed-by: Caolán McNamara <caolanm@redhat.com>
Diffstat (limited to 'include/basegfx/polygon/b2dpolygoncutandtouch.hxx')
-rw-r--r-- | include/basegfx/polygon/b2dpolygoncutandtouch.hxx | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/include/basegfx/polygon/b2dpolygoncutandtouch.hxx b/include/basegfx/polygon/b2dpolygoncutandtouch.hxx index 55bea6f3ebcb..600ad1c5cd90 100644 --- a/include/basegfx/polygon/b2dpolygoncutandtouch.hxx +++ b/include/basegfx/polygon/b2dpolygoncutandtouch.hxx @@ -27,12 +27,12 @@ namespace basegfx::utils // look for self-intersections and self-touches (points on an edge) in given polygon and add // extra points there. Result will have no touches or intersections on an edge, only on points -B2DPolygon addPointsAtCutsAndTouches(const B2DPolygon& rCandidate); +B2DPolygon addPointsAtCutsAndTouches(const B2DPolygon& rCandidate, size_t* pPointLimit = nullptr); // look for polypolygon-intersections and polypolygon-touches (point of poly A on an edge of poly B) in given tools::PolyPolygon and add // extra points there. Result will have no touches or intersections between contained polygons on an edge, only on points. For // convenience, the correction for self-intersections for each member polygon will be used, too. -B2DPolyPolygon addPointsAtCutsAndTouches(const B2DPolyPolygon& rCandidate); +B2DPolyPolygon addPointsAtCutsAndTouches(const B2DPolyPolygon& rCandidate, size_t* pPointLimit = nullptr); // look for intersections of rCandidate with the edge from rStart to rEnd and add extra points there. // Points are only added in the range of the edge, not on the endless vector. |