搜索资源列表
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!
geometry_algorithm
- 各种关于几何的算法实现。包括 计算几何学库函数（线相交，面积等等） 寻找凸包 graham 扫描法 判断点是否在多边形内。同时包含一些测试-on various geometric algorithm. In terms of geometry library functions (lines intersect, size, etc.) for convex hull graham scanning judgment an
ConvexHall
- ConvexHall实现 3D Convex Hall implementation: Given N points in the space, the algorithm display the construction of the convex hall.-ConvexHall Convex 3D Hall implementati on : Given N points in the space, the algorithm
Gramham-CH
- Gramham法求解凸包。从最基本数据结构定义开始实现，有图形界面和动画演示。全套代码。-Gramham method convex hull. Data from the most basic definition of the structure began to realize, graphics and animation interface demo. A full set of code.
Hullproduce
- 计算几何中凸包的生成，也是计算机图形学中的一个重要的算法实现-convex geometry calculation packet generation, as well as computer graphics of an important algorithm
CircleGiftWrap
- 计算几何中，用VC++实现的求点集凸包的包裹算法-computational geometry, with VC point for the collection of parcels convex hull algorithm
tubaoTest
- 凸包算法的实现，用的控制台程序，不过已经能够说明问题了-convex hull algorithm for the realization of the console procedures, but has been able to illustrate the problem
cagd_arithmetic
- 怒火之袍的贡献，有算法介绍如判断点是否在线段上、判断两线段是否相交、判断线段和直线是否相交、判断点是否在多边形中、判断线段是否在多边形内、计算点到线段的最近点、计算点到圆的最近距离及交点坐标、计算两条共线的线段的交点、求线段或直线与圆的交点、凸包的求法等等，图文并茂-Army's contribution to the gowns, as introduced algorithm to determine the point o
graphicDemo
- 一个简单的图形演示系统,包括多边形的填充,多点插值 (逼近) 的Hermite曲线、Bezier曲线及B样条曲线平面中的凸壳算法-a simple graphic display systems, including polygon filling, Multi-point interpolation (approximate) Hermite curve, Bezier curves and B-spline curves of co
contexhull
- TUKE.txe文件中有200个离散点的坐标值,本程序实现生成这些点的凸壳.-TUKE.txe document is 200 discrete points of the coordinate value, The program generating these points of the convex hull.
convex_vb
- 凸包最常用的凸包算法是Graham扫描法和Jarvis步进法.本程序用Graham扫描法实现凸包的绘制-convex hull of the most commonly used convex hull algorithm is scanning and Graham Jarvis stepping law. The procedures used G raham scanning method to achieve the conve
tubao
- 模拟凸包的实现，只要随便点击一点，那么程序将自动寻找合适的点，将其连成凸包-simulation convex hull of achieving Just click 1:00, the process will automatically search for suitable spots, even as its convex hull
tubao
- 凸包程序，在一堆离散的无规律的点中间找出一个边界！-Convex hull procedure, in a pile of discrete irregular border to find a middle point!
geometry
- C++语言编写的几何学算法模板。包括几何学的10多种基本的操作。例如点生成直线，叉积运算，线段的拐向，任意多边形面积的计算，点的位置判断，线段相交判断，求凸包等等。-C++ Language template geometry algorithm. Including the geometry of more than 10 kinds of basic operation. For example, point to generate
PolyConvHull
- 此方法得到的凸壳总是逆时针顺序，可用于任意简单多边形。-This method of Convex Hull is always counter-clockwise order, can be used for any simple polygon.
mathformulae
- 第一章 有关数论的算法 1.1最大公约数与最小公倍数 1.2有关素数的算法 1.3方程ax+by=c的整数解及应用 1.4 求a^b mod n 第二章 高精度计算 2.1高精度加法 2.2高精度减法 2.3高精度乘法 2.4 高精度除法 练习 第三章 排列与组合 3.1加法原理与乘法原理 练习 3. 2 排列与组合的概念与计算公式 练习 3.3排列与组合的产生算法 练
tubao
- 主要是实现了凸包的功能，不是界面形式的，控制台下输入多个点的坐标 ，可把最外层的点筛选显示出来-Mainly realize the function of the convex hull, rather than forms of interface, control panel, enter the coordinates of multiple points may be the outermost point of the fi
tubao
- 计算几何中凸包的生成，也是计算机图形学中的一个重要的算法实现-Computational geometry convex hull of the generation of computer graphics is an important algorithm
POJ1113
- 问题：已经平面上的若干点，求包围这些点的最小包围长 度 算法：经典的凸包算法，注意求解时对最外圈做处理。-Question: has a number of points on the plane, and surrounded by the smallest of these points, surrounded by the length of algorithm: the classic convex hull al
Delaunay2
- Delauny三角网生成算法的VC实现，算法基于凸包的Delaunay三角剖分方法，在生成的凸多边形的基础上进行三角剖分，并采用VC进行程序设计。-Delauny triangulation realize VC generation algorithm, the algorithm based on the convex hull of the Delaunay triangulation method, the generated