Kotlin Computational Geometry/io.github.cponfick.kompgeom.algorithms.closestpair/ClosestPairNaive

ClosestPairNaive

class ClosestPairNaive<V : Vector<V>>(input: Collection<V>) : IClosestPair<V> (source)

Closest Pair algorithm using the Divide and Conquer approach. This implementation sorts the points by x and y coordinates and recursively finds the closest pair.

Constructors

ClosestPairNaive

constructor(input: Collection<V>)

initializes the algorithm with a collection of points.

Functions

getGroup

open override fun getGroup(): String

Returns the group to which the algorithm belongs. This is used for categorization and organization of algorithms.

getId

open fun getId(): String

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.

getName

open override fun getName(): String

Returns the name of the algorithm.

run

open override fun run(): Result<V>

Runs the algorithm and returns the output.