搜索资源列表
xiaoyin
- 这是一个简单的消隐算法，程序中利用了凸多面体和远近法来实现的-This is a simple blanking algorithm, the procedure of using a convex polyhedron and the distance method to realize the
24_165626_phongbump
- 该程序实现了图形学中经典的凹凸纹理映射算法。凹凸纹理映射是一种纹理混合方法，它可以创建三维物体复杂的纹理外观表面。普通的纹理映射只能模拟比较平滑的三维物体表面，难以显示表面高低起伏、凹凸不平的效果。凹凸纹理映射能够通过一张表示物体表面凹凸程度的高度图（称为凹凸纹理），对另一张表示物体表面环境映射的纹理图的纹理坐标进行相应的干扰，经过干扰的纹理坐标将应用于环境映射，从而产生凹凸不平的显示效果。-The program implementation of the graphics in the cl
new_sqp
- 通过对经典的lemke互补转轴算法求解含有等式约束的凸二次规划问题的分析，发现所得到的线性互补问题(lcp)可能是退化的．由lemke算法求解(lcp)问题的迭代过程，通过六个命题说明了含有等式约束的凸二次规划问题对应的(lcp)问题退化的原因，并对经典的lemke算法的迭代过程进行修正，提出了一种改进的lemke算法，这种算法能有效地搜索到含等式约束凸二次规划问题的最优解．-Through the classic Lemke complementarity algorithm shaft co
tubao
- 凸包问题~基于mfc的实现。界面粗糙点，实现了主要的功能~ -Convex hull problem ~ mfc based on the implementation. Rough interface, the implementation of the major functions of ~
DrawLine
- 输入多边形的各个顶点（凸多边形）绘出多边形并填充多边形-Importation of all polygon vertices (convex polygon) is drawn and filled polygon polygon
clip
- 利用vc++实现的裁剪功能，可实现凹多边形、凸多边形的线裁剪-Using vc++ implementation of the clipping function can be realized concave polygon, convex polygon of the line cutting
TrianglePro
- 输入n个点 判断是否能形成凸多边形 并给出三角划分-Enter the n points to determine whether to form a convex polygon and give triangulation
Geometry
- 用C++语言实现的各种计算几何算法, 如判断点是否在多边形内, 多边形凸凹性判断, 寻找点集凸包的卷包裹法,求简单多边形的重心,求从多边形外一点出发到该多边形的切线,判断线段是否相交等等! -Using C++ language implementation of a variety of computational geometry algorithms, such as point to determine whether the polygon, the polygon convexity
suc1
- 一个生成凸包的程序，欢迎大家分享，互相交流，彼此提高-Convex hull of a generation procedure, welcome everyone to share, communicate with each other, enhance each other
NonCvxGroupSparsity
- Non Convex Algorithms for Group Sparse Optimization by Angshul Majumdar @matlab central -Non Convex Algorithms for Group Sparse Optimization by Angshul Majumdar @matlab central
polygon
- Verify if a point is inside a polygon (convex and non-convex)
convexhull
- 用于求解凸包问题！包围所有的定点！ -Convex hull for the solution of the problem!
cvxmod-0.4.6.tar
- CVXMOD is a Python-based tool for expressing and solving convex optimization problems.
Convexhull
- 现有一硬件采集了人在一固定大小的平面上的压力中心点，采集了很多数据，现在要求用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
Fill
- 用于内存中任意四边形的填充,无论凹凸四边形都适用-Memory for arbitrary quadrilateral filling, whether it applies to all convex quadrilateral
lecture2-650
- Present a mathematical framework for discussing the topics in the remainder of the course Duality, Convex Hulls, Envelopes, Voronoi Diagrams, and Delauney Triangulations -Present a mathematical framework for discussing the topics in the remainder
DosImageN
- 包括单区域外边界跟踪、跨缝隙穿毛刺轮廓跟踪、边界平滑与规范化、生成区域凸包过程、微分图像二值化-Outside the region including the single-track border, cross-slot wear burr contour tracking, boundary smoothing and standardization, the process of generating the convex hull area, differential image bi
tuhanshu
- 详细的介绍了凸函数的一阶范数最优解问题,并且给出一实例-Detailed account of the convex function of the first-order optimal solution norm, and gives an example
cg
- 实现演示若干图形学算法，点生成线起色算法，Bezier，多边形切割，凸包计算等。-Demonstrate the achievement of a number of graphics algorithms, point improvement algorithm to generate line, Bezier, polygon cutting, convex hull calculation.
VB_Hull
- 凸包问题的VB实现，可以顺便设几个点，然后实现凸包的好、解决 -Convex hull problem of VB to achieve, you can set up a few points in passing, and then the realization of convex hull of the good solution