搜索资源列表
SortPoint
- 如何将无序的多边形顶点集合，排序成逆时针顺序!这个正是凸包算法前面的一些准备工作!-how to disorderly polygon vertex assembly, sequencing into a counter-clockwise order! This is why the convex hull algorithm front of some preparation work!
凸包算法
- 用C#界面，鼠标在界面中点击生成点，然后系统会求出其凸包。
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
ConvexHullScan
- 凸包算法，自己写的代码带了接口，希望大家喜欢.-ConvexHullScan
DTin
- 基于VC++6.0环境编写， TIN生成算法是DEM的重要算法之一， 提供从离散点生成TIN的凸包收缩方法, 可以保存生成的点跟线的自定义的文本文档， 程序仅供参考-Based on VC++6.0 environment for the preparation of. TIN is generated from a point to provide the convex hull of contraction method , Can save th
QuickHulldemo
- 快速凸包演示程序 演示了快速凸包算法的执行过程-Fast convex hull demo program to demonstrate fast convex hull algorithm of the implementation process
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
Geometry
- 用C++语言实现的各种计算几何算法, 如判断点是否在多边形内, 多边形凸凹性判断, 寻找点集凸包的卷包裹法,求简单多边形的重心,求从多边形外一点出发到该多边形的切线,判断线段是否相交等等! -Using C++ language implementation of a variety of computational geometry algorithms, such as point to determine whether the polygon, the polygon convexity
structure
- 数据结构算法大全，包含最短路径，最小生成树，凸包，各种排序，四种高精度运算，图论上的常用算法，以及树的各种算法-data structure ,if you want to learn it well, you need it,I think!
Hull
- 凸包算法实现三角网的构建 Convex hull of the triangulation algorithm to build-Convex hull triangulation algorithm to build the Convex hull of the triangulation algorithm to build
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
Convex_hullAlgorithm
- 实用的凸包算法，包括计算点与水平线的夹角，二分法排序，找极点等。-A practical convex hull algorithm, including calculating angle of the point and horizontal line, dichotomy sort, looking for poles and so on.
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
ConvHull2D
- 计算几何中的凸包求解算法，效率比较高，并且容易使用，直接调用即可-computing geometry to compute the convex of a set of points.
Implementation of convex hull
- 实现凸包实现，采用MATLAB编写代码，用于凸包算法的快速实现。(Implementation of convex hull)
semi_convex_hull
- 凸包算法，选取区域最外围点，用于感兴趣区域提取。(Convex hull algorithm is used to extract regions of interest.)
ConvexHull
- 凸包(ConvexHull)就是把给定点包围在内部的，面积最小的凸多边形。时间复杂度为O(n)先计算凸包，输入点数组p，点个数为n，输出点数组ch。函数返回凸包顶点数。(The convex hull (ConvexHull) is the smallest convex polygon that surrounds the point to its interior. The time complexity is O (n). First, the convex hull is compute
C#
- 计算凸包，最后得到最小凸包。 经过C#的算法快速得到凸包(The algorithm of c # is quickly obtained)
DEM两种凸包算法程序 C# .NET
- c#下的dem内插，凸包，界面简单，语言简单，可以运行(C# DEM Interpolation, convex hull, simple interface, simple language, and can run.)