/*
 * The JTS Topology Suite is a collection of Java classes that
 * implement the fundamental operations required to validate a given
 * geo-spatial data set to a known topological specification.
 *
 * Copyright (C) 2001 Vivid Solutions
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 * For more information, contact:
 *
 *     Vivid Solutions
 *     Suite #1A
 *     2328 Government Street
 *     Victoria BC  V8T 5G5
 *     Canada
 *
 *     (250)385-6040
 *     www.vividsolutions.com
 */
package com.revolsys.geometry.test.old.algorithm;

import com.revolsys.geometry.algorithm.LineIntersector;
import com.revolsys.geometry.algorithm.RectangleLineIntersector;
import com.revolsys.geometry.algorithm.RobustLineIntersector;
import com.revolsys.geometry.model.BoundingBox;
import com.revolsys.geometry.model.Geometry;
import com.revolsys.geometry.model.GeometryFactory;
import com.revolsys.geometry.model.Point;
import com.revolsys.geometry.model.coordinates.list.CoordinatesListUtil;
import com.revolsys.geometry.model.impl.BoundingBoxDoubleXY;
import com.revolsys.geometry.model.impl.PointDoubleXY;

import junit.framework.TestCase;
import junit.textui.TestRunner;

public class RectangleLineIntersectorTest extends TestCase {
  public static void main(final String args[]) {
    TestRunner.run(RectangleLineIntersectorTest.class);
  }

  public RectangleLineIntersectorTest(final String name) {
    super(name);
  }

  public void test300Points() {
    final RectangleLineIntersectorValidator test = new RectangleLineIntersectorValidator();
    test.init(300);
    assertTrue(test.validate());
  }
}

/**
 * Tests optimized RectangleLineIntersector against
 * a brute force approach (which is assumed to be correct).
 *
 * @author Martin Davis
 *
 */
class RectangleLineIntersectorValidator {
  private final double baseX = 0;

  private final double baseY = 0;

  private final GeometryFactory geomFact = GeometryFactory.DEFAULT_3D;

  private boolean isValid = true;

  private Point[] pts;

  private BoundingBox rectEnv;

  private final double rectSize = 100;

  public RectangleLineIntersectorValidator() {

  }

  public void init(final int nPts) {
    this.rectEnv = newRectangle();
    this.pts = newTestPoints(nPts);

  }

  private BoundingBox newRectangle() {
    final BoundingBox rectEnv = new BoundingBoxDoubleXY(this.baseX, this.baseY,
      this.baseX + this.rectSize, this.baseY + this.rectSize);
    return rectEnv;
  }

  private Point[] newTestPoints(final int nPts) {
    final Point pt = this.geomFact.point(this.baseX, this.baseY);
    final Geometry circle = pt.buffer(2 * this.rectSize, nPts / 4);
    return CoordinatesListUtil.getPointArray(circle);
  }

  public void run(final boolean useSegInt, final boolean useSideInt) {
    final RectangleLineIntersector rectSegIntersector = new RectangleLineIntersector(this.rectEnv);
    final SimpleRectangleIntersector rectSideIntersector = new SimpleRectangleIntersector(
      this.rectEnv);

    for (int i = 0; i < this.pts.length; i++) {
      for (int j = 0; j < this.pts.length; j++) {
        if (i == j) {
          continue;
        }

        boolean segResult = false;
        if (useSegInt) {
          segResult = rectSegIntersector.intersects(this.pts[i], this.pts[j]);
        }
        boolean sideResult = false;
        if (useSideInt) {
          sideResult = rectSideIntersector.intersects(this.pts[i], this.pts[j]);
        }

        if (useSegInt && useSideInt) {
          if (segResult != sideResult) {
            this.isValid = false;
          }
        }
      }
    }
  }

  public boolean validate() {
    run(true, true);
    return this.isValid;
  }

}

class SimpleRectangleIntersector {
  /**
   * The corners of the rectangle, in the order:
   *  10
   *  23
   */
  private final Point[] corner = new Point[4];

  // for intersection testing, don't need to set precision model
  private final LineIntersector li = new RobustLineIntersector();

  private final BoundingBox rectEnv;

  public SimpleRectangleIntersector(final BoundingBox rectEnv) {
    this.rectEnv = rectEnv;
    initCorners(rectEnv);
  }

  private void initCorners(final BoundingBox rectEnv) {
    this.corner[0] = new PointDoubleXY(rectEnv.getMaxX(), rectEnv.getMaxY());
    this.corner[1] = new PointDoubleXY(rectEnv.getMinX(), rectEnv.getMaxY());
    this.corner[2] = new PointDoubleXY(rectEnv.getMinX(), rectEnv.getMinY());
    this.corner[3] = new PointDoubleXY(rectEnv.getMaxX(), rectEnv.getMinY());
  }

  public boolean intersects(final Point p0, final Point p1) {
    final double x1 = p0.getX();
    final double y1 = p0.getY();
    final double x2 = p1.getX();
    final double y2 = p1.getY();
    if (!this.rectEnv.intersects(x1, y1, x2, y2)) {
      return false;
    }

    this.li.computeIntersectionPoints(p0, p1, this.corner[0], this.corner[1]);
    if (this.li.hasIntersection()) {
      return true;
    }
    this.li.computeIntersectionPoints(p0, p1, this.corner[1], this.corner[2]);
    if (this.li.hasIntersection()) {
      return true;
    }
    this.li.computeIntersectionPoints(p0, p1, this.corner[2], this.corner[3]);
    if (this.li.hasIntersection()) {
      return true;
    }
    this.li.computeIntersectionPoints(p0, p1, this.corner[3], this.corner[0]);
    if (this.li.hasIntersection()) {
      return true;
    }

    return false;
  }

}