Struct vtkBezierTriangle 

pub struct vtkBezierTriangle(/* private fields */);

A 2D cell that represents an arbitrary order Bezier triangle

vtkBezierTriangle is a concrete implementation of vtkCell to represent a 2D triangle using Bezier shape functions of user specified order.

The number of points in a Bezier cell determines the order over which they are iterated relative to the parametric coordinate system of the cell. The first points that are reported are vertices. They appear in the same order in which they would appear in linear cells. Mid-edge points are reported next. They are reported in sequence. For two- and three-dimensional (3D) cells, the following set of points to be reported are face points. Finally, 3D cells report points interior to their volume.

Implementations

impl vtkBezierTriangle

pub fn new() -> Self

Creates a new vtkBezierTriangle wrapped inside vtkNew

Trait Implementations

impl Default for vtkBezierTriangle

fn default() -> Self

Returns the “default value” for a type.

impl Drop for vtkBezierTriangle

fn drop(&mut self)

Executes the destructor for this type.