Description: The nearest point of the problem is that many books there must be a method to explore the question, I based Wang Xiaojun' s " Algorithm Design and Analysis of" divide and conquer, and achieve the traditional method of graphical demo program, we can see that the performance of the algorithm comparison.
To Search:
File list (Check if you may need any files):
NearestPoint\Debug\MyPoint.obj
............\.....\NearestPoint.exe
............\.....\NearestPoint.ilk
............\.....\NearestPoint.obj
............\.....\NearestPoint.pch
............\.....\NearestPoint.pdb
............\.....\NearestPoint.res
............\.....\NearestPointDlg.obj
............\.....\Pair.obj
............\.....\StdAfx.obj
............\.....\vc60.idb
............\.....\vc60.pdb
............\MaskKey.h
............\MaskKeyApp.h
............\MyPoint.cpp
............\MyPoint.h
............\NearestPoint.aps
............\NearestPoint.clw
............\NearestPoint.cpp
............\NearestPoint.dsp
............\NearestPoint.dsw
............\NearestPoint.h
............\NearestPoint.ncb
............\NearestPoint.opt
............\NearestPoint.plg
............\NearestPoint.rc
............\NearestPointDlg.cpp
............\NearestPointDlg.h
............\Pair.cpp
............\Pair.h
............\ReadMe.txt
............\res\NearestPoint.ico
............\...\NearestPoint.rc2
............\resource.h
............\StdAfx.cpp
............\StdAfx.h
............\Debug
............\res
NearestPoint
Download