0x01h / closest-pair-distance-3d

Closest pair problem in 3D space using divide and conquer algorithm. Brute-force vs. divide and conquer approach complexity analysis.

cpp algorithm algorithms algorithms-datastructures closest-pair closest-pair-of-points data-structures

This repository is not active

About

Closest pair problem in 3D space using divide and conquer algorithm. Brute-force vs. divide and conquer approach complexity analysis.

cpp algorithm algorithms algorithms-datastructures closest-pair closest-pair-of-points data-structures

GNU General Public License v3.0

Languages

Language:C++ 100.0%