搜索资源列表
convex_hull
- 算法分析课程中实现的凸包算法,效率很高,有很大的参考价值-algorithm analysis programs to achieve the convex hull algorithms, highly efficient and have great reference value
Douglas-PeuckerLineApproximationAlgorithm
- When working with mathematical simulations or engineering problems, it is not unusual to handle curves that contains thousands of points. Usually, displaying all the points is not useful, a number of them will be rendered on the same pixel since the
1113melkman
- 1113 melkman 凸包算法，O(n),前提是有拓补结构，是一种在线算法-1113 melkman convex hull algorithm, O (n), the premise is expanding premium structure, is an online algorithm
2187
- poj2187给一堆点,求出其中的最远点对,凸包的应用-poj2187 to a pile of points, obtained one of the furthest points right, the application of convex hull
graham
- Graham convex hull sofware
Planer_convex_hull
- A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P. One way to visualize a convex hull is to put
graham
- cnvex hull with algorith graham
qhull
- Quick hull implementation
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
convex
- C++ code. Realization of an algorithm for finding an 2D convex hull polygon for input set of 2D points (with glut).
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
3_dim_hull_area
- 3维凸包求表面积，增量法，poj上面有相应题目-3 dim hull area
pku_poj_2187
- O(nlogn)凸包问题 poj2187-O (nlogn) convex hull problem poj2187
ConvexHull
- In this project, three convex hull algorithms are implemented in java. Three algorithms are Brute Force, Graham’s Scan and Jarvis’ March.
VORONOI
- vc++使用MFC生成voronoi图和凸壳 功能强大-vc++ using the MFC generates voronoi diagram and convex hull powerful
nur
- toolbox for numerical geometry: hull generation, polygon intersection
tubao
- 多边形快速形成凸包的算法，使用C++与MATLAB仿真-The polygon rapid formation of the convex hull algorithm, use C++ MATLAB simulation
convx.cpp
- Program to compute the convex hull algoritm, using opengl
clarifier
- Heave and Pitch Simulation of Ship hull moving through head sea waves UDF 6DOF