Package fmg.fmg8.graphVis.darstellungsModi

Examples of fmg.fmg8.graphVis.darstellungsModi.Konstanten

99
100
101
102
103
104
105
106
107
108
109
     */
    public Vektor2D schneidet(final Strecke2D s1) {
        Strecke2D s2
            = new Strecke2D(this.get(this.nPoints() - 1), this.get(0));
        boolean flip = false;
        Vektor2D schnitt;
       
        for (int i = 1; i <= this.nPoints(); i++) {
            schnitt = s1.schnPkt(s2);
           
            if (schnitt != null) {
View Full Code Here
187
188
189
190
191
192
193
194
195
196
197
    private void createBoundingBox() {
        if (this.nPoints() == 0) {
            return;
        }
       
        Vektor2D punkt = this.get(0);
       
        this.boundingBox = new Rechteck2D(punkt, punkt);
       
        for (int i = 1; i < this.nPoints(); i++) {
            this.erweitereBoundingBox(this.get(i));
View Full Code Here
349
350
351
352
353
354
355
356
357
358
359
     *          nicht gesetzt werden konnte, wird <code>null</code>
     *          zur�ckgegeben.
     */
    @Override
    public Vektor2D set(final int index, final Vektor2D element) {
        Vektor2D alt = this.get(index);
       
        this.remove(index);
        this.add(index, element);
       
        if (this.garantiereEinfach) {
View Full Code Here
417
418
419
420
421
422
423
424
425
426
427
     * @return  Polygon.
     */
    public Polygon toPol(final double skalierung, final Vektor2D versch) {
        Polygon pol = new Polygon();
        Iterator<Vektor2D> it = this.iterator();
        Vektor2D punkt;
       
        while (it.hasNext()) {
            punkt = it.next();
            pol.addPoint((int) (punkt.x * skalierung + versch.x),
                         (int) (punkt.y * skalierung + versch.y));
View Full Code Here
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
     */
    public void normalisiere2() {
        Polygon2D normArr = new Polygon2D(this.nPoints());
        ArrayList<Double> abstaende = new ArrayList<Double>(this.nPoints());
        Iterator<Vektor2D> it = this.iterator();
        Vektor2D letztV;
        Vektor2D aktV = new Vektor2D(Vektor2D.NULL_VEKTOR);
        double aktAbst;
        double letztAbst;
        Vektor2D aktRicht;
        double durchAbst;
        int i = 0;

        if (this.nPoints() <= 2) {
            return;
        }
       
        letztV = this.get(0);
        letztAbst = 0;
        while (it.hasNext()) {
            aktV = it.next();
           
            aktAbst = aktV.distanz(letztV) + letztAbst;
            abstaende.add(aktAbst);
           
            letztAbst = aktAbst;
            letztV = aktV;
        }

        durchAbst = abstaende.get(abstaende.size() - 1)
                    / (abstaende.size() - 1);
       
        aktV = new Vektor2D(this.get(0));
        normArr.add(aktV);
        aktAbst = 0;
        while (i < this.nPoints()) {
            if (i + 1 < this.nPoints()) {
                aktRicht = new Vektor2D(this.get(i + 1));
                aktRicht.sub(this.get(i));
               
                if (this.get(i).distanz(this.get(i + 1)) >= durchAbst) {
                    aktRicht.laengeFestlegen(durchAbst);
                   
                    while (aktAbst < abstaende.get(i + 1)) {
                        aktV = new Vektor2D(aktV);
                        aktV.add(aktRicht);
                        normArr.add(aktV);
                        aktAbst += durchAbst;
                    }
                } else {
                    double zwischAbst = 0;
                    double aktDist;
                   
                    while (i + 1 < nPoints()) {
                        aktDist = this.get(i).distanz(this.get(i + 1));
                       
                        if (zwischAbst + aktDist
                                < durchAbst) {
                            zwischAbst += aktDist;
                            i++;
                        } else {
                            aktRicht = new Vektor2D(this.get(i + 1));
                            aktRicht.sub(this.get(i));
                            aktRicht.laengeFestlegen(durchAbst - zwischAbst);
                            aktV = new Vektor2D(this.get(i));
                            aktV.add(aktRicht);
                            normArr.add(aktV);
                            aktAbst += durchAbst;
                            break;
                        }
View Full Code Here
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
     */
    public Polygon2D normalisiere() {
        Polygon2D normArr = new Polygon2D(this.nPoints());
        ArrayList<Double> abstaende = new ArrayList<Double>(this.nPoints());
        Iterator<Vektor2D> it = this.iterator();
        Vektor2D letztV;
        Vektor2D aktV = new Vektor2D(Vektor2D.NULL_VEKTOR);
        double aktAbst;
        double letztAbst;
        Vektor2D aktRicht;
        double durchAbst;
        int i = 0;
       
        if (this.nPoints() <= 1) {
            return this;
        }
       
        letztV = this.get(0);
        letztAbst = 0;
        while (it.hasNext()) {
            aktV = it.next();
           
            aktAbst = aktV.distanz(letztV) + letztAbst;
            abstaende.add(aktAbst);
           
            letztAbst = aktAbst;
            letztV = aktV;
        }

        durchAbst = abstaende.get(abstaende.size() - 1)
                    / (abstaende.size() - 1);
       
        aktV = new Vektor2D(this.get(0));
        normArr.add(aktV);
        aktAbst = 0;
        while (i < this.nPoints()) {
            if (i + 1 < this.nPoints()) {
                aktRicht = new Vektor2D(this.get(i + 1));
                aktRicht.sub(this.get(i));
                aktRicht.laengeFestlegen(durchAbst);
               
                while (aktAbst < abstaende.get(i + 1)) {
                    aktV = new Vektor2D(aktV);
                    aktV.add(aktRicht);
                    normArr.add(aktV);
                    aktAbst += durchAbst;
                }
            }
View Full Code Here
646
647
648
649
650
651
652
653
654
655
656
    /**
     * @return  Eine einfache Variante von <code>this</code>.
     */
    public Polygon2D toEinfach() {
        Polygon2D neu = new Polygon2D(this.nPoints());
        Vektor2D akt;
        Iterator<Vektor2D> it = this.iterator();
        neu.erzwingeEinfach(true);
       
        while (it.hasNext()) {
            akt = it.next();
View Full Code Here
700
701
702
703
704
705
706
707
708
709
710
   
    /**
     * @return  Mittelpunkt des Polygons.
     */
    public Vektor2D mittelpunkt() {
        return new Vektor2D(
                this.getBoundingBox().liObEcke().x
                    + this.getBoundingBox().getBreite() / 2,
                this.getBoundingBox().liObEcke().y
                    + this.getBoundingBox().getHoehe() / 2);
    }
View Full Code Here
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
            final Vektor2D p1,
            final Vektor2D p2,
            final Vektor2D p3,
            final double step) {
       Polygon2D kurve = new Polygon2D((int) (1 / step) + 1);
       Vektor2D punkt;
       Vektor2D dreiP0 = (new Vektor2D(p0));
       Vektor2D dreiP1 = (new Vektor2D(p1));
       Vektor2D dreiP2 = (new Vektor2D(p2));
       Vektor2D sechsP1 = (new Vektor2D(p1));
       dreiP0.mult(3);
       dreiP1.mult(3);
       dreiP2.mult(3);
       sechsP1.mult(6);
       Vektor2D punkt2, punkt3;
       double tQuad, tKub;

       for (double t = 0; t <= 1; t += step) {
           tQuad = t * t;
           tKub = t * tQuad;
          
           punkt = new Vektor2D(dreiP1);
           punkt.sub(p0);
           punkt.sub(dreiP2);
           punkt.add(p3);
           punkt.mult(tKub);
          
           punkt2 = new Vektor2D(dreiP0);
           punkt2.sub(sechsP1);
           punkt2.add(dreiP2);
           punkt2.mult(tQuad);
          
           punkt3 = new Vektor2D(dreiP1);
           punkt3.sub(dreiP0);
           punkt3.mult(t);
          
           punkt.add(punkt2);
           punkt.add(punkt3);
View Full Code Here
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
            final double step,
            final Parametersatz params) {
        Polygon2D kurve
          = new Polygon2D((int) ((p.size() - 1) / (step + 1)));
        Polygon2D bezier;
        Vektor2D v1, v2;
       
        if (p.size() < 2 || p.size() != v.size() || v.size() != k.size() + 2) {
            SonstMeth.log(SonstMeth.LOG_ERROR,
                          "Falsche Angaben bei Aufruf von multiBezier",
                          params);
        }
       
        v1 = new Vektor2D(v.get(0));
        v2 = new Vektor2D(p.get(1));
        v1.add(p.get(0));
        v2.sub(v.get(1));
       
        bezier = fmg.fmg8.graphVis.zeichenModi.Geometrie2D.bezierKurve(
                p.get(0), v1, v2, p.get(1), step);
        kurve.addAll(bezier);
       
        for (int i = 1; i < p.size() - 1; i++) {
            v1 = new Vektor2D(v.get(i));
            v2 = new Vektor2D(p.get(i + 1));
            v1.mult(k.get(i - 1));
            v1.add(p.get(i));
            v2.sub(v.get(i + 1));
            bezier = fmg.fmg8.graphVis.zeichenModi.Geometrie2D.bezierKurve(
                    p.get(i), v1, v2, p.get(i + 1), step);
            kurve.addAll(bezier);
        }
View Full Code Here
TOP

Related Classes of fmg.fmg8.graphVis.darstellungsModi.Konstanten

  • fmg.fmg8.endlAutomat.AutomatenNummer
  • fmg.fmg8.endlAutomat.conditions.CompLeaf
  • fmg.fmg8.endlAutomat.conditions.Condition
  • fmg.fmg8.endlAutomat.conditions.ConditionNummer
  • fmg.fmg8.endlAutomat.conditions.InnerNode
  • fmg.fmg8.endlAutomat.EndlicherAutomat
  • fmg.fmg8.endlAutomat.mutation.MutArt1VT
  • fmg.fmg8.endlAutomat.mutation.MutationSEQ
  • fmg.fmg8.endlAutomat.mutation.mutSeq.EinzelMutAdd
  • fmg.fmg8.endlAutomat.mutation.mutSeq.MutationKlWkeit
    • 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.