AchillesJJ / find-closest-point-pair-in-2-D Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

using divide-and-conquer method to find the closest point pair in 2-D plane.

0 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
README.md		README.md
find.cpp		find.cpp
func.cpp		func.cpp
head.h		head.h
scr.cpp		scr.cpp

Repository files navigation

find-closest-point-pair-in-2-D

using divide-and-conquer method to find the closest point pair in 2-D plane.

About

using divide-and-conquer method to find the closest point pair in 2-D plane.

Report repository

Releases

No releases published

Packages

No packages published

Languages

C++ 100.0%