Description: Procedures to achieve, in the plane by pressing the left mouse button to import some point, calculating the right mouse button up the plane of the convex hull of discrete points. vc++ achieved, convenient for the Convex Hull algorithm for the understanding of great benefit
- [tubaoTest] - convex hull algorithm for the realizatio
- [hull] - a pretty good convex hull generation pro
- [Delaunay] - Delaunay algorithm technology and implem
- [Voronoi] - Their use of VC in the preparation of GI
- [visKDTree] - kdtree. english for nearest point. Can i
- [huitu] - A simple drawing program. Prepared to us
- [123] - In this paper, a general-purpose DSP-bas
- [Delaunay] - Triangulation algorithm to study the imp
- [TuBao] - err
- [1113melkman] - 1113 melkman convex hull algorithm, O (n
File list (Check if you may need any files):
Download