Description: Two nearest points on the plane ask the question, the use of divide and conquer approach, in accordance with the books of the algorithm
To Search:
- [right.Rar] - This is a classic look for the nearest p
File list (Check if you may need any files):
closepair\bin\Debug\closepair.exe
.........\...\.....\useforalg67.exe
.........\closepair.cbp
.........\closepair.depend
.........\closepair.layout
.........\main.cpp
.........\obj\Debug\main.o
.........\useforalg67.exe
.........\bin\Debug
.........\obj\Debug
.........\bin
.........\obj
closepair