summaryrefslogtreecommitdiff
path: root/basegfx/source
diff options
context:
space:
mode:
Diffstat (limited to 'basegfx/source')
-rw-r--r--basegfx/source/polygon/b2dpolygon.cxx2
-rw-r--r--basegfx/source/polygon/b2dpolygontools.cxx2
-rw-r--r--basegfx/source/polygon/b2dpolypolygoncutter.cxx2
3 files changed, 3 insertions, 3 deletions
diff --git a/basegfx/source/polygon/b2dpolygon.cxx b/basegfx/source/polygon/b2dpolygon.cxx
index fb7a98ff4b6e..46b8b452e90f 100644
--- a/basegfx/source/polygon/b2dpolygon.cxx
+++ b/basegfx/source/polygon/b2dpolygon.cxx
@@ -1358,7 +1358,7 @@ namespace basegfx
}
else
{
- // no bezier, reset control poins at rTarget
+ // no bezier, reset control points at rTarget
rTarget.setControlPointA(rTarget.getStartPoint());
rTarget.setControlPointB(rTarget.getEndPoint());
}
diff --git a/basegfx/source/polygon/b2dpolygontools.cxx b/basegfx/source/polygon/b2dpolygontools.cxx
index 13844613ff6b..8b31f7a0b15f 100644
--- a/basegfx/source/polygon/b2dpolygontools.cxx
+++ b/basegfx/source/polygon/b2dpolygontools.cxx
@@ -1073,7 +1073,7 @@ namespace basegfx
if(fTools::more(fCut1, fZero) && fTools::less(fCut1, fOne)
&& (!fTools::equalZero(rEdge2Delta.getX()) || !fTools::equalZero(rEdge2Delta.getY())))
{
- // take the mopre precise calculation of the two possible
+ // take the more precise calculation of the two possible
if(fabs(rEdge2Delta.getX()) > fabs(rEdge2Delta.getY()))
{
fCut2 = (rEdge1Start.getX() + fCut1
diff --git a/basegfx/source/polygon/b2dpolypolygoncutter.cxx b/basegfx/source/polygon/b2dpolypolygoncutter.cxx
index 106e217a2308..07c45ad447cc 100644
--- a/basegfx/source/polygon/b2dpolypolygoncutter.cxx
+++ b/basegfx/source/polygon/b2dpolypolygoncutter.cxx
@@ -494,7 +494,7 @@ namespace basegfx
const sal_uInt32 nPointCount(aGeometry.count());
- // If it's not a pezier polygon, at least four points are needed to create
+ // If it's not a bezier polygon, at least four points are needed to create
// a self-intersection. If it's a bezier polygon, the minimum point number
// is two, since with a single point You get a curve, but no self-intersection
if(nPointCount > 3 || (nPointCount > 1 && mbIsCurve))