GNU Classpath (0.95) | |
Prev Class | Next Class | Frames | No Frames |
Summary: Nested | Field | Method | Constr | Detail: Nested | Field | Method | Constr |
java.lang.Object
java.awt.geom.CubicCurve2D
Nested Class Summary | |
static class |
|
static class |
|
Constructor Summary | |
|
Method Summary | |
Object |
|
boolean |
|
boolean |
|
boolean | |
boolean |
|
Rectangle |
|
abstract Point2D |
|
abstract Point2D |
|
abstract double |
|
abstract double |
|
abstract double |
|
abstract double |
|
double |
|
static double |
|
static double |
|
double |
|
static double |
|
static double |
|
abstract Point2D |
|
abstract Point2D |
|
PathIterator | |
PathIterator |
|
abstract double |
|
abstract double |
|
abstract double |
|
abstract double |
|
boolean |
|
boolean |
|
abstract void |
|
void |
|
void |
|
void | |
void | |
static int |
|
static int |
|
static void |
|
void |
|
static void |
|
Methods inherited from class java.lang.Object | |
clone , equals , extends Object> getClass , finalize , hashCode , notify , notifyAll , toString , wait , wait , wait |
protected CubicCurve2D()
Constructs a new CubicCurve2D. Typical users will want to construct instances of a subclass, such asCubicCurve2D.Float
orCubicCurve2D.Double
.
public Object clone()
Create a new curve with the same contents as this one.
- Returns:
- the clone.
public boolean contains(double x, double y)
Determines whether a position lies inside the area bounded by the curve and the straight line connecting its end points. The above drawing illustrates in which area points are considered “inside” a CubicCurve2D.
public boolean contains(double x, double y, double w, double h)
Determine whether a rectangle is entirely inside the area that is bounded by the curve and the straight line connecting its end points. The above drawing illustrates in which area points are considered “inside” a CubicCurve2D.
- See Also:
contains(double,double)
public boolean contains(Point2D p)
Determines whether a point lies inside the area bounded by the curve and the straight line connecting its end points. The above drawing illustrates in which area points are considered “inside” a CubicCurve2D.
public boolean contains(Rectangle2D r)
Determine whether a Rectangle2D is entirely inside the area that is bounded by the curve and the straight line connecting its end points. The above drawing illustrates in which area points are considered “inside” a CubicCurve2D.
- See Also:
contains(double,double)
public Rectangle getBounds()
Determines the smallest rectangle that encloses the curve’s start, end and control points.
public abstract double getCtrlX1()
Returns the x coordinate of the curve’s first control point.
public abstract double getCtrlX2()
Returns the x coordinate of the curve’s second control point.
public abstract double getCtrlY1()
Returns the y coordinate of the curve’s first control point.
public abstract double getCtrlY2()
Returns the y coordinate of the curve’s second control point.
public double getFlatness()
Calculates the flatness of this curve. The flatness is the maximal distance of a control point to the line between start and end point. In the above drawing, the straight line connecting start point P1 and end point P2 is depicted in gray. In comparison to C1, control point C2 is father away from the gray line. Therefore, the result will be the distance between C2 and the gray line, i.e. the length of the red line.
public static double getFlatness(double x1, double y1, double cx1, double cy1, double cx2, double cy2, double x2, double y2)
Calculates the flatness of a cubic curve, directly specifying each coordinate value. The flatness is the maximal distance of a control point to the line between start and end point. In the above drawing, the straight line connecting start point P1 and end point P2 is depicted in gray. In comparison to C1, control point C2 is father away from the gray line. Therefore, the result will be the distance between C2 and the gray line, i.e. the length of the red line.
- Parameters:
x1
- the x coordinate of the start point P1.y1
- the y coordinate of the start point P1.cx1
- the x coordinate of the first control point C1.cy1
- the y coordinate of the first control point C1.cx2
- the x coordinate of the second control point C2.cy2
- the y coordinate of the second control point C2.x2
- the x coordinate of the end point P2.y2
- the y coordinate of the end point P2.
public static double getFlatness(double[] coords, int offset)
Calculates the flatness of a cubic curve, specifying the coordinate values in an array. The flatness is the maximal distance of a control point to the line between start and end point. In the above drawing, the straight line connecting start point P1 and end point P2 is depicted in gray. In comparison to C1, control point C2 is father away from the gray line. Therefore, the result will be the distance between C2 and the gray line, i.e. the length of the red line.
- Parameters:
coords
- an array containing the coordinate values. The x coordinate of the start point P1 is located atcoords[offset]
, its y coordinate atcoords[offset + 1]
. The x coordinate of the first control point C1 is located atcoords[offset + 2]
, its y coordinate atcoords[offset + 3]
. The x coordinate of the second control point C2 is located atcoords[offset + 4]
, its y coordinate atcoords[offset + 5]
. The x coordinate of the end point P2 is located atcoords[offset + 6]
, its y coordinate atcoords[offset + 7]
.offset
- the offset of the first coordinate value incoords
.
public double getFlatnessSq()
Calculates the squared flatness of this curve. The flatness is the maximal distance of a control point to the line between start and end point. In the above drawing, the straight line connecting start point P1 and end point P2 is depicted in gray. In comparison to C1, control point C2 is father away from the gray line. Therefore, the result will be the square of the distance between C2 and the gray line, i.e. the squared length of the red line.
public static double getFlatnessSq(double x1, double y1, double cx1, double cy1, double cx2, double cy2, double x2, double y2)
Calculates the squared flatness of a cubic curve, directly specifying each coordinate value. The flatness is the maximal distance of a control point to the line between start and end point. In the above drawing, the straight line connecting start point P1 and end point P2 is depicted in gray. In comparison to C1, control point C2 is father away from the gray line. Therefore, the result will be the square of the distance between C2 and the gray line, i.e. the squared length of the red line.
- Parameters:
x1
- the x coordinate of the start point P1.y1
- the y coordinate of the start point P1.cx1
- the x coordinate of the first control point C1.cy1
- the y coordinate of the first control point C1.cx2
- the x coordinate of the second control point C2.cy2
- the y coordinate of the second control point C2.x2
- the x coordinate of the end point P2.y2
- the y coordinate of the end point P2.
public static double getFlatnessSq(double[] coords, int offset)
Calculates the squared flatness of a cubic curve, specifying the coordinate values in an array. The flatness is the maximal distance of a control point to the line between start and end point. In the above drawing, the straight line connecting start point P1 and end point P2 is depicted in gray. In comparison to C1, control point C2 is father away from the gray line. Therefore, the result will be the square of the distance between C2 and the gray line, i.e. the squared length of the red line.
- Parameters:
coords
- an array containing the coordinate values. The x coordinate of the start point P1 is located atcoords[offset]
, its y coordinate atcoords[offset + 1]
. The x coordinate of the first control point C1 is located atcoords[offset + 2]
, its y coordinate atcoords[offset + 3]
. The x coordinate of the second control point C2 is located atcoords[offset + 4]
, its y coordinate atcoords[offset + 5]
. The x coordinate of the end point P2 is located atcoords[offset + 6]
, its y coordinate atcoords[offset + 7]
.offset
- the offset of the first coordinate value incoords
.
public PathIterator getPathIterator(AffineTransform at)
- Specified by:
- getPathIterator in interface Shape
public PathIterator getPathIterator(AffineTransform at, double flatness)
- Specified by:
- getPathIterator in interface Shape
public boolean intersects(double x, double y, double w, double h)
Determines whether any part of a rectangle is inside the area bounded by the curve and the straight line connecting its end points. The above drawing illustrates in which area points are considered “inside” in a CubicCurve2D.
- Specified by:
- intersects in interface Shape
- See Also:
contains(double,double)
public boolean intersects(Rectangle2D r)
Determines whether any part of a Rectangle2D is inside the area bounded by the curve and the straight line connecting its end points.
- Specified by:
- intersects in interface Shape
public abstract void setCurve(double x1, double y1, double cx1, double cy1, double cx2, double cy2, double x2, double y2)
Changes the curve geometry, separately specifying each coordinate value.
- Parameters:
x1
- the x coordinate of the curve’s new start point.y1
- the y coordinate of the curve’s new start point.cx1
- the x coordinate of the curve’s new first control point.cy1
- the y coordinate of the curve’s new first control point.cx2
- the x coordinate of the curve’s new second control point.cy2
- the y coordinate of the curve’s new second control point.x2
- the x coordinate of the curve’s new end point.y2
- the y coordinate of the curve’s new end point.
public void setCurve(double[] coords, int offset)
Changes the curve geometry, specifying coordinate values in an array.
- Parameters:
coords
- an array containing the new coordinate values. The x coordinate of the new start point is located atcoords[offset]
, its y coordinate atcoords[offset + 1]
. The x coordinate of the new first control point is located atcoords[offset + 2]
, its y coordinate atcoords[offset + 3]
. The x coordinate of the new second control point is located atcoords[offset + 4]
, its y coordinate atcoords[offset + 5]
. The x coordinate of the new end point is located atcoords[offset + 6]
, its y coordinate atcoords[offset + 7]
.offset
- the offset of the first coordinate value incoords
.
public void setCurve(CubicCurve2D c)
Changes the curve geometry to that of another curve.
- Parameters:
c
- the curve whose coordinates will be copied.
public void setCurve(Point2D p1, Point2D c1, Point2D c2, Point2D p2)
Changes the curve geometry, specifying coordinate values in separate Point objects. The curve does not keep any reference to the passed point objects. Therefore, a later change top1
,c1
,c2
orp2
will not affect the curve geometry.
- Parameters:
p1
- the new start point.c1
- the new first control point.c2
- the new second control point.p2
- the new end point.
public void setCurve(Point2D[] pts, int offset)
Changes the curve geometry, specifying coordinate values in an array of Point objects. The curve does not keep references to the passed point objects. Therefore, a later change to thepts
array or any of its elements will not affect the curve geometry.
- Parameters:
pts
- an array containing the points. The new start point is located atpts[offset]
, the new first control point atpts[offset + 1]
, the new second control point atpts[offset + 2]
, and the new end point atpts[offset + 3]
.offset
- the offset of the start point inpts
.
public static int solveCubic(double[] eqn)
Finds the non-complex roots of a cubic equation, placing the results into the same array as the equation coefficients. The following equation is being solved:For some background about solving cubic equations, see the article “Cubic Formula” in PlanetMath. For an extensive library of numerical algorithms written in the C programming language, see the GNU Scientific Library, from which this implementation was adapted.eqn[3]
· x3 +eqn[2]
· x2 +eqn[1]
· x +eqn[0]
= 0
- Parameters:
eqn
- an array with the coefficients of the equation. When this procedure has returned,eqn
will contain the non-complex solutions of the equation, in no particular order.
- Returns:
- the number of non-complex solutions. A result of 0 indicates that the equation has no non-complex solutions. A result of -1 indicates that the equation is constant (i.e., always or never zero).
public static int solveCubic(double[] eqn, double[] res)
Finds the non-complex roots of a cubic equation. The following equation is being solved:For some background about solving cubic equations, see the article “Cubic Formula” in PlanetMath. For an extensive library of numerical algorithms written in the C programming language, see the GNU Scientific Library, from which this implementation was adapted.eqn[3]
· x3 +eqn[2]
· x2 +eqn[1]
· x +eqn[0]
= 0
- Parameters:
eqn
- an array with the coefficients of the equation.res
- an array into which the non-complex roots will be stored. The results may be in an arbitrary order. It is safe to pass the same array object reference for botheqn
andres
.
- Returns:
- the number of non-complex solutions. A result of 0 indicates that the equation has no non-complex solutions. A result of -1 indicates that the equation is constant (i.e., always or never zero).
public static void subdivide(double[] src, int srcOff, double[] left, int leftOff, double[] right, int rightOff)
Subdivides a cubic curve into two halves, passing all coordinates in an array. The left end point and the right start point will always be identical. Memory-concious programmers thus may want to pass the same array for bothleft
andright
, and setrightOff
toleftOff + 6
.
- Parameters:
src
- an array containing the coordinates of the curve to be subdivided. The x coordinate of the start point P1 is located atsrc[srcOff]
, its y atsrc[srcOff + 1]
. The x coordinate of the first control point C1 is located atsrc[srcOff + 2]
, its y atsrc[srcOff + 3]
. The x coordinate of the second control point C2 is located atsrc[srcOff + 4]
, its y atsrc[srcOff + 5]
. The x coordinate of the end point is located atsrc[srcOff + 6]
, its y atsrc[srcOff + 7]
.srcOff
- an offset intosrc
, specifying the index of the start point’s x coordinate.left
- an array that will receive the coordinates of the left half ofsrc
. It is acceptable to passsrc
. A caller who is not interested in the left half can passnull
.leftOff
- an offset intoleft
, specifying the index where the start point’s x coordinate will be stored.right
- an array that will receive the coordinates of the right half ofsrc
. It is acceptable to passsrc
orleft
. A caller who is not interested in the right half can passnull
.rightOff
- an offset intoright
, specifying the index where the start point’s x coordinate will be stored.
public void subdivide(CubicCurve2D left, CubicCurve2D right)
Subdivides this curve into two halves.
- Parameters:
left
- a curve whose geometry will be set to the left half of this curve, ornull
if the caller is not interested in the left half.right
- a curve whose geometry will be set to the right half of this curve, ornull
if the caller is not interested in the right half.
public static void subdivide(CubicCurve2D src, CubicCurve2D left, CubicCurve2D right)
Subdivides a cubic curve into two halves.
- Parameters:
src
- the curve to be subdivided.left
- a curve whose geometry will be set to the left half ofsrc
, ornull
if the caller is not interested in the left half.right
- a curve whose geometry will be set to the right half ofsrc
, ornull
if the caller is not interested in the right half.
GNU Classpath (0.95) |