2362N/A * Copyright (c) 1998, 2006, Oracle and/or its affiliates. All rights reserved. 0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 0N/A * This code is free software; you can redistribute it and/or modify it 0N/A * under the terms of the GNU General Public License version 2 only, as 2362N/A * published by the Free Software Foundation. Oracle designates this 0N/A * particular file as subject to the "Classpath" exception as provided 2362N/A * by Oracle in the LICENSE file that accompanied this code. 0N/A * This code is distributed in the hope that it will be useful, but WITHOUT 0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 0N/A * version 2 for more details (a copy is included in the LICENSE file that 0N/A * accompanied this code). 0N/A * You should have received a copy of the GNU General Public License version 0N/A * 2 along with this work; if not, write to the Free Software Foundation, 0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 2362N/A * or visit www.oracle.com if you need additional information or have any 0N/A // assert(y0 != y1); /* No horizontal lines... */ 0N/A * If "this" is curve A and "other" is curve B, then... 0N/A * xA(y) = x0A + (y - y0A) (x1A - x0A) / (y1A - y0A) 0N/A * xB(y) = x0B + (y - y0B) (x1B - x0B) / (y1B - y0B) 0N/A * x0A + (y - y0A) (x1A - x0A) / (y1A - y0A) 0N/A * == x0B + (y - y0B) (x1B - x0B) / (y1B - y0B) 0N/A * 0 == x0A (y1A - y0A) (y1B - y0B) + (y - y0A) (x1A - x0A) (y1B - y0B) 0N/A * - x0B (y1A - y0A) (y1B - y0B) - (y - y0B) (x1B - x0B) (y1A - y0A) 0N/A * 0 == (x0A - x0B) (y1A - y0A) (y1B - y0B) 0N/A * + (y - y0A) (x1A - x0A) (y1B - y0B) 0N/A * - (y - y0B) (x1B - x0B) (y1A - y0A) 0N/A * If (dxA == x1A - x0A), etc... 0N/A * 0 == (x0A - x0B) * dyA * dyB 0N/A * + (y - y0A) * dxA * dyB 0N/A * - (y - y0B) * dxB * dyA 0N/A * 0 == (x0A - x0B) * dyA * dyB 0N/A * + y * dxA * dyB - y0A * dxA * dyB 0N/A * - y * dxB * dyA + y0B * dxB * dyA 0N/A * 0 == (x0A - x0B) * dyA * dyB 0N/A * + y * dxA * dyB - y * dxB * dyA 0N/A * - y0A * dxA * dyB + y0B * dxB * dyA 0N/A * 0 == (x0A - x0B) * dyA * dyB 0N/A * + y * (dxA * dyB - dxB * dyA) 0N/A * - y0A * dxA * dyB + y0B * dxB * dyA 0N/A * y == ((x0A - x0B) * dyA * dyB 0N/A * - y0A * dxA * dyB + y0B * dxB * dyA) 0N/A * / (-(dxA * dyB - dxB * dyA)) 0N/A * y == ((x0A - x0B) * dyA * dyB 0N/A * - y0A * dxA * dyB + y0B * dxB * dyA) 0N/A * / (dxB * dyA - dxA * dyB) 0N/A // intersection is above us 0N/A // Use bottom-most common y for comparison 0N/A // intersection is below the top of our range 0N/A // If intersection is in our range, adjust valid range 0N/A // Use top-most common y for comparison 0N/A // lines are parallel, choose any common y for comparison 0N/A // Note - prefer an endpoint for speed of calculating the X 0N/A // (see shortcuts in Order1.XforY())