Location:
Search - convex
Search list
Description: 求解任意两个多边形的并集，交集，差集，要求是简单多边形，可以是凸多边形和凹多边形-solving arbitrary polygon and two sets, intersection, difference, the request is a simple polygon, it is concave and convex polygon Polygon
Platform: |
Size: 3072 |
Author: 张鹜 |
Hits:
Description: 多边形常用算法模块 1. 判断多边形是否简单多边形2. 检查多边形顶点的凸凹性 3. 判断多边形是否凸多边形 4. 求多边形面积5. 判断多边形顶点的排列方向，方法一 6. 判断多边形顶点的排列方向，方法二 7. 射线法判断点是否在多边形内8. 判断点是否在凸多边形内-Does the polygon commonly used algorithm module 1. judgements polygons whether simple polygon. 2. inspections polygons apex convex-concave. 3. judgements polygons whether raised- polygon. 4. ask the polygon area. 5. judgements polygons apex the arrangement direction, the method 1. 6. judgements polygons apex arrangement direction, the method 2. 7. beams methods to sentence the break point whether. 8. sentences the break point in the polygon whether in raised- polygon
Platform: |
Size: 2048 |
Author: 孤星赶月 |
Hits:
Description: 8. 判断点是否在凸多边形内 9. 寻找点集的graham算法 10.寻找点集凸包的卷包裹法 11.判断线段是否在多边形内 12.求简单多边形的重心 13.求凸多边形的重心14.求肯定在给定多边形内的一个点15.求从多边形外一点出发到该多边形的切线16.判断多边形的核是否存在-8. In judging whether a convex polygon 9. Find points of graham algorithm 10. Find point set of convex hull volume parcels Act 11. Line judge whether the polygon 12. Seeking simple polygon focus 13. Convex Polygon focus 14. For sure in a given polygon within the a point 15. demand from outside the polygon to the starting point of the polygon Tangent 16. the nuclear polygon judgment whether there
Platform: |
Size: 4096 |
Author: 孤星赶月 |
Hits:
Description: C code for "Computational Geometry in C (Second Edition)": Code function Chapter pointer directory ----------------------------------------------------- Triangulate Chapter 1, Code 1.14 /tri Convex Hull(2D) Chapter 3, Code 3.8 /graham Convex Hull(3D) Chapter 4, Code 4.8 /chull sphere.c Chapter 4, Fig. 4.15 /sphere Delaunay Triang Chapter 5, Code 5.2 /dt SegSegInt Chapter 7, Code 7.2 /segseg Point-in-poly Chapter 7, Code 7.13 /inpoly Point-in-hedron Chapter 7, Code 7.15 /inhedron Int Conv Poly Chapter 7, Code 7.17 /convconv Mink Convolve Chapter 8, Code 8.5 /mink Arm Move Chapter 8, Code 8.7 /arm-C code for "Computational Geometry in C (Second Edition)": Code function Chapter pointer directory----------------------------------------------------- Triangulate Chapter 1, Code 1.14 /tri Convex Hull(2D) Chapter 3, Code 3.8 /graham Convex Hull(3D) Chapter 4, Code 4.8 /chull sphere.c Chapter 4, Fig. 4.15 /sphere Delaunay Triang Chapter 5, Code 5.2 /dt SegSegInt Chapter 7, Code 7.2 /segseg Point-in-poly Chapter 7, Code 7.13 /inpoly Point-in-hedron Chapter 7, Code 7.15 /inhedron Int Conv Poly Chapter 7, Code 7.17 /convconv Mink Convolve Chapter 8, Code 8.5 /mink Arm Move Chapter 8, Code 8.7 /arm
Platform: |
Size: 67584 |
Author: Mark |
Hits:
Description: 一个绘制Voronoi图和Delauany三角剖分的程序，并且给出了求凸包的算法。该程序可以演示如何进行三角剖分，帮助你理解整个剖分过程。-a Voronoi diagram mapping and triangulation Delauany procedures, and is seeking a convex hull algorithms. The procedure can demonstrate how triangulation, and help you understand the subdivision process.
Platform: |
Size: 157696 |
Author: 晓琳 |
Hits:
Description: 利用凸包的原理,求解70个城市的旅行商问题.用Matlab实现-use of convex hull of principle, solving 70 cities in the TSP. Using Matlab
Platform: |
Size: 2048 |
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: ConvexHall实现
3D Convex Hall implementation: Given N points in the space, the algorithm display the construction of the convex hall.-ConvexHall Convex 3D Hall implementati on : Given N points in the space, the algorithm display the construction of the c onvex hall.
Platform: |
Size: 47104 |
Author: 李萍 |
Hits:
Description: Gramham法求解凸包。从最基本数据结构定义开始实现，有图形界面和动画演示。全套代码。-Gramham method convex hull. Data from the most basic definition of the structure began to realize, graphics and animation interface demo. A full set of code.
Platform: |
Size: 72704 |
Author: 王晓光 |
Hits:
Description: 计算几何学常用算法库 C++语言实现
代码内容 计算几何学常用算法库，包括以下算法：
确定两条线段是否相交
判断点p是否在线段上
判断点q是否在多边形Polygon内
计算多边形的面积
寻找凸包 graham 扫描法
-geometry calculation commonly used algorithm for C language code as calculated geometry commonly used algorithm library, include the following algorithm : to determine whether the intersection of two segments to judge whether p-point of judgment, whether the point q Polygon Polygon estimate Polygon area for convex hull graham scanning
Platform: |
Size: 12288 |
Author: henry |
Hits:
Description: 凸包算法的实现，用的控制台程序，不过已经能够说明问题了-convex hull algorithm for the realization of the console procedures, but has been able to illustrate the problem
Platform: |
Size: 236544 |
Author: bjsheng |
Hits:
Description: 算法分析课程中实现的凸包算法,效率很高,有很大的参考价值-algorithm analysis programs to achieve the convex hull algorithms, highly efficient and have great reference value
Platform: |
Size: 4758528 |
Author: zhangli |
Hits:
Description: 凸包算法，运用分治的思想，用opengl显示出来-convex hull algorithm, the idea of partition, with opengl show
Platform: |
Size: 25600 |
Author: wangmiao |
Hits:
Description: A game of triangle, it create convex hull nestedly and then does triangulation. Then player can play like GO.-triangle. it create convex hull and then does nestedly tri angulation. Then player can play like GO.
Platform: |
Size: 3062784 |
Author: nick huang |
Hits:
Description: Computational Geometry in C 书中的源代码
生成三维凸包-Computational Geometry book in the C source code generated 3D convex hull
Platform: |
Size: 8192 |
Author: industry pho |
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: 凹多边形凸分解（罗杰斯算法的扩展实现）
本程序实现了X，Y方向的凹多边形凸分解-Concave polygon convex decomposition (Rogers algorithm realize the expansion of) the procedure to achieve the X, Y direction of the concave polygon convex decomposition
Platform: |
Size: 4826112 |
Author: 天佑 |
Hits:
Description: 凸包算法在VC6下实现，使用MFC界面编程显示结果-Convex hull algorithm in VC6 achieved, the use of MFC programming interface shows the results of
Platform: |
Size: 61440 |
Author: hwx |
Hits:
Description: This my phd thesis for the WDM optical network optimization, which employs convex optimization techniques to solve the proposed integer problems. The computation complexity of my optimization framework is very low compared with other existing method and a performance bound is provided at the same time.
Platform: |
Size: 886784 |
Author: 张一鸣 |
Hits:
Description: l1-magic的matlab代码，l1-magic: Recovery of Sparse Signals
via Convex Programming-l1-magic of matlab code, l1-magic: Recovery of Sparse Signalsvia Convex Programming
Platform: |
Size: 365568 |
Author: wanghaisong |
Hits:
«
1
23
4
5
6
7
8
9
10
...
50
»