CaRMtl/rene/zirkel/graphics/PolygonDrawer.java

/* 

Copyright 2006 Rene Grothmann, modified by Eric Hakenholz

This file is part of C.a.R. software.

C.a.R. is a free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, version 3 of the License.

C.a.R. 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 General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program.  If not, see <http://www.gnu.org/licenses/>.

 */
package rene.zirkel.graphics;

import rene.zirkel.objects.ConstructionObject;

/**
 * @author Rene
 * 
 */
public class PolygonDrawer {

    MyGraphics G;
    ConstructionObject O;
    double C, R;
    double oldR=Double.NaN;
    double C1, R1;
    boolean HaveToFinish;
//    private double step=9.0;
    private double maxGap=20;
    public boolean Marker=false;
    public boolean Started;
    boolean Solid;
    boolean haveToCheckDiscontinuity;

    public PolygonDrawer(boolean checkDiscontinuity, final MyGraphics g, final ConstructionObject o) {
        G=g;
        O=o;
        Started=false;
        haveToCheckDiscontinuity=checkDiscontinuity;
//        step=9.0*O.getConstruction().getOne()*O.getConstruction().getOne();
        maxGap=20*O.getConstruction().getOne();
    }

    public boolean isLineOnDiscontinuity(final double c, final double r) {
        if ((!haveToCheckDiscontinuity)||(Double.isNaN(oldR))) {
            return false;
        }
        if (((R-oldR)*(r-R))<0) { // Si il y a changement de signe de la "dérivée"
            if (Math.abs(r-R)>maxGap) { // Et si en plus le "trou" est trop grand
                finishPolygon();
                startPolygon(c, r); // On commence un nouveau polygone
                return true;
            }
        }
        return false;
    }

    public void startPolygon(final double c, final double r) {
        C=c;
        R=r;
        oldR=Double.NaN;
        HaveToFinish=false;
        Started=true;
    }

//    public void drawTo(final double c, final double r, final boolean dodraw) {
//        if (!Started) {
//            startPolygon(c, r);
//            return;
//        }
//        if (!isLineOnDiscontinuity(c, r)) {
//            if (dodraw||(c-C)*(c-C)+(r-R)*(r-R)>step) {
//                if (Marker) {
//                    ((MainGraphics) G).drawMarkerLine(C, R, c, r);
//                } else {
//                    G.drawLine(C, R, c, r, O);
//                }
//                oldR=R;
//                C=c;
//                R=r;
//                HaveToFinish=false;
//            } else {
//
//                C1=c;
//                R1=r;
//                HaveToFinish=true;
//            }
//        }
//    }

    public void drawTo(final double c, final double r) {
//        drawTo(c, r, false);
        if (!Started) {
            startPolygon(c, r);
            return;
        }
        if (!isLineOnDiscontinuity(c, r)) {
            if (Marker) {
                ((MainGraphics) G).drawMarkerLine(C, R, c, r);
            } else {
                G.drawLine(C, R, c, r, O);
            }
            oldR=R;
            C=c;
            R=r;
            HaveToFinish=false;
        }
    }

    public void finishPolygon() {
        if (HaveToFinish) {
            if (Marker) {
                ((MainGraphics) G).drawMarkerLine(C, R, C1, R1);
            } else {
                G.drawLine(C, R, C1, R1, O);
            }
            HaveToFinish=false;
        }
        Started=false;
    }

    public boolean hasStarted() {
        return Started;
    }

    public double c() {
        return C;
    }

    public double r() {
        return R;
    }

    public void useAsMarker() {
        Marker=true;
//        step=18;
    }
}