Location:
Search - convexhull.c
Search list
Description: 使用C++实现的Graham扫描法（求解凸包问题），可设置生成随机点的个数、样式，同时支持设置显示范围、显示算法处理时间及使用文件导入导出点等功能。（文件格式为，头四个字节是点的个数，以后分别是各个点的x坐标和y坐标，每个数值均占4字节）。
Platform: |
Size: 51665 |
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: Convex Hull Algorithm Implemetation in ASP C#
Platform: |
Size: 47104 |
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: Convex hull program using C and OpenCv library
Platform: |
Size: 1024 |
Author: zeus |
Hits:
Description: 周培德翻译的《计算几何:算法设计与分析》中的凸包算法，在Visual Studio2008平台用C#语言编写的基于页面的二维凸包生成程序。本人拥有自主版权！-Zhou s translation, "Computational Geometry: algorithm design and analysis" of the convex hull algorithm, written in C# in Visual Studio2008 platform packet generation page-based two-dimensional convex program. I own copyright!
Platform: |
Size: 41984 |
Author: sunlu |
Hits:
Description: C++ Convex Hull algorithm
Platform: |
Size: 753664 |
Author: daniil |
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: 基于C#开发的求解无序点云的最小凸包程序。-Based on C# development unordered point cloud solving the minimum convex hull program.
Platform: |
Size: 13312 |
Author: 若水 |
Hits:
Description: C++ Implementation of the convex-hull algorithm for a list of 2D points. Based on the quick-hull algorithm.
Platform: |
Size: 2048 |
Author: Balbson |
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: