org.apache.batik.ext.awt.geom.AbstractSegment Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of org.apache.fop Show documentation
The core maven build properties
The newest version!
/*

   Licensed to the Apache Software Foundation (ASF) under one or more
   contributor license agreements.  See the NOTICE file distributed with
   this work for additional information regarding copyright ownership.
   The ASF licenses this file to You under the Apache License, Version 2.0
   (the "License"); you may not use this file except in compliance with
   the License.  You may obtain a copy of the License at

       http://www.apache.org/licenses/LICENSE-2.0

   Unless required by applicable law or agreed to in writing, software
   distributed under the License is distributed on an "AS IS" BASIS,
   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   See the License for the specific language governing permissions and
   limitations under the License.

 */
package org.apache.batik.ext.awt.geom;

import java.awt.geom.Point2D;
import java.util.Arrays;

/**
 * An abstract class for path segments.
 *
 * @version $Id: AbstractSegment.java 1733416 2016-03-03 07:07:13Z gadams $
 */
public abstract class AbstractSegment implements Segment {

    protected abstract int findRoots(double y, double [] roots);

    public Segment.SplitResults split(double y) {
        double [] roots = { 0, 0, 0 };
        int numSol = findRoots(y, roots);
        if (numSol == 0) return null; // No split

        Arrays.sort(roots, 0, numSol);
        double [] segs = new double[numSol+2];
        int numSegments=0;
        segs[numSegments++] = 0;
        for (int i=0; i= 1.0) break;
            if (segs[numSegments-1] != r)
                segs[numSegments++] = r;
        }
        segs[numSegments++] = 1.0;

        if (numSegments == 2) return null;
        // System.err.println("Y: " + y + "#Seg: " + numSegments +
        //                    " Seg: " + this);

        Segment [] parts = new Segment[numSegments];
        double pT = 0.0;
        int pIdx = 0;
        boolean firstAbove=false, prevAbove=false;
        for (int i=1; i 0)?a:-a;
    }

    public static int solveCubic(double a3, double a2,
                                  double a1, double a0,
                                  double [] roots) {

        // System.err.println("Cubic: " + a3 + "t^3 + " +
        //                    a2 +"t^2 + " +
        //                    a1 +"t + " + a0);

        double [] dRoots = { 0, 0};
        int dCnt = solveQuad(3*a3, 2*a2, a1, dRoots);
        double [] yVals = {0, 0, 0, 0};
        double [] tVals = {0, 0, 0, 0};
        int yCnt=0;
        yVals[yCnt]   = a0;
        tVals[yCnt++] = 0;
        double r;
        switch (dCnt) {
        case 1:
            r = dRoots[0];
            if ((r > 0) && (r < 1)) {
                yVals[yCnt]   = ((a3*r+a2)*r+a1)*r+a0;
                tVals[yCnt++] = r;
            }
            break;
        case 2:
            if (dRoots[0] > dRoots[1]) {
                double t  = dRoots[0];
                dRoots[0] = dRoots[1];
                dRoots[1] = t;
            }
            r = dRoots[0];
            if ((r > 0) && (r < 1)) {
                yVals[yCnt]   = ((a3*r+a2)*r+a1)*r+a0;
                tVals[yCnt++] = r;
            }
            r = dRoots[1];
            if ((r > 0) && (r < 1)) {
                yVals[yCnt]   = ((a3*r+a2)*r+a1)*r+a0;
                tVals[yCnt++] = r;
            }
            break;
        default: break;
        }
        yVals[yCnt]   = a3+a2+a1+a0;
        tVals[yCnt++] = 1.0;

        int ret=0;
        for (int i=0; i 0) && (y1 > 0)) continue;

            if (y0 > y1) { // swap so y0 < 0 and y1 > 0
                double t;
                t = y0; y0=y1; y1=t;
                t = t0; t0=t1; t1=t;
            }

            if (-y0 < tol*y1) { roots[ret++] = t0;      continue; }
            if (y1 < -tol*y0) { roots[ret++] = t1; i++; continue; }

            double epsZero = tol*(y1-y0);
            int cnt;
            for (cnt=0; cnt<20; cnt++) {
                double dt = t1-t0;
                double dy = y1-y0;
                // double t = (t0+t1)/2;
                // double t= t0+Math.abs(y0/dy)*dt;
                // This tends to make sure that we come up
                // a little short each time this generaly allows
                // you to eliminate as much of the range as possible
                // without overshooting (in which case you may eliminate
                // almost nothing).
                double t= t0+(Math.abs(y0/dy)*99+.5)*dt/100;
                double v = ((a3*t+a2)*t+a1)*t+a0;
                if (Math.abs(v) < epsZero) {
                    roots[ret++] = t; break;
                }
                if (v < 0) { t0 = t; y0=v;}
                else       { t1 = t; y1=v;}
            }
            if (cnt == 20)
                roots[ret++] = (t0+t1)/2;
        }
        return ret;
    }

    /*
    public static void check(Segment seg, float y, PrintStream ps) {
        ps.println("");

        ps.println("\n");

        SplitResults sr = seg.split(y);
        if (sr == null) return;
        Segment [] above = sr.getAbove();
        Segment [] below = sr.getBelow();
        for (int i=0; i");
        }
        for (int i=0; i");
        }
    }
    public static void main(String [] args) {
        PrintStream ps;
        double [] roots = { 0, 0, 0 };
        int n = solveCubic (-0.10000991821289062, 9.600013732910156,
                            -35.70000457763672, 58.0, roots);
        for (int i=0; i\n" +
                   "\n" +
                   "");
    }
    */
}