Package java.awt.geom

Examples of java.awt.geom.Line2D$Iterator

753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
        if (underlayContains(oldCrop, underlay)) {
            return oldCrop;
        }
        Point2D se = oldCrop.getLowerRight();
        Point2D nw = oldCrop.getUpperLeft();
        Line2D diagonal = new Line2D.Double(se, nw);

        double oldDiag = se.distance(nw);
        double newDiag = getMinimumDistance(
            nw, Collections.singleton(diagonal), underlay
        );
        double diagScale = newDiag / oldDiag;

        Point2D ne = oldCrop.getUpperRight();
        Line2D north = getNorthCropLine(oldCrop);

        double oldNorth = nw.distance(ne);
        double newNorth = getMinimumDistance(
            nw, Collections.singleton(north), underlay
        );
        double northScale = newNorth / oldNorth;

        Point2D sw = oldCrop.getLowerLeft();
        Line2D west = getWestCropLine(oldCrop);

        double oldWest = sw.distance(nw);
        double newWest = getMinimumDistance(
            nw, Collections.singleton(west), underlay
        );
View Full Code Here
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
        if (underlayContains(oldCrop, underlay)) {
            return oldCrop;
        }
        Point2D sw = oldCrop.getLowerLeft();
        Point2D ne = oldCrop.getUpperRight();
        Line2D diagonal = new Line2D.Double(sw, ne);

        double oldDiag = sw.distance(ne);
        double newDiag = getMinimumDistance(
            ne, Collections.singleton(diagonal), underlay
        );
        double diagScale = newDiag / oldDiag;

        Point2D nw = oldCrop.getUpperLeft();
        Line2D north = getNorthCropLine(oldCrop);

        double oldNorth = nw.distance(ne);
        double newNorth = getMinimumDistance(
            ne, Collections.singleton(north), underlay
        );
        double northScale = newNorth / oldNorth;

        Point2D se = oldCrop.getLowerRight();
        Line2D east = getEastCropLine(oldCrop);

        double oldEast = ne.distance(se);
        double newEast = getMinimumDistance(
            ne, Collections.singleton(east), underlay
        );
View Full Code Here
865
866
867
868
869
870
871
872
873
874
875
876
877
878
    // intersection between any of the given lines and the underlay rectangle.
    // If none of the lines intersect the underlay, returns -1;
    private static double getMinimumDistance(
        Point2D p, Collection<Line2D> lines, Rectangle2D underlay
    ) {
        Line2D top = getTopUnderlayLine(underlay);
        Line2D left = getLeftUnderlayLine(underlay);
        Line2D bottom = getBottomUnderlayLine(underlay);
        Line2D right = getRightUnderlayLine(underlay);

        LinkedList<Point2D> intersections = new LinkedList<Point2D>();

        for (Line2D line : lines) {
View Full Code Here
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
        }
        return false;
    }

    private static double getMinimumDistance(Point2D p, Rectangle2D underlay) {
        Line2D top = getTopUnderlayLine(underlay);
        Line2D bottom = getBottomUnderlayLine(underlay);
        Line2D left = getLeftUnderlayLine(underlay);
        Line2D right = getRightUnderlayLine(underlay);

        double dist = top.ptLineDist(p);
        dist = Math.min(dist, bottom.ptLineDist(p));
        dist = Math.min(dist, left.ptLineDist(p));
        dist = Math.min(dist, right.ptLineDist(p));

        return dist;
    }
View Full Code Here
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
        CropBounds oldCrop, Rectangle2D underlay
    ) {
        if (underlayContains(oldCrop, underlay)) {
            return oldCrop;
        }
        Line2D top = getTopUnderlayLine(underlay);
        Line2D left = getLeftUnderlayLine(underlay);
        Line2D bottom = getBottomUnderlayLine(underlay);
        Line2D right = getRightUnderlayLine(underlay);

        Line2D north = getNorthCropLine(oldCrop);
        Line2D south = getSouthCropLine(oldCrop);
        Line2D east = getEastCropLine(oldCrop);
        Line2D west = getWestCropLine(oldCrop);

        Point2D et = getIntersection(east, top);
        Point2D el = getIntersection(east, left);
        Point2D eb = getIntersection(east, bottom);
        Point2D er = getIntersection(east, right);
View Full Code Here
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
        CropBounds oldCrop, Rectangle2D underlay
    ) {
        if (underlayContains(oldCrop, underlay)) {
            return oldCrop;
        }
        Line2D top = getTopUnderlayLine(underlay);
        Line2D left = getLeftUnderlayLine(underlay);
        Line2D bottom = getBottomUnderlayLine(underlay);
        Line2D right = getRightUnderlayLine(underlay);

        Line2D north = getNorthCropLine(oldCrop);
        Line2D south = getSouthCropLine(oldCrop);
        Line2D east = getEastCropLine(oldCrop);
        Line2D west = getWestCropLine(oldCrop);

        Point2D et = getIntersection(east, top);
        Point2D el = getIntersection(east, left);
        Point2D eb = getIntersection(east, bottom);
        Point2D er = getIntersection(east, right);
View Full Code Here
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
        CropBounds oldCrop, Rectangle2D underlay
    ) {
        if (underlayContains(oldCrop, underlay)) {
            return oldCrop;
        }
        Line2D top = getTopUnderlayLine(underlay);
        Line2D left = getLeftUnderlayLine(underlay);
        Line2D bottom = getBottomUnderlayLine(underlay);
        Line2D right = getRightUnderlayLine(underlay);

        Line2D north = getNorthCropLine(oldCrop);
        Line2D south = getSouthCropLine(oldCrop);
        Line2D east = getEastCropLine(oldCrop);
        Line2D west = getWestCropLine(oldCrop);

        Point2D nt = getIntersection(north, top);
        Point2D nl = getIntersection(north, left);
        Point2D nb = getIntersection(north, bottom);
        Point2D nr = getIntersection(north, right);

        Point2D st = getIntersection(south, top);
        Point2D sl = getIntersection(south, left);
        Point2D sb = getIntersection(south, bottom);
        Point2D sr = getIntersection(south, right);

        double width = oldCrop.getWidth();

        if (nt != null) {
            width = minIgnoreNegative(width, west.ptLineDist(nt));
        }
        if (nl != null) {
            width = minIgnoreNegative(width, west.ptLineDist(nl));
        }
        if (nb != null) {
            width = minIgnoreNegative(width, west.ptLineDist(nb));
        }
        if (nr != null) {
            width = minIgnoreNegative(width, west.ptLineDist(nr));
        }
        if (st != null) {
            width = minIgnoreNegative(width, west.ptLineDist(st));
        }
        if (sl != null) {
            width = minIgnoreNegative(width, west.ptLineDist(sl));
        }
        if (sb != null) {
            width = minIgnoreNegative(width, west.ptLineDist(sb));
        }
        if (sr != null) {
            width = minIgnoreNegative(width, west.ptLineDist(sr));
        }
        Point2D oldCenter = oldCrop.getCenter();
        double angle = oldCrop.getAngle();
        double height = oldCrop.getHeight();
        double dw = width - oldCrop.getWidth();
View Full Code Here
172
173
174
175
176
177
178
179
180
181
182
            Rectangle2D bounds = new Rectangle2D.Double(0, 0, w, h);
            double midX = w / 2d;
            double midY = h / 2d;

            InfiniteLine line;
            Line2D l;
            double normal = angle + Math.PI / 2;
            double x, y;
            int n;

            n = 0;
View Full Code Here
142
143
144
145
146
147
148
149
150
151
152
        GeneralPath path = new GeneralPath();
        for (double t=start; t<=end; t+=inc) {
            double newX = xNum.evaluate(t) / xDen.evaluate(t);
            double newY = yNum.evaluate(t) / yDen.evaluate(t);
            Line2D line = new Line2D.Double(oldX, oldY, newX, newY);
            path.append(line, true);
            oldX = newX;
            oldY = newY;
        }
        return path;
View Full Code Here
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
    Line2D getSegment(Rectangle2D rect) {
        if (isMoreHorizontal) {
            double x1 = rect.getX();
            double x2 = rect.getX() + rect.getWidth();
            Line2D line = getHorizontalSegment(x1, x2);
            if (rect.intersectsLine(line)) {
                return line;
            }
        }
        else {
            double y1 = rect.getY();
            double y2 = rect.getY() + rect.getHeight();
            Line2D line = getVerticalSegment(y1, y2);
            if (rect.intersectsLine(line)) {
                return line;
            }
        }
        return null;
View Full Code Here
TOP

Related Classes of java.awt.geom.Line2D$Iterator

  • com.eteks.sweethome3d.model.DimensionLine
  • com.eteks.sweethome3d.model.Wall
  • com.itextpdf.awt.PdfGraphics2D
  • com.itextpdf.text.pdf.internal.PolylineShape
  • com.itextpdf.text.pdf.PdfGraphics2D
  • com.lightcrafts.ui.crop.UnderlayConstraints
  • com.lowagie.text.pdf.PdfGraphics2D
  • com.mxgraph.view.mxGraphView
  • de.hpi.eworld.gui.util.Geometry
  • de.progra.charting.CoordSystemUtilities
    • 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.