Package com.graphbuilder.curve
package com.graphbuilder.curve
-
ClassDescriptionGeneral n-point Bezier curve implementation.The binary curve approximation algorithm is an algorithm designed to approximate a ParametricCurve using as few points as possible but keeping the overall visual appearance of the curve smooth.General non-rational B-Spline implementation where the degree can be specified.The Cardinal-spline passes through the points in the control-path specified by the group-iterator.The CatmullRomSpline is equal to the CardinalSpline with the value of alpha fixed at 0.5.A ControlPath is a container of Point objects and Curve objects.Exception thrown if the parsing of a control-string fails.The cubic B-spline is defined by third order polynomial basis functions.A Curve is an object that defines itself using mathematical equations and points of a control-path in a given dimension.A GroupIterator allows a curve to choose the points from a control-path that the curve uses to define itself.The Lagrange curve passes through the control-points specified by the group-iterator.A multi-path is a series of paths (sequence of connected points) in n-dimensions.The natural-cubic-spline is constructed using piecewise third order polynomials which pass through all the control-points specified by the group-iterator.General implementation of the Non-Uniform Rational B-spline or NURB-Spline.Curves that extend the ParametricCurve class are continuous and can use the BinaryCurveApproximationAlgorithm class to generate a sequence of points that approximate the curve.A representation of an n-dimensional point.A polyline is a sequence of connected line segments based on the control-path points specified by the group-iterator.The ShapeMultiPath is-a MultiPath and implements the java.awt.Shape interface.A value-vector is a sequence of values that some curves use to define themselves, sometimes called a knot-vector or a weight-vector.Listener interface to listen for changes in a ValueVector.