Location:
Search - interior points
Search list
Description: 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 input format is:
n
x0 y0
x1 y1
...
xn-1 yn-1
qx qy
qx qy
qx qy
...
For each query point q, InPoly returns one of four char s:
i : q is strictly interior to P
o : q is strictly exterior to P
v : q is a vertex of P
e : q lies on the relative interior of an edge of P
These represent mutually exclusive categories.
For an explanation of the code, see Chapter 7 of
\"Computational Geometry in C (Second Edition).\"
Platform: |
Size: 3166 |
Author: fds |
Hits:
Description: 用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 point method can use, I have all over Debugging
Platform: |
Size: 12986 |
Author: tw |
Hits:
Description: 用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 point method can use, I have all over Debugging
Platform: |
Size: 12288 |
Author: tw |
Hits:
Description: 图像细化的方法有两种即边缘点删除和内点保留传统的基于边缘点删除的细化算法在细化过程中只对边缘点的可删除性进行判断并作相应处理由于受跟踪顺序及所考察邻域的影响容易产生骨架的非对称性基于内点保留的细化算法容易使所获得的骨架大于一个像素本文在分析上述两类细化算法的基础上综合运用上述两种细化方法提出一种新的行之有效的并行细化算法.-Image Thinning There are two ways to delete that edge points and inner points to retain the traditional delete edge points based on the thinning algorithm in the refinement process only to the edge points can be carried out to determine and delete accordingly deal with the order because of tracking and examined the impact of neighborhood prone to asymmetric skeleton reservation-based interior-point thinning algorithm easily get more than a skeleton pixels Based on the analysis of these two types of thinning algorithm based on the comprehensive use of the two refinement method presents a new parallel thinning algorithm effective.
Platform: |
Size: 252928 |
Author: poon |
Hits:
Description: 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 input format is:
n
x0 y0
x1 y1
...
xn-1 yn-1
qx qy
qx qy
qx qy
...
For each query point q, InPoly returns one of four char s:
i : q is strictly interior to P
o : q is strictly exterior to P
v : q is a vertex of P
e : q lies on the relative interior of an edge of P
These represent mutually exclusive categories.
For an explanation of the code, see Chapter 7 of
"Computational Geometry in C (Second Edition)."
Platform: |
Size: 3072 |
Author: fds |
Hits:
Description: 三次样条插值，来自于数值分析方法一书
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 to zero at and beyond the end points.-Cubic Spline Interpolation
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 to zero at and beyond the end points.
Platform: |
Size: 1024 |
Author: mybiandou |
Hits:
Description: 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?
Platform: |
Size: 116736 |
Author: neekazhang |
Hits:
Description: Numerical Optimization, interior points
Platform: |
Size: 1024 |
Author: ehwa |
Hits:
Description: 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
Platform: |
Size: 1024 |
Author: Fusion |
Hits:
Description: LBP纹理特征提取算法。首先将检测窗口划分为16×16的小区域（cell），对于每个cell中的一个像素，将其环形邻域内的8个点（也可以是环形邻域多个点，如图 3‑ 4. 应用LBP算法的三个邻域示例所示）进行顺时针或逆时针的比较，如果中心像素值比该邻点大，则将邻点赋值为1，否则赋值为0，这样每个点都会获得一个8位二进制数（通常转换为十进制数）。然后计算每个cell的直方图，即每个数字（假定是十进制数）出现的频率（也就是一个关于每一个像素点是否比邻域内点大的一个二进制序列进行统计），然后对该直方图进行归一化处理。最后将得到的每个cell的统计直方图进行连接，就得到了整幅图的LBP纹理特征-LBP texture feature extraction algorithm. First detection window is divided into 1616 small area (cell), one pixel in each cell, its circular neighborhood of 8 points (You can also ring neighborhood, as shown in Figure 3-4 example of application of the LBP algorithm, three neighborhood shown) clockwise or counterclockwise, the center pixel value than the adjacent points, then adjacent points assigned to 1, otherwise the assignment is 0, so that each point will an 8-bit binary number (usually converted to a decimal number). And then computing the histogram of each cell, each number (assuming that is a decimal number) the frequency (that is, one on each pixel next to the interior point for a binary sequence of statistics), then the histogram normalized. Finally, get the histogram of each cell to connect, to get the whole image of the LBP texture features
Platform: |
Size: 4096 |
Author: nana |
Hits:
Description: 轮廓提取的目的就是获得图像的外部特征,是进行图像分析的有用手段之一.二值图像轮廓提取的算法非常简单,就是掏空内部点:如果原图中有一点为黑,且它的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 extraction algorithm is very simple, the hollowed interior points: If the original point for the black, and 8 adjacent points are black, and delete the black spots
Platform: |
Size: 5120 |
Author: Robin |
Hits:
Description: delaunay三角剖分；3点定义涡环；内角；fortran语言- interior angle at a vertex defined by 3 points
Platform: |
Size: 54272 |
Author: ake |
Hits:
Description: 图像的腐蚀，消除边界点，使边界向内部收缩-Image of corrosion, eliminating border points, so that the boundary to the interior contraction
Platform: |
Size: 16142336 |
Author: 杨鹏杰 |
Hits:
Description: 1、一个比较简单的php留言板，内部设有一个“个人空间”，以便给用户查看管理自己的个人留言等信息.。
2、管理员（超级用户）可以在安装的时候设置。
3、由于留言板不是太复杂，所以除了“个人空间”外，就没有写其他管理的后台，管理员登陆后，可以直接在留言展示页面管理其他用户的留言，当然，对于留言来说，管理员多的权限就是“删除”其留言。
4、系统中用户共分为38个军衔，每10个积分就会升官-1, a relatively simple php message boards, interior features a personal space in order to manage their own users to view personal messages and other information ..
2, the administrator (super-user) may be provided at the time of installation.
3, the message board is not too complicated, so in addition to personal space , but there is no write other management background, the administrator login, you can display a message directly to the page management of other user s message, of course, for the message, the management multi-member authority is the delete his message.
4, users of the system is divided into 38 ranks, each of 10 points will be promoted
Platform: |
Size: 2251776 |
Author: xxpudn31 |
Hits:
Description: 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 constraints
b0 -> limits of constraints
alpha -> adjust
tol -> maximum error
Output
x -> optimal solution
A -> final constrainsts
Z -> optimal value of Objetive Funcion (F.O.)
Creates a text file with every step until the final solution.-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 constraints
b0 -> limits of constraints
alpha -> adjust
tol -> maximum error
Output
x -> optimal solution
A -> final constrainsts
Z -> optimal value of Objetive Funcion (F.O.)
Creates a text file with every step until the final solution.
Platform: |
Size: 1024 |
Author: Claudius |
Hits:
Description: MATLAB library which generates a grid of points over the interior of the unit wedge in 3D.
Platform: |
Size: 2048 |
Author: alidadgh
|
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:
Description: Numerical approximation to Poisson’s equation over the square [a,b]x[a,b] with Dirichlet boundary conditions. Uses a uniform mesh with (n+2)x(n+2) total points (i.e, n x n interior grid points).
Platform: |
Size: 1004 |
Author: kk2021 |
Hits: