bezier_kit library
Classes
- AffineTransform
- AnalyticalRoots
-
BernsteinPolynomial<
NextLowerOrderPolynomial> - BernsteinPolynomial0
- BernsteinPolynomial1
- BernsteinPolynomial2
- BernsteinPolynomial3
- BernsteinPolynomial4
- BernsteinPolynomial5
- BernsteinPolynomialN
- BezierCurve
- BoundingBox
- BoundingBoxHierarchy
- a strict (complete and full) binary tree representing a hierarchy of bounding boxes for a list of path elements
- BoundingBoxHierarchyNode
- BoundingBoxHierarchyNodeType
- BoundingBoxHierarchyNodeTypeInternal
- BoundingBoxHierarchyNodeTypeLeaf
- BoundingBoxProtocol
- CubicCurve
- Cubic Bézier Curve
- CubicCurveBase
- Implicitizeable
- ImplicitizeableBezierCurve
- ImplicitPolynomial
- represents an implicit polynomial, otherwise known as an algebraic curve. The values on the polynomial are the zero set of the polynomial f(x, y) = 0
- IndexedPathComponentLocation
- IndexedPathLocation
- Intersection
- Interval
- LineSegment
- LineSegmentBase
- MutablePath
- NonlinearBezierCurve
- Path
- PathBase
- PathComponent
- PathComponentIntersection
- PathComponentRange
- PathIntersection
- Point
- QuadraticCurve
- QuadraticCurveBase
- Reversible
- RootFindingConfiguration
- Shape
- ShapeCap
- ShapeIntersection
- Transformable
Enums
Mixins
Extensions
- BernsteinPolynomialNExtension on BernsteinPolynomialN
- BezierCurveDowngradedExtension on NonlinearBezierCurve
- BezierCurveExtension on BezierCurve
- PathComponentProjectionExtension on PathComponent
- PathProjectionExtension on Path
- PathVectorBooleanExtension on Path
-
RectangeInsetByExtension
on Rectangle<
T>
Constants
- defaultIntersectionAccuracy → const double
- reduceStepSize → const double
- tinyValue → const double
Functions
-
distance(
Point p1, Point p2) → double -
distanceSquared(
Point p1, Point p2) → double -
findDistinctRoots<
P extends BernsteinPolynomial> ({required P of, required double between, required double and}) → List< double> -
findDistinctRootsInUnitInterval<
P extends BernsteinPolynomial> ({required P of}) → List< double> -
helperIntersectsCurveCurve<
U extends NonlinearBezierCurve, T extends NonlinearBezierCurve> (Subcurve< U> curve1, Subcurve<T> curve2, {required double accuracy}) → List<Intersection> -
helperIntersectsCurveLine<
U extends NonlinearBezierCurve> (U curve, LineSegment line, {bool reversed = false}) → List< Intersection> -
roundUpPowerOfTwo(
int value) → int - returns the power of two greater than or equal to a given value