diff --git a/src/DotRecast.Recast/CompareHoles.cs b/src/DotRecast.Recast/RcContourHoleComparer.cs
similarity index 84%
rename from src/DotRecast.Recast/CompareHoles.cs
rename to src/DotRecast.Recast/RcContourHoleComparer.cs
index c0e153b..93eb73b 100644
--- a/src/DotRecast.Recast/CompareHoles.cs
+++ b/src/DotRecast.Recast/RcContourHoleComparer.cs
@@ -2,7 +2,7 @@
 
 namespace DotRecast.Recast
 {
-    public class CompareHoles : IComparer<RcContourHole>
+    public class RcContourHoleComparer : IComparer<RcContourHole>
     {
         public int Compare(RcContourHole a, RcContourHole b)
         {
diff --git a/src/DotRecast.Recast/CompareDiagDist.cs b/src/DotRecast.Recast/RcPotentialDiagonalComparer.cs
similarity index 79%
rename from src/DotRecast.Recast/CompareDiagDist.cs
rename to src/DotRecast.Recast/RcPotentialDiagonalComparer.cs
index 058607c..408bfd5 100644
--- a/src/DotRecast.Recast/CompareDiagDist.cs
+++ b/src/DotRecast.Recast/RcPotentialDiagonalComparer.cs
@@ -2,7 +2,7 @@
 
 namespace DotRecast.Recast
 {
-    public class CompareDiagDist : IComparer<RcPotentialDiagonal>
+    public class RcPotentialDiagonalComparer : IComparer<RcPotentialDiagonal>
     {
         public int Compare(RcPotentialDiagonal va, RcPotentialDiagonal vb)
         {
diff --git a/src/DotRecast.Recast/RecastContour.cs b/src/DotRecast.Recast/RecastContour.cs
index 92d090f..7a8b523 100644
--- a/src/DotRecast.Recast/RecastContour.cs
+++ b/src/DotRecast.Recast/RecastContour.cs
@@ -619,7 +619,7 @@ namespace DotRecast.Recast
                 region.holes[i].leftmost = minleft[2];
             }
 
-            Array.Sort(region.holes, new CompareHoles());
+            Array.Sort(region.holes, new RcContourHoleComparer());
 
             int maxVerts = region.outline.nverts;
             for (int i = 0; i < region.nholes; i++)
@@ -665,7 +665,7 @@ namespace DotRecast.Recast
                     }
 
                     // Sort potential diagonals by distance, we want to make the connection as short as possible.
-                    Array.Sort(diags, 0, ndiags, new CompareDiagDist());
+                    Array.Sort(diags, 0, ndiags, new RcPotentialDiagonalComparer());
 
                     // Find a diagonal that is not intersecting the outline not the remaining holes.
                     index = -1;