1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
3 * This file is part of the LibreOffice project.
5 * This Source Code Form is subject to the terms of the Mozilla Public
6 * License, v. 2.0. If a copy of the MPL was not distributed with this
7 * file, You can obtain one at http://mozilla.org/MPL/2.0/.
9 * This file incorporates work covered by the following license notice:
11 * Licensed to the Apache Software Foundation (ASF) under one or more
12 * contributor license agreements. See the NOTICE file distributed
13 * with this work for additional information regarding copyright
14 * ownership. The ASF licenses this file to you under the Apache
15 * License, Version 2.0 (the "License"); you may not use this file
16 * except in compliance with the License. You may obtain a copy of
17 * the License at http://www.apache.org/licenses/LICENSE-2.0 .
22 #include <basegfx/polygon/b2dpolygon.hxx>
23 #include <basegfx/polygon/b2dpolypolygon.hxx>
25 namespace basegfx::utils
28 // look for self-intersections and self-touches (points on an edge) in given polygon and add
29 // extra points there. Result will have no touches or intersections on an edge, only on points
30 B2DPolygon
addPointsAtCutsAndTouches(const B2DPolygon
& rCandidate
, size_t* pPointLimit
= nullptr);
32 // look for polypolygon-intersections and polypolygon-touches (point of poly A on an edge of poly B) in given tools::PolyPolygon and add
33 // extra points there. Result will have no touches or intersections between contained polygons on an edge, only on points. For
34 // convenience, the correction for self-intersections for each member polygon will be used, too.
35 B2DPolyPolygon
addPointsAtCutsAndTouches(const B2DPolyPolygon
& rCandidate
, size_t* pPointLimit
= nullptr);
37 // look for intersections of rCandidate with the edge from rStart to rEnd and add extra points there.
38 // Points are only added in the range of the edge, not on the endless vector.
39 B2DPolygon
addPointsAtCuts(const B2DPolygon
& rCandidate
, const B2DPoint
& rStart
, const B2DPoint
& rEnd
);
41 // look for intersections of rCandidate with the mask Polygon and add extra points there.
42 // The mask polygon is assumed to be closed, even when it's not explicitly.
43 B2DPolygon
addPointsAtCuts(const B2DPolygon
& rCandidate
, const B2DPolyPolygon
& rMask
);
45 } // end of namespace basegfx
47 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */