diff --git a/core/src/main/java/org/orekit/rugged/intersection/duvenhage/MinMaxTreeTile.java b/core/src/main/java/org/orekit/rugged/intersection/duvenhage/MinMaxTreeTile.java
index 5c2ea740d9e553ad9abf551e43dbc467a21fdb1c..273bb4d06c5e07d0a91522bdc3e4675b55dbee65 100644
--- a/core/src/main/java/org/orekit/rugged/intersection/duvenhage/MinMaxTreeTile.java
+++ b/core/src/main/java/org/orekit/rugged/intersection/duvenhage/MinMaxTreeTile.java
@@ -30,7 +30,7 @@ import org.orekit.rugged.raster.SimpleTile;
  * Level n-1, which is the deepest one, is computed from the raw pixels by
  * merging adjacent pixels pairs columns (i.e. pixels at indices (i, 2j)
  * and (i, 2j+1) are merged together by computing and storing the minimum
- * and maxium in a sub-tile. Level n-1 therefore has the same number of rows
+ * and maximum in a sub-tile. Level n-1 therefore has the same number of rows
  * but half the number of columns of the raw tile, and its sub-tiles are
  * 1 pixel high and 2 pixels wide. Level n-2 is computed from level n-1 by
  * merging sub-tiles rows. Level n-2 therefore has half the number of rows