Location:
Search - convex
Search list
Description: Input : A set S of planar points
Output : A convex hull for S
Step 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return.
Step 2: Find a median line perpendicular to the X-axis which divides S into SL and SR SL lies to the left of SR .
Step 3: Recursively construct convex hulls for SL and SR. Denote these convex hulls by Hull(SL) and Hull(SR) respectively.
Step 4: Apply the merging procedure to merge Hull(SL) and Hull(SR) together to form a convex hull.
Time complexity:
T(n) = 2T(n/2) + O(n)
= O(n log n)
-Input: A set S of planar pointsOutput: A convex hull for SStep 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return.Step 2: Find a median line perpendicular to the X-axis which divides S into SL and SR SL lies to the left of SR. Step 3: Recursively construct convex hulls for SL and SR. Denote these convex hulls by Hull (SL) and Hull (SR) respectively.Step 4: Apply the merging procedure to merge Hull (SL) and Hull (SR) together to form a convex hull. Time complexity: T (n) = 2T (n/2)+ O (n) = O (n log n)
Platform: |
Size: 2048 |
Author: linru |
Hits:
Description: c语言计算几何
三角化 Ch1, Code 1.14
凸形外壳[2D] Ch3, Code 3.8
凸形外壳[3D] Ch4, Code 4.8
球 Chapter 4, Fig. 4.15
德劳内类型 Ch5, Code 5.2
...See *English version.-\Computational Geometry in C\ the book s recipe
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: 57344 |
Author: XJ |
Hits:
Description: Convex Optimization book. A useful and fundamental tool for all domain [image processing, network,...]
Platform: |
Size: 4826112 |
Author: DO Quoc Bao |
Hits:
Description: Convex constructed uisng Matlab
Platform: |
Size: 1024 |
Author: azizul azhar |
Hits:
Description: Graham convex hull sofware
Platform: |
Size: 8192 |
Author: azizul azhar |
Hits:
Description: 求空间点集的三维凸包。chull.cpp, chull.h。来自计算几何英文原著作者个人网站。-computer 3D convex hull of a set of points. The set of points are not on a same plane.
Platform: |
Size: 5120 |
Author: liuctic |
Hits:
Description: 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 a "rubber band" around all the points, and let it wrap as tight as it can. The resultant polygon is a convex hull.
Platform: |
Size: 12288 |
Author: NeeL |
Hits:
Description: ACM凸包标程,可以快速使用凸包的各种应用,满足需求。-ACM convex hull source file
Platform: |
Size: 2048 |
Author: 冯民 |
Hits:
Description: convex algorithm bodo
Platform: |
Size: 2048 |
Author: artavazd |
Hits:
Description: 实现凸多边形排样,使用临界多边形NFP判断两个凸多边形是否相交,使用启发式算法提高效率-It s a good implement of convex polygon stock.
Platform: |
Size: 728064 |
Author: 陈露 |
Hits:
Description: 斯坦福大学Grant和Boyd教授等开发的凸优化matlab工具箱,附我自己编写的一个简单示例。-Convex optimization toolbox(matlab)by Grant and Boyd in Stanford.
Platform: |
Size: 6920192 |
Author: 张飞 |
Hits:
Description: 关于求一个MESH的最小凸包围体 所谓凸体, 就是从凸体内任意一点,向周围发射线,都只此MESH相交一次。-MESH on the minimum for a convex body surrounded the so-called convex body, convex body from any point, to launch around the line, only this time MESH intersection.
Platform: |
Size: 1024 |
Author: renmo80 |
Hits:
Description: 在matlab环境下基于pocs(凸集投影)的图像重建-Based in the matlab environment pocs (convex projection) of image reconstruction
Platform: |
Size: 1024 |
Author: liuchen |
Hits:
Description: 凸包算法实现三角网的构建
Convex hull of the triangulation algorithm to build-Convex hull triangulation algorithm to build the Convex hull of the triangulation algorithm to build
Platform: |
Size: 1024 |
Author: 都海伦 |
Hits:
Description: Any convex optimization problem has geometric interpretation. If a given
optimization problem can be transformed to a convex equivalent, then this
interpretive benefit is acquired. That is a powerful attraction: the ability to
visualize geometry of an optimization problem. Conversely, recent advances
in geometry and in graph theory hold convex optimization within their proofs’
core.
Platform: |
Size: 2161664 |
Author: nakula |
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: 经典的凸优化分析英文书,在线性规划和非线性规划问题中应用广泛-Classic analysis of convex optimization, it is widely used in linear programming and nonlinear programming
Platform: |
Size: 4752384 |
Author: 孙磊 |
Hits:
Description: Linear matrix inequality, convex optimization
Platform: |
Size: 1039360 |
Author: thestranger1977 |
Hits:
Description: Convex Optimization Solutions Manual
Platform: |
Size: 1510400 |
Author: 張小明 |
Hits:
Description: about convex optimization
Platform: |
Size: 105472 |
Author: guri |
Hits:
«
1
2
3
45
6
7
8
9
10
...
50
»