搜索资源列表
DelaunayMesh
- 该程序实现了Delaunay三角剖分的过程，能够对任意多边形实现三角化，效果不错。-program of the Delaunay triangulation process, to the arbitrary polygon triangulation achieve good results.
polygon_decompose_lx
- 用户指定顶点，系统判定并分解该多边形为不重叠的多个三角形，并使所有三角形的边长和最小-vertex specified users, the system and determine the polygon decomposition of the number of non-overlapping triangles, make all the triangle and the length of the smallest
CalcArea
- 计算任意多边形面积，全Visual c++代码。-calculated arbitrary polygon area, the whole Visual c code.
new_cal_new
- 网格计算 多边形上的网格点个数 grid_onedge grid_inside-polygon grid computing on the number of grid points grid_onedge grid_inside
qiege_new
- //多边形切割 //可用于半平面交 //将多边形沿l1,l2确定的直线切割在side侧切割,保证l1,l2,side不共线-/ / polygon cutting / / can be used for half-plane AC / / will polygon along l1, l2 determined by the straight line cutting in the side cutting side, ensuring l1, l2, side not collinea
qie_ge_new
- 将多边形沿l1,l2确定的直线切割在side侧切割,保证l1,l2,side不共线-will polygon along l1, l2 cutting straight to determine the lateral side of the cutting, guaranteed l1, l2, side is not collinear
polyangles
- POLYANGLES Computes internal polygon angles. % ANGLES = POLYANGLES(X, Y) computes the interior angles (in % degrees) of an arbitrary polygon whose vertices are given in % [X, Y], ordered in a clockwise manner. The program eliminates %
duobianxing
- 最近学习计算机图形学,写了个多边形扫描转换算法,贴出来分享一下-Recent study in computer graphics, writing a polygon scan conversion algorithm, and pasted them to share
xyk
- 由键盘输入多边形的边数，求其内角和，可以用逐个数字进行试用。-Keyboard input from a number of polygon edges, and its angle and can be used by the figures for trial.
Planer_convex_hull
- 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
prjPolygonCentroid
- using this algorithm find out the Centroid of the Polygon
convex
- C++ code. Realization of an algorithm for finding an 2D convex hull polygon for input set of 2D points (with glut).
suanfa
- 多边形问题是计算几何的基本问题之一,在许多领域均有应用.本文研究在平面中生成任意边的凸多边形的算法,讨论了随机生成凸多边形顶点坐标的算法思想.-Convex polygon problem is one of the basic problems of computational geometry, in many fields. In this paper, an arbitrary edge in the plane of the convex polygon generating algo
GetArea
- 本程序可以读入由任意个点构成的多边形，并计算两个多边形的最大相交面积-The program can read any number of points by the composition of the polygon, and calculate the maximum intersection area of two polygons
testpolygon
- 返回值：输入的多边形是简单多边形，返回true 要 求：输入顶点序列按逆时针排序 说 明：简单多边形定义： 1：循环排序中相邻线段对的交是他们之间共有的单个点 2：不相邻的线段不相交 -polygon
Minimum-area-convex-polygon
- 凸多边形最小面积四边形包围盒算法，是计算最小面积最快的算法。-Minimum area convex polygon quadrilateral bounding box algorithm is the fastest algorithm to calculate the minimum area.
ForPolygonCala
- 多边形相关计算的一些算法！！！包括凹凸判断，点与多边形关系等-Polygon some algorithms related to computing! ! ! Include the uneven judgments, the relationship between point and polygon ... ... ... ...
Beg-polygon-area
- 求多边形的面积，程序要求必须顺序输入节点坐标-Polygon area, the program requires input nodes must coordinate in order
segmentand-polygon
- 判断线段和多边形的位置关系，包括线段在多边形里面，外面，部分在外面三种情况-Determine the position of the line and the polygon relationship, including line inside the polygon, outside, part outside of three case.
polygon
- 判断某一点是否在多边形内，很好的东西，-When deciding whether a point is in a polygon