Struct TransBilinear 

pub struct TransBilinear { /* private fields */ }

Bilinear 2D transformation.

Solves for a 4x2 coefficient matrix that maps points between two quadrilaterals using bilinear interpolation:

x' = m[0][0] + m[1][0]*x*y + m[2][0]*x + m[3][0]*y
y' = m[0][1] + m[1][1]*x*y + m[2][1]*x + m[3][1]*y

Port of C++ trans_bilinear.

Implementations

impl TransBilinear

pub fn new() -> Self

Create an invalid (uninitialized) transform.

pub fn new_quad_to_quad(src: &[f64; 8], dst: &[f64; 8]) -> Self

Create from arbitrary quadrilateral to quadrilateral mapping.

pub fn new_rect_to_quad( x1: f64, y1: f64, x2: f64, y2: f64, quad: &[f64; 8], ) -> Self

Create a rectangle → quadrilateral mapping.

pub fn new_quad_to_rect( quad: &[f64; 8], x1: f64, y1: f64, x2: f64, y2: f64, ) -> Self

Create a quadrilateral → rectangle mapping.

pub fn quad_to_quad(&mut self, src: &[f64; 8], dst: &[f64; 8])

Set the transformation from two arbitrary quadrilaterals.

Solves a 4×2 system via Gaussian elimination.

pub fn rect_to_quad( &mut self, x1: f64, y1: f64, x2: f64, y2: f64, quad: &[f64; 8], )

Set the direct transformation: rectangle → quadrilateral.

pub fn quad_to_rect( &mut self, quad: &[f64; 8], x1: f64, y1: f64, x2: f64, y2: f64, )

Set the reverse transformation: quadrilateral → rectangle.

pub fn is_valid(&self) -> bool

Check if the equations were solved successfully.

pub fn transform(&self, x: &mut f64, y: &mut f64)

Transform a point (x, y).

pub fn begin(&self, x: f64, y: f64, step: f64) -> IteratorX

Create an incremental iterator for scanline walking.

Trait Implementations

impl Default for TransBilinear

fn default() -> Self

Returns the “default value” for a type.

impl Transformer for TransBilinear

fn transform(&self, x: &mut f64, y: &mut f64)