Enum SlopeAlgorithm 

pub enum SlopeAlgorithm {
    Horn,
    ZevenbergenThorne,
    EvansYoung,
    MaximumDownhill,
}

Algorithm for computing slope and aspect gradients

Variants

Horn

Horn (1981): 3rd-order finite difference with 2x weighting on cardinal neighbors. Most robust against noise. This is the GDAL default.

ZevenbergenThorne

Zevenbergen & Thorne (1987): 2nd-order finite difference using only 4 cardinal neighbors. Better for smooth, mathematically defined surfaces.

EvansYoung

Evans-Young: Fits a quadratic polynomial to the 3x3 window. Theoretically optimal for regular grids.

MaximumDownhill

Maximum downhill slope: steepest descent among all 8 neighbors. Useful for hydrological analysis (D-infinity style).

Trait Implementations

impl Clone for SlopeAlgorithm

fn clone(&self) -> SlopeAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for SlopeAlgorithm

impl Debug for SlopeAlgorithm

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

Formats the value using the given formatter.

impl Default for SlopeAlgorithm

fn default() -> SlopeAlgorithm

Returns the “default value” for a type.

impl Eq for SlopeAlgorithm

impl PartialEq for SlopeAlgorithm

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl StructuralPartialEq for SlopeAlgorithm