搜索资源列表
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
src
- Another convex hull algoritm for 3d points in java
convexhull.c
- Convex hull program using C and OpenCv library
area
- 计算凸包面积，点集Q的凸包是指一个最小凸多边形，满足Q中的点或者在多边形边上或者在其内。-Calculate convex hull area。The convex hull of point set Q is a minimum convex polygon, to meet the Q of the point or polygon or in its inside edge
GrahamScan
- Graham凸包扫描算法，算法速度快，很经典的，程序内部注释比较全面。-Graham scan algorithm for convex hull algorithm is fast, very classic, more comprehensive program within the comment.
convexl
- The convex hull of a set of points is the smallest convex set that contains the points. This paper presents a convex hull algorithm that combines the 2-d Quickhull algorithm with the general dimension.
button_max_min
- 可自由改变船体的大小，最大化。最小化。很实用，内部源码很详细，有意者可下载-Free to change the size of the hull, to maximize. Minimized. Very practical, the internal source in great detail, Interested parties can download
form_change
- 可自由改变船体的大小，很实用，内部源码很详细，有意者可下载-Free to change the size of the hull, it is practical, the internal source in great detail, Interested parties can download
GSConvexHull-CPP
- convex hull c++ code
Convexhullproblem
- 点集Q的凸包(convex hull)是指一个最小凸多边形，满足Q中的点或者在多边形边上或者在其内-The convex hull of point set Q (convex hull) is a minimum convex polygon, to meet the Q of the point or the edge of or within this polygon
hull
- 该代码实现由点集序列或数组创建凸外形，基于OPENCV-The code sequence or set of points achieved by the convex shape to create an array, based on OPENCV
dlg
- 利用MFC，简单的图形界面，简单的算法，实现凸包的绘制-Using MFC, a simple graphical interface, a simple algorithm to achieve the convex hull of the draw
tuke
- 凸壳的生成是计算机图形学中的基本图形处理算法，本程序是演示生成凸壳的c++源码 -Convex hull of computer graphics generation is the basic graphics algorithms, this procedure is to demonstrate the Convex Hull of generating c++ source code
abc
- 形成凸包并计算面积简洁版，也就是计算几何里面的凸包问题的求解 采用按照斜率的排序 经过试验比网上的模板要快-Hull form and calculate the area of compact version, that is, computational geometry inside the convex hull problem was solved using the sort tested in accordance with the slope of the template fa
ConvHull
- 对于平面上任意给定的一些离散的点，确定这些点的凸包的边界。-For any given plane, a number of discrete points, the convex hull of these points to determine the boundaries.
jisuanjihe
- 其中讲述了计算几何中常用的叉积定义以及应用，凸包算法，还有半平面交算法-Which describes the computational geometry of the cross product definition of commonly used applications, convex hull algorithm, there are half-plane intersection algorithm
hull
- 很有用的机械工具包 Nice matlab package for mechanical engineering.-Nice matlab package for mechanical engineering.
GrahamScan
- 凸包最常用的凸包算法是Graham扫描法和Jarvis步进法,该上传文件主要是基于Graham扫描法的凸包算法-convex hull algorithms:based on Graham scan method ~ ~~~~`~·`·`
extend
- 船体外板展开实用程序，可实现船体肋骨线、水线、纵剖线等的展开。-Hull shell expansion utility that enables the hull rib line, water line, vertical lines, and the profile control to start.
OpenCV
- sample of opencv and convex hull graham algoritme