搜索资源列表
graham
- 使用graham算法求二维凸包- Uses the graham algorithm to ask the two-dimensional raised package
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
geometry_c++
- 计算几何学常用算法库 C++语言实现 代码内容 计算几何学常用算法库，包括以下算法： 确定两条线段是否相交 判断点p是否在线段上 判断点q是否在多边形Polygon内 计算多边形的面积 寻找凸包 graham 扫描法 -geometry calculation commonly used algorithm for C language code as calculated geome
cagd_arithmetic
- 怒火之袍的贡献，有算法介绍如判断点是否在线段上、判断两线段是否相交、判断线段和直线是否相交、判断点是否在多边形中、判断线段是否在多边形内、计算点到线段的最近点、计算点到圆的最近距离及交点坐标、计算两条共线的线段的交点、求线段或直线与圆的交点、凸包的求法等等，图文并茂-Army's contribution to the gowns, as introduced algorithm to determine the point o
highflybird-lisp
- 计算几何中的几种lisp语言的算法，包括凸包，最小包围圆，点集的最大直径，最小距离等。-computational geometry of several lisp language algorithms, including the convex hull, the smallest enclosing circle, Point Set diameter of the largest and the smallest distanc
ConvexHull
- 使用C++实现的Graham扫描法（求解凸包问题），可设置生成随机点的个数、样式，同时支持设置显示范围、显示算法处理时间及使用文件导入导出点等功能。（文件格式为，头四个字节是点的个数，以后分别是各个点的x坐标和y坐标，每个数值均占4字节）。-The use of C++ Realize the Graham scan method (for solving convex hull problems), can be set to gen
geometry
- C++语言编写的几何学算法模板。包括几何学的10多种基本的操作。例如点生成直线，叉积运算，线段的拐向，任意多边形面积的计算，点的位置判断，线段相交判断，求凸包等等。-C++ Language template geometry algorithm. Including the geometry of more than 10 kinds of basic operation. For example, point to generate
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
MinvexCore
- 我同学写的一个最小凸包的算法程序！注释详尽，功能蛮好的哦！-I have students write a minimum convex hull algorithm procedure! Notes detailed features of the Oh fine!
melkman
- melkman code 多边形求凸包的算法-Polygon melkman code for Convex Hull algorithm
poly
- 计算几何经典算法集合，包括旋转卡壳求凸包，求重心，多边形面积，多边形周长，直线方程等-Collection of classical computational geometry algorithms, including the rotating卡壳for convex hull, and center of gravity, polygon area, polygon perimeter, linear equations, etc
Geometry
- 用C++语言实现的各种计算几何算法, 如判断点是否在多边形内, 多边形凸凹性判断, 寻找点集凸包的卷包裹法,求简单多边形的重心,求从多边形外一点出发到该多边形的切线,判断线段是否相交等等! -Using C++ language implementation of a variety of computational geometry algorithms, such as point to determine whether the
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 or
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
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
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 al
ConvHull2D
- 计算几何中的凸包求解算法，效率比较高，并且容易使用，直接调用即可-computing geometry to compute the convex of a set of points.
DEM两种凸包算法程序 C# .NET
- c#下的dem内插，凸包，界面简单，语言简单，可以运行(C# DEM Interpolation, convex hull, simple interface, simple language, and can run.)