二维最近点 procedures to achieve the two-dimensional da

Title: 二维最近点

Category:
Windows Develop
Tags:
[C/C++] [源码]
File Size:
2.23kb
Update:
2008-10-13
Downloads:
0 Times
Uploaded by:
yangchen_www

Description: procedures to achieve the two-dimensional data of the axis points near the methodology used to solve the problem : the administration

Downloaders recently: [More information of uploader yangchen_www]

To Search:

[twohourscoverage.Rar] - procedures with the greedy algorithm to
[arecentpeacekeepingpoints(partition)1] - the process of achieving a dimensional d
[arecentpeacekeepingpoints(partition)2] - the process of achieving a dimensional d
[nearpiont] - closest point to the problem is for two-
[zjdd] - VC point to the recent problems, Guanggu
[LCM12864CT_FINAL] - Limiti Display Module (LSD12864CT) Drive
[tanxinsuanfaerfenfugai] - detailed algorithm in the heart two hour
[cg3DDemo1] - Functions/Classes:
[ConquerandDiveTest] - The use of sub-rule algorithm planar nea
[ppt] - linux training materials, this is someth

File list (Check if you may need any files):

Main Category

SourceCode

Web Code

Develop Tools

Document

Other resource

Category

GUI Develop

Windows Kernel

WinSock-NDIS

Driver Develop

ADO-ODBC

GDI-Bitmap

CSharp

.net

Multimedia Develop

Communication

Shell api

ActiveX/DCOM/ATL

IME Develop

ISAPI-IE

Hook api

Screen saver

DirextX

Process-Thread

Console

File Operate

Printing program

Multi Monitor

DNA

Other

About site

CodeBus www.codebus.net