Kotlin Computational Geometry

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

ClosestPairDivideAndConquer

class ClosestPairDivideAndConquer(input: Collection<Vec2>) : IClosestPair<Vec2> (source)

Closest Pair algorithm using the Divide and Conquer approach.

Constructors

ClosestPairDivideAndConquer

constructor(input: Collection<Vec2>)

initializes the algorithm with a collection of points.

Types

object Companion : IAlgorithm.IAlgorithmInfo

Functions

open override fun run(): Result<Vec2>

Runs the algorithm and returns the output.