code: public void insertPoint(Set<Vector3> vertices, Vector3 p) {
  
  		modCount++;
  		updateBoundingBox(p);
  		vertices.add(p);
  		Triangle t = insertPointSimple(vertices, p);
  
  		if (t == null) //
  			return;
  
  		Triangle tt = t;
  		//currT = t; // recall the last point for - fast (last) update iterator.
  		do {
  			flip(tt, modCount);
  			tt = tt.canext;
  		} while (tt != t && !tt.halfplane);
  
  		// Update index with changed triangles
  		/*if(gridIndex != null) {
  			gridIndex.updateIndex(getLastUpdatedTriangles());
  		}*/
  	}
docs: insert the point to this Delaunay Triangulation. Note: if p is null or
  already exist in this triangulation p is ignored.
  @param vertices
  @param p new vertex to be inserted the triangulation.