Algorithms/LinearAlgebra/Distances/Chebyshev.cs

using System;
using System.Linq;

namespace Algorithms.LinearAlgebra.Distances;

//github.com/ <summary>
//github.com/ Implementation of Chebyshev distance.
//github.com/ It is the maximum absolute difference between the measures in all dimensions of two points.
//github.com/ In other words, it is the maximum distance one has to travel along any coordinate axis to get from one point to another.
//github.com/
//github.com/ It is commonly used in various fields such as chess, warehouse logistics, and more.
//github.com/ </summary>
public static class Chebyshev
{
    //github.com/ <summary>
    //github.com/ Calculate Chebyshev distance for two N-Dimensional points.
    //github.com/ </summary>
    //github.com/ <param name="point1">First N-Dimensional point.</param>
    //github.com/ <param name="point2">Second N-Dimensional point.</param>
    //github.com/ <returns>Calculated Chebyshev distance.</returns>
    public static double Distance(double[] point1, double[] point2)
    {
        if (point1.Length != point2.Length)
        {
            throw new ArgumentException("Both points should have the same dimensionality");
        }

        // distance = max(|x1-y1|, |x2-y2|, ..., |xn-yn|)
        return point1.Zip(point2, (x1, x2) => Math.Abs(x1 - x2)).Max();
    }
}