搜索资源列表
tubaoTest
- 凸包算法的实现，用的控制台程序，不过已经能够说明问题了-convex hull algorithm for the realization of the console procedures, but has been able to illustrate the problem
convex_hull
- 算法分析课程中实现的凸包算法,效率很高,有很大的参考价值-algorithm analysis programs to achieve the convex hull algorithms, highly efficient and have great reference value
Two
- 二维凸包,算法中的难点，可以迅速解决很多问题
Convex_Hull
- 凸包算法在VC6下实现，使用MFC界面编程显示结果
POJ1113
- 问题：已经平面上的若干点，求包围这些点的最小包围长 度 算法：经典的凸包算法，注意求解时对最外圈做处理。
convex_optimization.rar
- 凸优化程序包，包含各种凸优化算法,可供方便调用.,Convex optimization package, contains a variety of convex optimization algorithm, for convenience call.
geometry-1.5.source.tar
- 一个强大的开源的计算几何算法库，全称是： 提供了诸如：2D凸包，3D凸包，三角化等等著名的计算几何经典算法。库是基于C++的。 -(I plan to dedicate every edition of this software to someone famous who has influenced computers, mathematics, or science.) Version 1.0 of Geometry is dedicated to the father of A
TestMinvexCore
- 求点集的最小凸包Graham算法。给定平面上的一个点集，找出一个最小点集顺次连结形成一个凸多边形，使得点集中的点皆在此多边形内或此多边形上，这个凸多边形就是给定点集的 二维凸包。-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 po
ConvexHullScan
- 凸包算法，自己写的代码带了接口，希望大家喜欢.-ConvexHullScan
QuickHulldemo
- 快速凸包演示程序 演示了快速凸包算法的执行过程-Fast convex hull demo program to demonstrate fast convex hull algorithm of the implementation process
1113melkman
- 1113 melkman 凸包算法，O(n),前提是有拓补结构，是一种在线算法-1113 melkman convex hull algorithm, O (n), the premise is expanding premium structure, is an online algorithm
graham
- 使用graham算法求二维凸包- Uses the graham algorithm to ask the two-dimensional raised package
Convex
- 凸包算法 vc 6.0 实现用户输入点凸包-Convex hull algorithm for vc 6.0 user input convex hull
structure
- 数据结构算法大全，包含最短路径，最小生成树，凸包，各种排序，四种高精度运算，图论上的常用算法，以及树的各种算法-data structure ,if you want to learn it well, you need it,I think!
1
- 用C 语言实现的对于凸包问题的求解。实现了基本的功能，代码量很少采用插值算法，先生成四个原始点，之后判断其他点-Using C language for the convex hull of the solution of the problem. To achieve the basic function of the volume of rarely used code interpolation algorithm, the original Mr. into four points, a
gaimc-1.0
- 一个常用的计算机图论算法包 包含常用的图论算法 如dijkstra 凸包-A commonly used computer algorithms graph theory package contains the commonly used graph theory algorithms such as convex hull, and so dijkstra
newconvex
- 自写凸包算法，简单实用，连线清晰，算法简练-Since the convex hull algorithm to write simple, practical, connection clear, concise algorithm
convex
- gram法求凸包， 凸包是区域内任意两点的直线不与边界相交的简单闭区域。 gram算法能够高效地求解出凸包的点集-gram Method convex hull, convex hull is a straight line between any two points within the region do not intersect with the boundary simple closed area. gram algorithm can efficiently solve
Implementation of convex hull
- 实现凸包实现，采用MATLAB编写代码，用于凸包算法的快速实现。(Implementation of convex hull)
C#
- 计算凸包，最后得到最小凸包。 经过C#的算法快速得到凸包(The algorithm of c # is quickly obtained)