code: public boolean intersects2DIncomplete(Polygon other) {
      assert (this.getDimensionality() == 2);
      assert (other.getDimensionality() == 2);
      for(double[] v : this.points) {
        if(other.containsPoint2D(v)) {
          return true;
        }
      }
      for(double[] v : other.points) {
        if(this.containsPoint2D(v)) {
          return true;
        }
      }
      return false;
    }
docs: Simple polygon intersection test.
  <p>
  FIXME: while this is found on some web pages as "solution" and satisfies or
  needs, it clearly is not correct; not even for convex polygons: Consider a
  cross where the two bars are made out of four vertices each. No vertex is
  inside the other polygon, yet they intersect.
  <p>
  I knew this before writing this code, but this O(n) code was the simplest
  thing to come up with, and it would work for our current data sets. A way
  to fix this is to augment it with the obvious O(n*n) segment intersection
  test. (Note that you will still need to test for point containment, since
  the whole polygon could be contained in the other!)
  
  @param other Other polygon
  @return True when the polygons intersect