Package com.caffeineowl.graphics.bezier.flatnessalgos

Class Summary
ConvexHullFlatnessAlgo  
ConvexHullSubdivCriterion Will require the subdivision of a cubic or a quadratic curve any time the cubic's squared flatness (or the quad's ConvexHullFlatnessAlgo.getSquaredFlatness(QuadCurve2D) squared flatness}) is greater than a provided tolerance.
GenericCubicSubdivCriterion A CubicSubdivisionCriterion which does its job by using a provided CubicFlatnessAlgorithm and a tolerance: the criterion will ask for yet one subdivision whenever algorithm returns a flatness value that's greater than the required tolerance.
GenericQuadSubdivCriterion A QuadSubdivisionCriterion which does its job by using a provided QuadFlatnessAlgorithm and a tolerance: the criterion will ask for yet one subdivision whenever algorithm returns a flatness value that's greater than the required tolerance.
LineDefectFlatnessAlgo The algorithm computes the defected as the distance between the actual location control point(s) and the location of the control point(s) of a totally degenerated Bezier segment: for a quadratic Bezier, that's the mid point of the segment connecting the anchor points, for a totally degenerated cubic, the locations of the control points are at 1/3 and 2/3 positions of the segment that connects the anchor points.
LineDefectSubdivCriterion Will require the subdivision of a cubic or a quadratic curve any time the cubic's flatness (or the quad's flatness) is greater than a provided tolerance.
SimpleConvexHullFlatness Computes the flatness based on the maximum distance between any of the control points of a cubic Bezier (SimpleConvexHullFlatness.getFlatness(CubicCurve2D) or quadratic Bezier (SimpleConvexHullFlatness.getFlatness(QuadCurve2D) and the line defined by the anchor points of the Bezier curve.
SimpleConvexHullSubdivCriterion A sundivion criterion based on the flatness returned by the SimpleConvexHullFlatness.