Interface for closest pair algorithms.
This interface defines the contract for algorithms that find the closest pair of points in a collection of points in 2D space.
Returns the group to which the algorithm belongs. This is used for categorization and organization of algorithms.
Returns a unique identifier for the algorithm, combining its group and name. The identifier is formatted as "group:name", with both group and name in lowercase and spaces replaced by hyphens.
Returns the name of the algorithm.
Runs the algorithm and returns the output.