implement the eikonal solver for acute triangulation

VadereUtils/src/org/vadere/util/delaunay/PointLocation.java

@@ -130,12 +130,7 @@ public class PointLocation<P extends VPoint> {
 			return Optional.of(edge.getFace());
 		}
 		else {
-			if(edge.getTwin().isPresent()) {
-				return Optional.of(edge.getTwin().get().getFace());
-			}
-			else {
-				return Optional.empty();
-			}
+			return Optional.of(edge.getTwin().getFace());
 		}
 	}
 }

VadereUtils/src/org/vadere/util/geometry/data/Triangulation.java

@@ -6,9 +6,10 @@ import java.util.Set;
 import java.util.stream.Stream;
 
 public interface Triangulation<P extends IPoint> {
-	Face<P> locate(P point);
+	Face<P> locate(final double x, final double y);
+	Face<P> locate(final IPoint point);
 	Stream<Face<P>> streamFaces();
 	Set<Face<P>> getFaces();
-	void insert(P point);
-	void remove(P point);
+	void insert(final P point);
+	void remove(final P point);
 }

VadereUtils/src/org/vadere/util/math/InterpolationUtil.java

@@ -21,6 +21,7 @@ public class InterpolationUtil {
 		PotentialPoint p1 = points.get(0);
 		PotentialPoint p2 = points.get(1);
 		PotentialPoint p3 = points.get(2);
+
 		VTriangle vtriangle = new VTriangle(new VPoint(p1), new VPoint(p2), new VPoint(p3));
 
 		double totalArea = vtriangle.getArea();