Location:
Search - Graham Scan
Search list
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: OI模板
很全，pascal
是Amber 大牛写的。-OI template is very wide, pascal is written by Amber Daniudi.
Platform: |
Size: 53248 |
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: Graham Scan Algorithm
Platform: |
Size: 3072 |
Author: Albert |
Hits:
Description: Graham凸包扫描算法，算法速度快，很经典的，程序内部注释比较全面。-Graham scan algorithm for convex hull algorithm is fast, very classic, more comprehensive program within the comment.
Platform: |
Size: 268288 |
Author: 陈栋 |
Hits:
Description: 凸包最常用的凸包算法是Graham扫描法和Jarvis步进法,该上传文件主要是基于Graham扫描法的凸包算法-convex hull algorithms:based on Graham scan method ~ ~~~~`~·`·`
Platform: |
Size: 66560 |
Author: 陈琳 |
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: Graham扫描算法 ： 大体思路是将不是凸包顶点的点从点集中去掉。
找出S中具有最小y坐标的点p（通过选取最左边的点打破平局）
根据点和p的连线 与 x轴正方向所成的角度，对S中的点进行排序（由小到大），并将p放在最前面。
从p点开始扫描排序后的S集合。如果这些点都在凸包上，则每三个相继的点p1,p2,p3满足以下性质：p3在向量<p1,p2>的左边.如果出现相继的三个点p1,p2,p3不满足上述性质，则p2点一定不是凸包的顶点，应立即去除。-Graham scan algorithm: the general idea is not a convex hull vertex points from a point focus on remove.
Identify S with the minimum y coordinate of the point p (select the left-most point to break a tie)
According to the connection point and p x-axis positive direction into the angle, sort the points in S (small to large), and p up front.
Scan sorted S-collection from p. These points on the convex hull of every three successive points p1, p2, p3, meet the following properties: p3, in vector <p1,p2> the left side if the successive three points p1 is p2, p3 does not meet the the above properties, then p2 is definitely not the vertex of the convex hull should be immediately removed.
Platform: |
Size: 1024 |
Author: 李刚 |
Hits:
Description: 此为凸包的graham的scan算法，思路清晰，易实现。-This is the convex hull of graham scan algorithm, the idea is clear and easy to implement.
Platform: |
Size: 1024 |
Author: john |
Hits:
Description: Graham Scan to generic convexha-Graham Scan to generic convexhall
Platform: |
Size: 3072 |
Author: dos |
Hits:
Description: 本代码主要实现土包问题的算法，采用Graham扫描算法，随机生成指定数量的点，求解其凸包。代码中包含注释-The code of the main problems of soil packet algorithm, using Graham scan algorithm to randomly generate a specified number of points, solving its convex hull. Code contains annotations
Platform: |
Size: 48128 |
Author: 张森 |
Hits:
Description: 使用C++实现的基于OpenGl的Graham扫描法求解二维凸包问题-Using c++ implementation based on OpenGl Graham scan method to solve the two dimensional convex hull problem
Platform: |
Size: 140288 |
Author: jsbaixue |
Hits:
Description: Graham s scan algorithm for finding convex hull using linked list.
Platform: |
Size: 2048 |
Author: Arunkumar V S |
Hits:
Description: 凸包求解算法。
实现基于枚举方法的凸包求解算法
实现基于Graham-Scan的凸包求解算法
实现基于分治思想的凸包求解算法
对比三种凸包求解算法
-Convex hull algorithm.
Based on Convex Hull algorithm enumeration method
Based on Graham-Scan convex hull algorithm
Based on Divide and Conquer convex hull algorithm
Compare three kinds of convex hull algorithm
Platform: |
Size: 1157120 |
Author: 大酱 |
Hits: