文件名称:ConquerandDiveTest
介绍说明－－下载内容均来自于网络，请自行研究使用
利用分治的算法实现平面最近点问题，有具体算法编程，另有界面演示。-The use of sub-rule algorithm planar nearest point problem, have specific programming algorithm, and another demonstration of the interface.
相关搜索： nearest
(系统自动生成,下载前可以参看下载内容)
下载文件列表
ConquerandDiveTest
..................\ConquerandDive.dcu
..................\ConquerandDive.ddp
..................\ConquerandDive.dfm
..................\ConquerandDive.pas
..................\ConquerandDive.~ddp
..................\ConquerandDive.~dfm
..................\ConquerandDive.~pas
..................\ConquerandDiveTest.cfg
..................\ConquerandDiveTest.dof
..................\ConquerandDiveTest.dpr
..................\ConquerandDiveTest.exe
..................\ConquerandDiveTest.res
..................\ConquerandDiveTest.~dpr
实验报告.doc
..................\ConquerandDive.dcu
..................\ConquerandDive.ddp
..................\ConquerandDive.dfm
..................\ConquerandDive.pas
..................\ConquerandDive.~ddp
..................\ConquerandDive.~dfm
..................\ConquerandDive.~pas
..................\ConquerandDiveTest.cfg
..................\ConquerandDiveTest.dof
..................\ConquerandDiveTest.dpr
..................\ConquerandDiveTest.exe
..................\ConquerandDiveTest.res
..................\ConquerandDiveTest.~dpr
实验报告.doc