35 packages found
Compute the greatest common divisor (gcd).
Compute the hypotenuse avoiding overflow and underflow.
Compute the hypotenuse avoiding overflow and underflow (single-precision).
Compute the hypotenuse using the alpha max plus beta min algorithm.
Compute the least common multiple (lcm).
Compute the hypotenuse.
Calculate the L2-norm of a double-precision floating-point vector.
Calculate the L2-norm of a single-precision floating-point vector.
Calculate the L2-norm of a vector.
Incrementally partition data into `k` clusters.
A set of methods for the generation and transformation of number sequences useful in algorithmic composition
- View more
Distance transforms for ndarrays
compute the least common multiple using Euclidean algorithm
Compares two angles with a common edge
A JS module for calculating several distances between two (n-dimensional) points
Traditional music rhythms (Euclidean/Bjorklung algorithm)
Compute the euclidean distance between two vectors
Calculates the patterns based on the euclidean/bjorklund's algorithm
Computes the Euclidean distance between two arrays.