com.graphbuilder.geom.Geom Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of org.apache.servicemix.bundles.poi
Show all versions of org.apache.servicemix.bundles.poi
This OSGi bundle wraps poi, poi-ooxml, and poi-scratchpad ${pkgVersion} jar files.
/*
* Copyright (c) 2005, Graph Builder
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* * Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* * Neither the name of Graph Builder nor the names of its contributors may be
* used to endorse or promote products derived from this software without
* specific prior written permission.
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package com.graphbuilder.geom;
/**
Geom contains static methods for calculating intersections, angles, areas and distances.
*/
public final class Geom {
public static final Object PARALLEL = new Object();
public static final Object INTERSECT = new Object();
private Geom() {}
/**
The getAngle method returns the angle between (x, y) and (originX, originY).
The value returned will be in the range [0.0 : 2 * Math.PI). If the point x, y
overlaps the origin then 0.0 is returned. If the point has a positive x and zero y
then the value returned is 0.0. If the point has a negative x and zero y then the
value returned is Math.PI. If the point has a zero x and positive y then the value
returned is Math.PI / 2. If the point has a zero x and negative y then the value
returned is 3 * Math.PI / 2.
*/
public static double getAngle(double originX, double originY, double x, double y) {
double adj = x - originX;
double opp = y - originY;
double rad = 0.0;
if (adj == 0) {
if (opp == 0) return 0.0;
else rad = Math.PI / 2;
}
else {
rad = Math.atan(opp / adj);
if (rad < 0) rad = -rad;
}
if (x >= originX) {
if (y < originY) rad = 2 * Math.PI - rad;
}
else {
if (y < originY) rad = Math.PI + rad;
else rad = Math.PI - rad;
}
return rad;
}
/**
Returns the angle between the origin and the specified point.
@see #getAngle(double,double,double,double)
*/
public static double getAngle(Point2d origin, Point2d p) {
return getAngle(origin.getX(), origin.getY(), p.getX(), p.getY());
}
/**
The ptLineDistSq method returns the distance between the line formed by (x1, y1), (x2, y2) and
the point (x, y). An array of length >= 3 can be passed in to obtain additional information.
If the array is not null, then the closest point on the line to the given point is stored in
index locations 0 and 1. The parametric value is stored in index location 2.
*/
public static double ptLineDistSq(double x1, double y1, double x2, double y2, double x, double y, double[] result) {
double run = x2 - x1;
double rise = y2 - y1;
double t = 0.0;
double f = run * run + rise * rise;
if (f != 0)
t = (run * (x - x1) + rise * (y - y1)) / f;
double nx = x1 + t * run;
double ny = y1 + t * rise;
if (result != null) {
result[0] = nx;
result[1] = ny;
result[2] = t;
}
double dx = x - nx;
double dy = y - ny;
return dx * dx + dy * dy;
}
/**
The ptSegDistSq method returns the distance between the line segment formed by (x1, y1), (x2, y2) and
the point (x, y). An array of length >= 3 can be passed in to obtain additional information. If the
array is not null, then the closest point on the line segment to the given point is stored in index
locations 0 and 1. The parametric value is stored in index location 2 and its value is >= 0 && <= 1.
*/
public static double ptSegDistSq(double x1, double y1, double x2, double y2, double x, double y, double[] result) {
double run = x2 - x1;
double rise = y2 - y1;
double t = 0.0;
double f = run * run + rise * rise;
if (f != 0)
t = (run * (x - x1) + rise * (y - y1)) / f;
if (t < 0) t = 0.0;
else if (t > 1) t = 1.0;
double nx = x1 + t * run;
double ny = y1 + t * rise;
if (result != null) {
result[0] = nx;
result[1] = ny;
result[2] = t;
}
double dx = x - nx;
double dy = y - ny;
return dx * dx + dy * dy;
}
/**
Computes the distance between a line (a, b) and a point (c) in n-dimensions. Arrays a, b, and c must
have length greater or equal to n. Array d must have length greater than n. The location of the closest
point on the line is stored in d. The parametric value is stored at index location n in d.
*/
public static double ptLineDistSq(double[] a, double[] b, double[] c, double[] d, int n) {
for (int i = 0; i < n; i++)
d[i] = b[i] - a[i];
double f = 0;
for (int i = 0; i < n; i++)
f = f + d[i] * d[i];
double t = 0.0;
if (f != 0) {
double g = 0;
for (int i = 0; i < n; i++)
g = g + d[i] * (c[i] - a[i]);
t = g / f;
}
for (int i = 0; i < n; i++)
d[i] = a[i] + t * d[i];
d[n] = t;
double distSq = 0;
for (int i = 0; i < n; i++) {
double h = c[i] - d[i];
distSq = distSq + h * h;
}
return distSq;
}
/**
Computes the distance between a line segment (a, b) and a point (c) in n-dimensions. Arrays a, b, and c must
have length greater or equal to n. Array d must have length greater than n. The location of the closest
point on the line is stored in d. The parametric value is stored at index location n in d, and its value is
in the range [0, 1].
*/
public static double ptSegDistSq(double[] a, double[] b, double[] c, double[] d, int n) {
for (int i = 0; i < n; i++)
d[i] = b[i] - a[i];
double f = 0;
for (int i = 0; i < n; i++)
f = f + d[i] * d[i];
double t = 0.0;
if (f != 0) {
double g = 0;
for (int i = 0; i < n; i++)
g = g + d[i] * (c[i] - a[i]);
t = g / f;
}
if (t < 0.0) t = 0.0;
else if (t > 1.0) t = 1.0;
for (int i = 0; i < n; i++)
d[i] = a[i] + t * d[i];
d[n] = t;
double distSq = 0;
for (int i = 0; i < n; i++) {
double h = c[i] - d[i];
distSq = distSq + h * h;
}
return distSq;
}
/**
Calculates the intersection location of the two lines formed by (x1, y1), (x2, y2) and (x3, y3), (x4, y4).
If the lines are determined to be parallel, then Geom.PARALLEL is returned and no further computations
are done. If the lines are not parallel, then the intersection location is stored in index locations 0 and 1
of the specified array. The parametric value is stored in index location 2. If there is an intersection then
the returned value is Geom.INTERSECT.
*/
public static Object getLineLineIntersection(double x1, double y1, double x2, double y2, double x3, double y3, double x4, double y4, double[] result) {
double bx = x2 - x1;
double by = y2 - y1;
double dx = x4 - x3;
double dy = y4 - y3;
double b_dot_d_perp = bx * dy - by * dx;
if (b_dot_d_perp == 0)
return PARALLEL;
double cx = x3 - x1;
double cy = y3 - y1;
double t = (cx * dy - cy * dx) / b_dot_d_perp;
if (result != null) {
result[0] = x1 + t * bx;
result[1] = y1 + t * by;
result[2] = t;
}
return INTERSECT;
}
/**
Calculates the intersection location of the line formed by (x1, y1), (x2, y2) and the line segment formed
by (x3, y3), (x4, y4). If the line and line segment are determined to be parallel, then Geom.PARALLEL is
returned and no further computations are done. If the line segment does not cross the line, then null is
returned and no further computations are done. Otherwise the intersection location is stored in index
locations 0 and 1 of the specified array. The parametric value with respect to the line segment is stored
in index location 2. If there in an intersection then the returned value is Geom.INTERSECT.
*/
public static Object getLineSegIntersection(double x1, double y1, double x2, double y2, double x3, double y3, double x4, double y4, double[] result) {
double bx = x2 - x1;
double by = y2 - y1;
double dx = x4 - x3;
double dy = y4 - y3;
double b_dot_d_perp = bx * dy - by * dx;
if (b_dot_d_perp == 0)
return PARALLEL;
double cx = x3 - x1;
double cy = y3 - y1;
double u = (cx * by - cy * bx) / b_dot_d_perp;
if (u < 0 || u > 1) return null;
if (result != null) {
result[0] = x3 + u * dx;
result[1] = y3 + u * dy;
result[2] = u;
}
return INTERSECT;
}
/**
Calculates the intersection location of the line segments formed by (x1, y1), (x2, y2) and (x3, y3), (x4, y4).
If the line segments are determined to be parallel, then Geom.PARALLEL is returned and no further computations
are done. If the segments do not cross each other then null is returned and no further computations are done.
Otherwise the intersection location is stored in index locations 0 and 1 of the specified array. The parametric
value with respect to the first line segment is stored in index location 2. If there is an intersection, then
the returned value is Geom.INTERSECT.
*/
public static Object getSegSegIntersection(double x1, double y1, double x2, double y2, double x3, double y3, double x4, double y4, double[] result) {
double bx = x2 - x1;
double by = y2 - y1;
double dx = x4 - x3;
double dy = y4 - y3;
double b_dot_d_perp = bx * dy - by * dx;
if (b_dot_d_perp == 0)
return PARALLEL;
double cx = x3 - x1;
double cy = y3 - y1;
double t = (cx * dy - cy * dx) / b_dot_d_perp;
if (t < 0 || t > 1) return null;
double u = (cx * by - cy * bx) / b_dot_d_perp;
if (u < 0 || u > 1) return null;
if (result != null) {
result[0] = x1 + t * bx;
result[1] = y1 + t * by;
result[2] = t;
}
return INTERSECT;
}
/**
Computes the circle formed by three points (x1, y1), (x2, y2) and (x3, y3). If the points are
collinear, then false is returned and no further computations are done. If the points are not
collinear, then the specified array is used to store the result. The center of the circle is
stored in index locations 0 and 1, and the radius squared is stored in index location 2. True
is returned if the points are not collinear.
*/
public static boolean getCircle(double x1, double y1, double x2, double y2, double x3, double y3, double[] result) {
double ax = x2 - x1; // first compute vectors
double ay = y2 - y1; // a and c
double cx = x1 - x3;
double cy = y1 - y3;
double aPerpDOTc = ax * cy - ay * cx;
if (aPerpDOTc == 0)
return false;
double bx = x3 - x2;
double by = y3 - y2;
double bDOTc = bx * cx + by * cy;
double qo = bDOTc / aPerpDOTc;
double sx = x1 + (ax - qo * ay) / 2; // found center of circle
double sy = y1 + (ay + qo * ax) / 2; // (sx, sy)
double dx = x1 - sx;
double dy = y1 - sy;
double rSquared = dx * dx + dy * dy; // radius of the circle squared
if (result != null) {
result[0] = sx;
result[1] = sy;
result[2] = rSquared;
}
return true;
}
/**
Returns the area^2 of the triangle formed by three points (x1, y1), (x2, y2) and (x3, y3).
*/
public static double getTriangleAreaSq(double x1, double y1, double x2, double y2, double x3, double y3) {
double ax = x1 - x2;
double ay = y1 - y2;
double bx = x2 - x3;
double by = y2 - y3;
double cx = x3 - x1;
double cy = y3 - y1;
double a = (ax * ax + ay * ay) / 2;
double b = (bx * bx + by * by) / 2;
double c = (cx * cx + cy * cy) / 2;
// the following two if statements increase the numerical stability in the
// case of "needle" triangles. 'a' is made to be the smallest number.
if (b < a) {
double t = a;
a = b;
b = t;
}
if (c < a) {
double t = a;
a = c;
c = t;
}
double d = (a + (b - c)) / 2;
return a * b - d * d;
}
/**
Returns the area^2 of the triangle formed by the 3 side-lengths 'a', 'b' and 'c'.
@throws IllegalArgumentException if the side-lengths are less than 0 or cannot form a triangle.
*/
public static double getTriangleAreaSq(double a, double b, double c) {
// implementation based on notes from: http://http.cs.berkeley.edu/~wkahan/Triangle.pdf
// 1. constraint checking is done
// 2. numbers are sorted such that a >= b >= c
// 3. stable equation is used to compute the area
if (a < 0)
throw new IllegalArgumentException("a >= 0 required");
if (b < 0)
throw new IllegalArgumentException("b >= 0 required");
if (c < 0)
throw new IllegalArgumentException("c >= 0 required");
if (a > b+c)
throw new IllegalArgumentException("a <= b + c required");
if (b > a+c)
throw new IllegalArgumentException("b <= a + c required");
if (c > a+b)
throw new IllegalArgumentException("c <= a + b required");
if (a < c) {
double t = c;
c = a;
a = t;
}
if (b < c) {
double t = c;
c = b;
b = t;
}
if (a < b) {
double t = b;
b = a;
a = t;
}
return (a+(b+c))*(c-(a-b))*(c+(a-b))*(a+(b-c)) / 16.0;
}
}