Enum spade::kernels::FloatKernel

pub enum FloatKernel {}

Offers a fast, precise kernel working with f64 or f32 coordinates.

Performing a delaunay triangulation is often a tradeoff between accuracy and speed: a triangulation working on native floating point-operations will fail in some cases due to rounding errors, while switching to precise floats (like BigRationals from the num crate) reduces performance by several orders of magnitude. This kernel works with adaptive precision: if a calculation is inaccurate, it will increase its precision until the result is accurate enough. Since most calculations are accurate enough in their simplest form, only the overhead of checking the precision is usually encountered. For more information, refer to this link describing the techniques behind the adaptive approach.

Note

When used with f32 coordinates, they will be casted into f64 before the calculation starts. Thus, the performance is the same for both f64 and f32. Only the space requirements for storing the coordinates differ.

Trait Implementations

impl Clone for FloatKernel

fn clone(&self) -> FloatKernel

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<S> DelaunayKernel<S> for FloatKernelwhere
    S: FromPrimitive + SpadeFloat,

fn contained_in_circumference<V: TwoDimensional<Scalar = S>>(
    v1: &V,
    v2: &V,
    v3: &V,
    p: &V
) -> bool

Returns true if pd is contained in the circumference of the triangle spanned by pa, pb, pc.

fn side_query<V: TwoDimensional<Scalar = S>>(
    edge: &SimpleEdge<V>,
    position: &V
) -> EdgeSideInfo<S>

Returns an EdgeSideInfo yielding on which side of a line a point lies.

fn is_ordered_ccw<V: TwoDimensional<Scalar = D>>(v0: &V, v1: &V, v2: &V) -> bool

Another formulation of side_query, will return true if v0, v1 and v2 are ordered counterclockwise.

fn point_on_edge<V: TwoDimensional<Scalar = D>>(
    edge: &SimpleEdge<V>,
    position: &V
) -> bool

Returns true if a point lies on the infinite edge going through edge.from and edge.to.