搜索资源列表
inpoly
- This code is described in \"Computational Geometry in C\" (Second Edition), Chapter 7. It is not written to be comprehensible without the explanation in that book. This program reads a polygon P followed by query points from stdin. The in
最优化作业C++源代码
- 用C++编的一些最优化作业中的程序,有Newton法,DFP法,共轭梯度法,单纯形法,内点法,外点法,内外点法,都能使用,我已经全部调试过了-C compile some of the most optimized operating procedures, Newton, DFP, conjugate gradient method, the simplex method, interior point method, the points outside the law, outside p
TextureLBP
- LBP纹理特征提取算法。首先将检测窗口划分为16×16的小区域（cell），对于每个cell中的一个像素，将其环形邻域内的8个点（也可以是环形邻域多个点，如图 3‑ 4. 应用LBP算法的三个邻域示例所示）进行顺时针或逆时针的比较，如果中心像素值比该邻点大，则将邻点赋值为1，否则赋值为0，这样每个点都会获得一个8位二进制数（通常转换为十进制数）。然后计算每个cell的直方图，即每个数字（假定是十进制数）出现的频率（也就是一个关于每一个像素点是否比邻域内点大的一个二进制序列进行统计），然
cubic-spline
- 三次样条插值，来自于数值分析方法一书 C Abstract: interpolate cubic spline profiles to given points. C cubic splines are piecewise cubic polynomials fitting the data C with continuous first and second derivatives at interior points C and second derivatives set
GL_shading_subdivide
- opengl下一个球体的细分过程，对图形学基础学习很有帮助-Curved surfaces are approximated by polygons How do we shade? Flat shading Smooth shading Two questions: How do we determine normals at vertices? How do we calculate shading at interior points?
interior_points
- Numerical Optimization, interior points
poj1066
- poj的试题 poj1066 直接求外墙上的各个点到终点的连线与内墙的焦点最小即可-poj' s questions poj1066 directly seek to various points on the external walls and the interior end of the connection can be the focus of the smallest
Contour-extraction
- 轮廓提取的目的就是获得图像的外部特征,是进行图像分析的有用手段之一.二值图像轮廓提取的算法非常简单,就是掏空内部点:如果原图中有一点为黑,且它的8个相临点都是黑色时,则将该黑点删掉-Contour extraction is to obtain the purpose of the external characteristics of the image, is useful for image analysis means of the binary image contour extrac
interior-angle
- delaunay三角剖分；3点定义涡环；内角；fortran语言- interior angle at a vertex defined by 3 points
Image-of-corrosion
- 图像的腐蚀，消除边界点，使边界向内部收缩-Image of corrosion, eliminating border points, so that the boundary to the interior contraction
InteriorPoint
- Solve a problem of Linear Program by the Interior Points methods. Function [x, Al, Z] = InteriorPoint(c0, x0, A0, b0, alpha, tol) Inputs - c0 -> initial coef. of O.F. x0 -> initial solution A0 -> initial con
wedge_grid
- MATLAB library which generates a grid of points over the interior of the unit wedge in 3D.