X-Git-Url: http://www2.svjatoslav.eu/gitweb/?p=sixth-3d.git;a=blobdiff_plain;f=src%2Fmain%2Fjava%2Feu%2Fsvjatoslav%2Fsixth%2Fe3d%2Frenderer%2Fraster%2Fslicer%2FSlicer.java;fp=src%2Fmain%2Fjava%2Feu%2Fsvjatoslav%2Fsixth%2Fe3d%2Frenderer%2Fraster%2Fslicer%2FSlicer.java;h=183ea40266a9d2707778ffaef0d14165ce1dd806;hp=73c9abf38695dcef8d418d5727d400fec02f77c6;hb=77e87370474822855924c2650fcccf61cb41a05f;hpb=7f01c45bcea9575bb33d201f81b9b0056dacb909

diff --git a/src/main/java/eu/svjatoslav/sixth/e3d/renderer/raster/slicer/Slicer.java b/src/main/java/eu/svjatoslav/sixth/e3d/renderer/raster/slicer/Slicer.java
index 73c9abf..183ea40 100644
--- a/src/main/java/eu/svjatoslav/sixth/e3d/renderer/raster/slicer/Slicer.java
+++ b/src/main/java/eu/svjatoslav/sixth/e3d/renderer/raster/slicer/Slicer.java
@@ -7,12 +7,22 @@ package eu.svjatoslav.sixth.e3d.renderer.raster.slicer;
 import eu.svjatoslav.sixth.e3d.renderer.raster.shapes.basic.texturedpolygon.TexturedPolygon;
 
 import java.util.ArrayList;
-import java.util.Arrays;
 import java.util.List;
 
+import static java.util.Arrays.sort;
+
 public class Slicer {
 
+    /**
+     * Maximum distance between two points.
+     * If the distance is greater than this value, the polygon will be sliced.
+     * Otherwise, it will be added to the result.
+     */
     private final double maxDistance;
+
+    /**
+     * Result of slicing.
+     */
     private final List<TexturedPolygon> result = new ArrayList<>();
 
     public Slicer(final double maxDistance) {
@@ -20,14 +30,15 @@ public class Slicer {
     }
 
     private void considerSlicing(final PolygonCoordinate c1,
-                                 final PolygonCoordinate c2, final PolygonCoordinate c3,
+                                 final PolygonCoordinate c2,
+                                 final PolygonCoordinate c3,
                                  final TexturedPolygon originalPolygon) {
 
         final BorderLine[] lines = new BorderLine[]{
                 new BorderLine(c1, c2, 1), new BorderLine(c2, c3, 2),
                 new BorderLine(c3, c1, 3)};
 
-        Arrays.sort(lines, lines[0]);
+        sort(lines, lines[0]);
 
         final BorderLine longestLine = lines[2];