add adpative triangulation implementation

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

 package org.vadere.util.delaunay;
 
-import org.apache.commons.lang3.tuple.ImmutablePair;
 import org.apache.commons.lang3.tuple.ImmutableTriple;
-import org.apache.commons.lang3.tuple.Pair;
 import org.apache.commons.lang3.tuple.Triple;
-import org.vadere.util.geometry.LinkedCellsGrid;
 import org.vadere.util.geometry.shapes.VCircle;
 import org.vadere.util.geometry.shapes.VLine;
 import org.vadere.util.geometry.shapes.VPoint;
@@ -80,8 +77,6 @@ public class BowyerWatson<P extends VPoint> {
 
     private void handle(final P point) {
         HashSet<Line> edges = new HashSet<>();
-
-	    // This is way to expensive O(n) instead of O(log(n))
         Map<Boolean, List<Triple<P, P, P>>> partition = triangles.parallelStream().collect(Collectors.partitioningBy(t -> pointsToTriangle(t).isInCircumscribedCycle(point)));
 
 	    List<Triple<P, P, P>> badTriangles = partition.get(true);