slight code cleanup

Author: dlegland

src/main/java/inra/ijpb/binary/geodesic/GeodesicDistanceTransform3DFloat.java

@@ -34,7 +34,8 @@
  * Computation of geodesic distance transform for 3D images, using floating
  * point computation.
  * 
- * Adapted for the management of label images.
+ * This implementation also works on label maps as input.
+ * 
  * 
  * @author dlegland
  *
@@ -351,6 +352,7 @@ private void normalizeMap(Image3D distMap, Image3D labelImage)
 		// retrieve the minimum weight
 		double w0 = this.chamferMask.getNormalizationWeight();
 
+		 // iterate over voxels within map to normalize values
 		for (int z = 0; z < sizeZ; z++)
 		{
 			fireProgressChanged(this, z, sizeZ);

src/main/java/inra/ijpb/binary/geodesic/GeodesicDistanceTransformFloat.java

@@ -33,6 +33,8 @@
  * Computation of Chamfer geodesic distances using floating point array for
  * storing result.
  * 
+ * This implementation also works on label maps as input.
+ * 
  * This implementation is based on iteration of forward-backward passes, until
  * idempotence. The "hybrid" implementation is usually more efficient for
  * complex images.
@@ -365,6 +367,7 @@ private void normalizeMap(FloatProcessor distMap, ImageProcessor labelImage)
 		// retrieve the minimum weight
 		double w0 = this.mask.getNormalizationWeight();
 
+		 // iterate over pixels within map to normalize values
 		for (int y = 0; y < sizeY; y++)
 		{
 			this.fireProgressChanged(this, y, sizeY);

src/main/java/inra/ijpb/binary/geodesic/GeodesicDistanceTransformFloatHybrid.java

@@ -35,6 +35,8 @@
  * Computation of geodesic distances based on a chamfer mask using floating point
  * array for storing result.
  * 
+ * This implementation also works on label maps as input.
+ * 
  * @see GeodesicDistanceTransformShortHybrid
  * 
  * @author David Legland
@@ -412,6 +414,7 @@ private void normalizeResult(FloatProcessor distMap, ImageProcessor labelImage)
         // retrieve the minimum weight
         double w0 = this.mask.getNormalizationWeight();
 
+        // iterate over pixels within map to normalize values
 		for (int y = 0; y < sizeY; y++)
 		{
 			for (int x = 0; x < sizeX; x++)

src/main/java/inra/ijpb/binary/geodesic/GeodesicDistanceTransformShort.java

@@ -33,9 +33,10 @@
  * Computation of geodesic distances based on a chamfer mask using short integer
  * array for storing result.
  * 
- * The maximum propagated distance is limited to Short.MAX_VALUE.
+ * This implementation also works on label maps as input.
  * 
  * All computations are performed using integers, results are stored as shorts.
+ * The maximum propagated distance is limited to Short.MAX_VALUE.
  * 
  * This implementation is based on iteration of forward-backward passes, until
  * idempotence. The "hybrid" implementation is usually more efficient for
@@ -366,12 +367,9 @@ private void normalizeResult(ShortProcessor distMap, ImageProcessor labelImage)
 		int sizeY = distMap.getHeight();
 
 		// retrieve the minimum weight
-		double w0 = Double.POSITIVE_INFINITY;
-		for (ShortOffset offset : this.mask.getOffsets())
-		{
-			w0 = Math.min(w0, offset.weight);
-		}
+		double w0 = this.mask.getShortNormalizationWeight();
 
+		// iterate over pixels within map to normalize values
 		for (int y = 0; y < sizeY; y++)
 		{
 			for (int x = 0; x < sizeX; x++)

src/main/java/inra/ijpb/binary/geodesic/GeodesicDistanceTransformShortHybrid.java

@@ -35,9 +35,10 @@
  * Computation of geodesic distances based on a chamfer mask using short integer
  * array for storing result.
  * 
- * The maximum propagated distance is limited to Short.MAX_VALUE.
+ * This implementation also works on label maps as input.
  * 
  * All computations are performed using integers, results are stored as shorts.
+ * The maximum propagated distance is limited to Short.MAX_VALUE.
  * 
  * @see GeodesicDistanceTransformFloatHybrid
  * 
@@ -416,6 +417,7 @@ private void normalizeResult(ShortProcessor distMap, ImageProcessor labelImage)
         // retrieve the minimum weight
         double w0 = this.mask.getNormalizationWeight();
 
+        // iterate over pixels within map to normalize values
 		for (int y = 0; y < sizeY; y++)
 		{
 			for (int x = 0; x < sizeX; x++)