Module flo_curves::bezier

Routines for describing, querying and manipulating Bezier curves

let curve           = Curve::from_points(Coord2(1.0, 2.0), (Coord2(2.0, 0.0), Coord2(3.0, 5.0)), Coord2(4.0, 2.0));

let mid_point       = curve.point_at_pos(0.5);
let all_points      = walk_curve_evenly(&curve, 1.0, 0.01).map(|section| section.point_at_pos(0.5)).collect::<Vec<_>>();
let fitted_curve    = fit_curve::<Curve<Coord2>>(&all_points, 0.1);
let intersections   = curve_intersects_ray(&curve, &(Coord2(1.0, 1.0), Coord2(2.0, 2.0)));
let offset_curve    = offset(&curve, 2.0, 2.0);

Anything that implements the BezierCurve trait can be manipulated by the functions in this crate. The Curve type is provided as a basic implementation for defining bezier curves, but the trait can be defined on any type that represents a bezier curve.

The BezierCurveFactory trait extends the BezierCurve trait for use with functions that can build/return new curves.

For routines that deal with paths made up of bezier curves, see the path namespace.

Re-exports

• pub use super::geo::*;

Modules

• path
  Manipulates multiple Bezier curves joined into a path

Structs

• Curve
  Represents a Bezier curve
• CurveSection
  Represents a subsection of a bezier curve
• EvenWalkIterator
  Iterator implementation that performs an even walk along a curve
• Tangent
  A structure that can be used to compute the tangent of a bezier curve

Enums

• CurveCategory
  Possible types of a two-dimensional cubic bezier curve
• CurveFeatures
  Describes the features of a two-dimensional cubic bezier curve

Traits

• BezierCurve
  Trait implemented by things representing a cubic bezier curve
• BezierCurve2D
  Functions supported on 2D bezier curves
• BezierCurveFactory
  Trait implemented by bezier curves that can create new versions of themselves
• NormalCurve
  Trait implemented by bezier curves where we can compute the normal
• Normalize
  Changes a point and its tangent into a normal

Functions

• basis
  The cubic bezier weighted basis function
• bezier_coefficients
  Computes the bezier coefficients (A, B, C, D) for a bezier curve
• bounding_box4
  Finds the upper and lower points in a cubic curve’s bounding box
• characterize_cubic_bezier
  Determines the characteristics of a particular bezier curve: whether or not it is an arch, or changes directions (has inflection points), or self-intersects (has a loop)
• characterize_curve
  Discovers the ‘character’ of a particular bezier curve, returning a value indicating what kinds of features it has (for example, whether it has a loop or a cusp)
• chord_length
  Returns the length of the chord of a bezier curve
• control_polygon_length
  Returns the length of the control polygon for a bezier curve
• curve_intersects_curve_clip
  Determines the points at which two curves intersect using the Bezier clipping algorihtm
• curve_intersects_line
  Find the t values where a curve intersects a line
• curve_intersects_ray
  Find the t values where a curve intersects a ray
• curve_length
  Estimates the length of a bezier curve within a particular error tolerance
• de_casteljau2
  de Casteljau’s algorithm for lines
• de_casteljau3
  de Casteljau’s algorithm for quadratic bezier curves
• de_casteljau4
  de Casteljau’s algorithm for cubic bezier curves
• derivative2
  Returns the 3rd derivative of a cubic bezier curve (2nd of a quadratic)
• derivative3
  Returns the 1st derivative of a quadratic bezier curve (or the 2nd derivative of a cubic curve)
• derivative4
  Returns the 1st derivative of a cubic bezier curve
• distort_curve
  Distorts a curve using an arbitrary function
• distort_path
  Distorts a path using an arbitrary function
• features_for_cubic_bezier
  Determines the characteristics of a paritcular bezier curve: whether or not it is an arch, or changes directions (has inflection points), or self-intersects (has a loop)
• features_for_curve
  Discovers what kind of features a curve has and where they are located
• find_extremities
  Finds the t values of the extremities of a curve (these are the points at which the x or y value is at a minimum or maximum)
• find_self_intersection_point
  If a cubic curve contains a loop, finds the t values where the curve self-intersects
• fit_curve
  Creates a bezier curve that fits a set of points with a particular error
• fit_curve_cubic
  Fits a bezier curve to a subset of points
• move_point
  Moves the point at ‘t’ on the curve by the offset vector
• nearest_point_on_curve
  Finds the ‘t’ value of the closest point on a curve to the supplied point
• nearest_point_on_curve_newton_raphson
  Optimises an estimate of a nearest point on a bezier curve using the newton-raphson method
• nearest_point_on_curve_newton_raphson_with_estimate
  Optimises an estimate of a nearest point on a bezier curve using the newton-raphson method
• offset
  Computes a series of curves that approximate an offset curve from the specified origin curve.
• offset_lms_sampling
  Produces an offset curve by performing a least-mean-square curve fit against the output of a function
• offset_scaling
  Computes a series of curves that approximate an offset curve from the specified origin curve.
• overlapping_region
  If curve2 overlaps curve1, returns two sets of t values (those for curve1 and those for curve2)
• search_bounds4
  Performs a subdivision search on a curve for a point matching a function
• solve_basis_for_t
  Solves for t in a single dimension for a bezier curve (finds the point(s) where the basis function evaluates to p)
• solve_curve_for_t_along_axis
  Searches along the x or y axis for a point within accuracy units of the curve, returning the t value of that point
• subdivide4
  Subdivides a cubic bezier curve at a particular point, returning the weights of the two component curves
• walk_curve_evenly
  Walks a bezier curve by moving forward a set amount at each point. Each point may be up to max_error away from distance.
• walk_curve_unevenly
  Walks a bezier curve by dividing it into a number of sections