Description: The smallest point set for convex hull algorithms Graham. Given a planar point set, find a link to the smallest sequence set to form a convex polygon, the points are concentrated at this point or polygon on the polygon, the convex polygon to the fixed-point set is two-dimensional convex hull .
To Search:
- [tubao] - simulation convex hull of achieving Just
- [filter] - vc++ under different frequency-selective
- [ConvexHull] - The use of C++ Realize the Graham scan m
- [tubao] - Convex hull of visual programming, inter
- [computationgeometry] - Computational geometry to my template, a
- [MinvexCore] - I have students write a minimum convex h
- [PolyGon] - Drawing polygon, right-click the mouse t
- [MAPCAD] - VB of the use of geo-spatial analysis of
- [points] - failed to translate
File list (Check if you may need any files):
TestMinvexCore
..............\Debug
..............\MainFrm.cpp
..............\MainFrm.h
..............\ReadMe.txt
..............\res
..............\...\TestMinvexCore.rc2
..............\resource.h
..............\StdAfx.cpp
..............\StdAfx.h
..............\TestMinvexCore.aps
..............\TestMinvexCore.clw
..............\TestMinvexCore.cpp
..............\TestMinvexCore.dsp
..............\TestMinvexCore.dsw
..............\TestMinvexCore.h
..............\TestMinvexCore.ncb
..............\TestMinvexCore.opt
..............\TestMinvexCore.plg
..............\TestMinvexCore.rc
..............\TestMinvexCoreDoc.cpp
..............\TestMinvexCoreDoc.h
..............\TestMinvexCoreView.cpp
..............\TestMinvexCoreView.h
Download