Location:
Search - ConvexHull
Search list
Description: 主要介绍了凸包算法的演变过程，从最简单的枚举到复杂的扫描-mainly introduces the convex hull algorithm evolution process, from the most simple to complex enumeration scan
Platform: |
Size: 123032 |
Author: 陈力 |
Hits:
Description: 使用C++实现的Graham扫描法（求解凸包问题），可设置生成随机点的个数、样式，同时支持设置显示范围、显示算法处理时间及使用文件导入导出点等功能。（文件格式为，头四个字节是点的个数，以后分别是各个点的x坐标和y坐标，每个数值均占4字节）。
Platform: |
Size: 51665 |
Author: 王晓桐 |
Hits:
Description: 主要介绍了凸包算法的演变过程，从最简单的枚举到复杂的扫描-mainly introduces the convex hull algorithm evolution process, from the most simple to complex enumeration scan
Platform: |
Size: 122880 |
Author: 陈力 |
Hits:
Description: 使用C++实现的Graham扫描法（求解凸包问题），可设置生成随机点的个数、样式，同时支持设置显示范围、显示算法处理时间及使用文件导入导出点等功能。（文件格式为，头四个字节是点的个数，以后分别是各个点的x坐标和y坐标，每个数值均占4字节）。-The use of C++ Realize the Graham scan method (for solving convex hull problems), can be set to generate a random number of points, patterns, and at the same time to support the set display range, display algorithm processing time and the use of document features such as import and export points. (File format for the first four bytes is the number of points, after all points are x coordinates and y coordinates, each account for 4-byte value).
Platform: |
Size: 51200 |
Author: 王晓桐 |
Hits:
Description: 用动态链表实现求凸壳的程序（卷包裹法），供三角网实现编程的人参考-Using dynamic list for the Convex Hull of the realization of procedures (vol Parcel law) for the triangular network programming reference
Platform: |
Size: 451584 |
Author: 尚永 |
Hits:
Description: The Graham scan examines the points one by one and eliminates the points which cause reflexive angles
Platform: |
Size: 2048 |
Author: linru |
Hits:
Description: 由 点 集合 序列 或者 数组 创建 凸外形-opencv convexhull
Platform: |
Size: 3072 |
Author: li |
Hits:
Description: convexik jan convexik
Platform: |
Size: 1024 |
Author: artavazd |
Hits:
Description: 凸包jarvis算法以及格雷米算法，对两种算法进行一个比较，并且提供两种算法的代码-Convex hull algorithm and jarvis Geremi algorithm, two algorithms on a comparison of two algorithms and provides code
Platform: |
Size: 6144 |
Author: robert |
Hits:
Description: 用于求解凸包问题！包围所有的定点！
-Convex hull for the solution of the problem!
Platform: |
Size: 7168 |
Author: Future |
Hits:
Description: 现有一硬件采集了人在一固定大小的平面上的压力中心点，采集了很多数据，现在要求用vb算出一组压力中心点的凸包，以便显示人在这一时段的活动范围-A collection of existing hardware in a fixed plane the size of the center of pressure, a lot of data collection, and now requires a set of pressure vb calculate the center of the convex hull in order to display the time in the scope of activities
Platform: |
Size: 2048 |
Author: 韩廷章 |
Hits:
Description: 由一堆离散点，自动生成它的最小外包多边形，及凸壳。-By a bunch of discrete points, it is automatically generated out of the smallest polygon, and the Convex Hull.
Platform: |
Size: 5120 |
Author: 荆凯旋 |
Hits:
Description: imagestone source code
Platform: |
Size: 79872 |
Author: shazy |
Hits:
Description: Convex Hull Algorithm Implemetation in ASP C#
Platform: |
Size: 47104 |
Author: abhishek |
Hits:
Description: convex hull using quick hu-convex hull using quick hull
Platform: |
Size: 1024 |
Author: abhishek |
Hits:
Description: an application for convex hull in visual c++ on windows platform using openCv library a -an application for convex hull in visual c++ on windows platform using openCv library a a a a a a a a a a a
Platform: |
Size: 1024 |
Author: vane |
Hits:
Description: Scanner in java which read and tokenises the code
Platform: |
Size: 15360 |
Author: sai |
Hits:
Description: convex hull in 2d using cgal and also visual studio 2008. I do not know if it is working or not but make sure you check it before presenting
Platform: |
Size: 4262912 |
Author: sai |
Hits:
Description: In this project, three convex hull algorithms are implemented in java. Three algorithms are Brute Force, Graham’s Scan and Jarvis’ March.
Platform: |
Size: 9216 |
Author: zephrion |
Hits:
Description: 凸包(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 computed, and the input point group P is given. The number of points is n, and the output point array is ch. Returns the convex hull number of the function.)
Platform: |
Size: 1024 |
Author: dosense
|
Hits: