5 files changed, 6 insertions, 6 deletions
diff --git a/include/basegfx/color/bcolormodifier.hxx b/include/basegfx/color/bcolormodifier.hxx
index 899c1537f74a..f125d306b662 100644
--- a/include/basegfx/color/bcolormodifier.hxx
+++ b/include/basegfx/color/bcolormodifier.hxx
@@ -399,7 +399,7 @@ namespace basegfx
             return maBColorModifiers[nIndex];
         }
 
-        // get the color in it's modified form by applying all existing BColorModifiers,
+        // get the color in its modified form by applying all existing BColorModifiers,
         // from back to front (the newest first)
         ::basegfx::BColor getModifiedColor(const ::basegfx::BColor& rSource) const;
 
diff --git a/include/basegfx/polygon/b2dlinegeometry.hxx b/include/basegfx/polygon/b2dlinegeometry.hxx
index a3de97c62968..8b942bb06570 100644
--- a/include/basegfx/polygon/b2dlinegeometry.hxx
+++ b/include/basegfx/polygon/b2dlinegeometry.hxx
@@ -115,7 +115,7 @@ namespace basegfx
 
             @param fMaxPartOfEdge
             Allows to influence from with relative length of a control vector
-            compared to it's edge a split is forced. The smaller, the more
+            compared to its edge a split is forced. The smaller, the more
             subdivisions will be needed to create the filled geometry. Allowed
             range is cropped to [1.0 .. 0.01]
 
diff --git a/include/basegfx/polygon/b2dpolygontools.hxx b/include/basegfx/polygon/b2dpolygontools.hxx
index 70853afa137e..fb51facad2c2 100644
--- a/include/basegfx/polygon/b2dpolygontools.hxx
+++ b/include/basegfx/polygon/b2dpolygontools.hxx
@@ -331,11 +331,11 @@ namespace basegfx
         BASEGFX_DLLPUBLIC bool setContinuityInPoint(B2DPolygon& rCandidate, sal_uInt32 nIndex, B2VectorContinuity eContinuity);
 
         // test if polygon contains neutral points. A neutral point is one whos orientation is neutral
-        // e.g. positioned on the edge of it's predecessor and successor
+        // e.g. positioned on the edge of its predecessor and successor
         BASEGFX_DLLPUBLIC bool hasNeutralPoints(const B2DPolygon& rCandidate);
 
         // remove neutral points. A neutral point is one whos orientation is neutral
-        // e.g. positioned on the edge of it's predecessor and successor
+        // e.g. positioned on the edge of its predecessor and successor
         BASEGFX_DLLPUBLIC B2DPolygon removeNeutralPoints(const B2DPolygon& rCandidate);
 
         // tests if polygon is convex
diff --git a/include/basegfx/polygon/b2dpolypolygoncutter.hxx b/include/basegfx/polygon/b2dpolypolygoncutter.hxx
index 37ce2ab9e3bd..6afe54693178 100644
--- a/include/basegfx/polygon/b2dpolypolygoncutter.hxx
+++ b/include/basegfx/polygon/b2dpolypolygoncutter.hxx
@@ -77,7 +77,7 @@ namespace basegfx
             hole. The result is a depth which e.g. is -1 for holes
             outside everything, 1 for a polygon covered by another
             polygon and zero for e.g. holes in a polygon or polygons
-            outside everythig else.  In the 2nd step, all polygons
+            outside everything else.  In the 2nd step, all polygons
             with depth other than zero are removed. If bKeepAboveZero
             is used, all polygons < 1 are removed. The bKeepAboveZero
             mode is useful for clipping, e.g. just append one polygon
diff --git a/include/basegfx/polygon/b2dtrapezoid.hxx b/include/basegfx/polygon/b2dtrapezoid.hxx
index d56c48fbc425..f1f14134c5f8 100644
--- a/include/basegfx/polygon/b2dtrapezoid.hxx
+++ b/include/basegfx/polygon/b2dtrapezoid.hxx
@@ -82,7 +82,7 @@ namespace basegfx
         // convert SourcePolyPolygon to trapezoids. The trapezoids will be appended to
         // ro_Result. ro_Result will not be cleared. If SourcePolyPolygon contains curves,
         // it's default AdaptiveSubdivision will be used.
-        // CAUTION: Trapezoids are oreintation-dependent in the sense that the upper and lower
+        // CAUTION: Trapezoids are orientation-dependent in the sense that the upper and lower
         // lines have to be parallel to the X-Axis, thus this subdivision is NOT simply usable
         // for primitive decompositions. To use it, the shear and rotate parts of the
         // involved transformations HAVE to be taken into account.