Struct rerun::external::eframe::egui::epaint::QuadraticBezierShape

pub struct QuadraticBezierShape {
    pub points: [Pos2; 3],
    pub closed: bool,
    pub fill: Color32,
    pub stroke: PathStroke,
}

A quadratic Bézier Curve.

See also CubicBezierShape.

Fields

points: [Pos2; 3]

The first point is the starting point and the last one is the ending point of the curve. The middle point is the control points.

closed: bool

fill: Color32

stroke: PathStroke

Implementations

impl QuadraticBezierShape

pub fn from_points_stroke( points: [Pos2; 3], closed: bool, fill: Color32, stroke: impl Into<PathStroke>, ) -> QuadraticBezierShape

Create a new quadratic Bézier shape based on the 3 points and stroke.

The first point is the starting point and the last one is the ending point of the curve. The middle point is the control points. The points should be in the order [start, control, end]

pub fn transform(&self, transform: &RectTransform) -> QuadraticBezierShape

Transform the curve with the given transform.

pub fn to_path_shape(&self, tolerance: Option<f32>) -> PathShape

Convert the quadratic Bézier curve to one PathShape. The tolerance will be used to control the max distance between the curve and the base line.

pub fn visual_bounding_rect(&self) -> Rect

The visual bounding rectangle (includes stroke width)

pub fn logical_bounding_rect(&self) -> Rect

Logical bounding rectangle (ignoring stroke width)

pub fn sample(&self, t: f32) -> Pos2

Calculate the point (x,y) at t based on the quadratic Bézier curve equation. t is in [0.0,1.0] Bézier Curve

pub fn flatten(&self, tolerance: Option<f32>) -> Vec<Pos2>

find a set of points that approximate the quadratic Bézier curve. the number of points is determined by the tolerance. the points may not be evenly distributed in the range [0.0,1.0] (t value)

pub fn for_each_flattened_with_t<F>(&self, tolerance: f32, callback: &mut F)

where F: FnMut(Pos2, f32),

Compute a flattened approximation of the curve, invoking a callback at each step.

The callback takes the point and corresponding curve parameter at each step.

This implements the algorithm described by Raph Levien at https://raphlinus.github.io/graphics/curves/2019/12/23/flatten-quadbez.html

Trait Implementations

impl Clone for QuadraticBezierShape

fn clone(&self) -> QuadraticBezierShape

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for QuadraticBezierShape

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for QuadraticBezierShape

fn deserialize<__D>( __deserializer: __D, ) -> Result<QuadraticBezierShape, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl From<QuadraticBezierShape> for Shape

fn from(shape: QuadraticBezierShape) -> Shape

Converts to this type from the input type.

impl PartialEq for QuadraticBezierShape

fn eq(&self, other: &QuadraticBezierShape) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for QuadraticBezierShape

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for QuadraticBezierShape