Package org.apache.harmony.awt.geom

Examples of org.apache.harmony.awt.geom.CrossingHelper

411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
    this.coordsSize = resultCoordPos;
    this.rulesSize = resultRulesPos;
  }

    private void addPolygon(Area area) {
    CrossingHelper crossHelper = new CrossingHelper(new double[][] {coords,
                                                area.coords },
                                                new int[] {coordsSize,
                                                area.coordsSize });
    IntersectPoint[] intersectPoints = crossHelper.findCrossing();

    if (intersectPoints.length == 0) {
      if (area.contains(getBounds2D())) {
        copy(area, this);
      } else if (!contains(area.getBounds2D())) {
View Full Code Here
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
    coordsSize = resultCoordPos;
    rulesSize = resultRulesPos;
  }

  private void intersectPolygon(Area area) {
    CrossingHelper crossHelper = new CrossingHelper(new double[][] {coords,
                                                area.coords },
                                                new int[] { coordsSize,
                                                area.coordsSize });
    IntersectPoint[] intersectPoints = crossHelper.findCrossing();

    if (intersectPoints.length == 0) {
      if (contains(area.getBounds2D())) {
        copy(area, this);
      } else if (!area.contains(getBounds2D())) {
View Full Code Here
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
    coordsSize = resultCoordPos;
    rulesSize = resultRulesPos;
  }

  private void subtractPolygon(Area area) {
    CrossingHelper crossHelper = new CrossingHelper(new double[][] {coords,
                                                area.coords },
                                                new int[] { coordsSize,
                                                area.coordsSize });
    IntersectPoint[] intersectPoints = crossHelper.findCrossing();

    if (intersectPoints.length == 0) {
        if (contains(area.getBounds2D())) {
            copy(area, this);
            return;
      }
        return;
    }

        double[] resultCoords = new double[2 * (coordsSize + area.coordsSize +
                                                       intersectPoints.length)];
        int[] resultRules = new int[2 * (rulesSize + area.rulesSize +
                                                       intersectPoints.length)];
        int[] resultOffsets = new int[2 * (rulesSize + area.rulesSize +
                                                       intersectPoints.length)];
        int resultCoordPos = 0;
        int resultRulesPos = 0;
        boolean isCurrentArea = true;
        int countPoints = 0;
        boolean curArea = false;
        boolean addArea = false;

        IntersectPoint point = intersectPoints[0];
        resultRules[resultRulesPos] = PathIterator.SEG_MOVETO;
        resultOffsets[resultRulesPos++] = resultCoordPos;
       
        do {
          resultCoords[resultCoordPos++] = point.getX();
            resultCoords[resultCoordPos++] = point.getY();
            resultRules[resultRulesPos] = PathIterator.SEG_LINETO;
            resultOffsets[resultRulesPos++] = resultCoordPos - 2;
            int curIndex = point.getEndIndex(true);
           
            if ((curIndex < 0) ||
                (area.isVertex(coords[2 * curIndex], coords[2 * curIndex + 1]) &&
                     crossHelper.containsPoint(new double[] {coords[2 * curIndex],
                                           coords[2 * curIndex + 1]}) &&
                (coords[2 * curIndex] != point.getX() ||
                   coords[2 * curIndex + 1] != point.getY()))) {
              isCurrentArea = !isCurrentArea;
            } else if (area.containsExact(coords[2 * curIndex],
View Full Code Here
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
    this.coordsSize = resultCoordPos;
    this.rulesSize = resultRulesPos;
  }

    private void addPolygon(Area area) {
    CrossingHelper crossHelper = new CrossingHelper(new double[][] {coords,
                                                area.coords },
                                                new int[] {coordsSize,
                                                area.coordsSize });
    IntersectPoint[] intersectPoints = crossHelper.findCrossing();

    if (intersectPoints.length == 0) {
      if (area.contains(getBounds2D())) {
        copy(area, this);
      } else if (!contains(area.getBounds2D())) {
View Full Code Here
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
    coordsSize = resultCoordPos;
    rulesSize = resultRulesPos;
  }

  private void intersectPolygon(Area area) {
    CrossingHelper crossHelper = new CrossingHelper(new double[][] {coords,
                                                area.coords },
                                                new int[] { coordsSize,
                                                area.coordsSize });
    IntersectPoint[] intersectPoints = crossHelper.findCrossing();

    if (intersectPoints.length == 0) {
      if (contains(area.getBounds2D())) {
        copy(area, this);
      } else if (!area.contains(getBounds2D())) {
View Full Code Here
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
    coordsSize = resultCoordPos;
    rulesSize = resultRulesPos;
  }

  private void subtractPolygon(Area area) {
    CrossingHelper crossHelper = new CrossingHelper(new double[][] {coords,
                                                area.coords },
                                                new int[] { coordsSize,
                                                area.coordsSize });
    IntersectPoint[] intersectPoints = crossHelper.findCrossing();

    if ((intersectPoints.length == 0) && (contains(area.getBounds2D()))) {
      copy(area, this);
      return;
    }
View Full Code Here
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
    this.coordsSize = resultCoordPos;
    this.rulesSize = resultRulesPos;
  }

    private void addPolygon(Area area) {
    CrossingHelper crossHelper = new CrossingHelper(new double[][] {coords,
                                                area.coords },
                                                new int[] {coordsSize,
                                                area.coordsSize });
    IntersectPoint[] intersectPoints = crossHelper.findCrossing();

    if (intersectPoints.length == 0) {
      if (area.contains(getBounds2D())) {
        copy(area, this);
      } else if (!contains(area.getBounds2D())) {
View Full Code Here
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
    coordsSize = resultCoordPos;
    rulesSize = resultRulesPos;
  }

  private void intersectPolygon(Area area) {
    CrossingHelper crossHelper = new CrossingHelper(new double[][] {coords,
                                                area.coords },
                                                new int[] { coordsSize,
                                                area.coordsSize });
    IntersectPoint[] intersectPoints = crossHelper.findCrossing();

    if (intersectPoints.length == 0) {
      if (contains(area.getBounds2D())) {
        copy(area, this);
      } else if (!area.contains(getBounds2D())) {
View Full Code Here
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
    coordsSize = resultCoordPos;
    rulesSize = resultRulesPos;
  }

  private void subtractPolygon(Area area) {
    CrossingHelper crossHelper = new CrossingHelper(new double[][] {coords,
                                                area.coords },
                                                new int[] { coordsSize,
                                                area.coordsSize });
    IntersectPoint[] intersectPoints = crossHelper.findCrossing();

    if (intersectPoints.length == 0) {
        if (contains(area.getBounds2D())) {
            copy(area, this);
            return;
      }
        return;
    }

        double[] resultCoords = new double[2 * (coordsSize + area.coordsSize +
                                                       intersectPoints.length)];
        int[] resultRules = new int[2 * (rulesSize + area.rulesSize +
                                                       intersectPoints.length)];
        int[] resultOffsets = new int[2 * (rulesSize + area.rulesSize +
                                                       intersectPoints.length)];
        int resultCoordPos = 0;
        int resultRulesPos = 0;
        boolean isCurrentArea = true;
        int countPoints = 0;
        boolean curArea = false;
        boolean addArea = false;

        IntersectPoint point = intersectPoints[0];
        resultRules[resultRulesPos] = PathIterator.SEG_MOVETO;
        resultOffsets[resultRulesPos++] = resultCoordPos;
       
        do {
          resultCoords[resultCoordPos++] = point.getX();
            resultCoords[resultCoordPos++] = point.getY();
            resultRules[resultRulesPos] = PathIterator.SEG_LINETO;
            resultOffsets[resultRulesPos++] = resultCoordPos - 2;
            int curIndex = point.getEndIndex(true);
           
            if ((curIndex < 0) ||
                (area.isVertex(coords[2 * curIndex], coords[2 * curIndex + 1]) &&
                     crossHelper.containsPoint(new double[] {coords[2 * curIndex],
                                           coords[2 * curIndex + 1]}) &&
                (coords[2 * curIndex] != point.getX() ||
                   coords[2 * curIndex + 1] != point.getY()))) {
              isCurrentArea = !isCurrentArea;
            } else if (area.containsExact(coords[2 * curIndex],
View Full Code Here
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
    this.coordsSize = resultCoordPos;
    this.rulesSize = resultRulesPos;
  }

    private void addPolygon(Area area) {
    CrossingHelper crossHelper = new CrossingHelper(new double[][] {coords,
                                                area.coords },
                                                new int[] {coordsSize,
                                                area.coordsSize });
    IntersectPoint[] intersectPoints = crossHelper.findCrossing();

    if (intersectPoints.length == 0) {
      if (area.contains(getBounds2D())) {
        copy(area, this);
      } else if (!contains(area.getBounds2D())) {
View Full Code Here
TOP

Related Classes of org.apache.harmony.awt.geom.CrossingHelper

  • com.google.code.appengine.awt.geom.Area
  • com.jgraph.gaeawt.java.awt.geom.Area
  • java.awt.geom.Area
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.