搜索资源列表
cpolygon
- 二维图形编程，多边行性质的判定，凹凸性，点和多边形的包含性，相交性-two-dimensional graphics programming, the multilateral nature of the trip to determine, embossing, point and polygon inclusive, intersection
C#射线法
- c#实现的点是否在多边形内的射线算法。核心算法已可以无问题运行，只需要对数据导入稍做改动即可使用。
Geometer.rar
- 线段及直线的基本运算 1. 点与线段的关系 2. 求点到线段所在直线垂线的垂足 3. 点到线段的最近点 4. 点到线段所在直线的距离 5. 点到折线集的最近距离 6. 判断圆是否在多边形内 7. 求矢量夹角余弦 8. 求线段之间的夹角 9. 判断线段是否相交 10.判断线段是否相交但不交在端点处 11.求点关于某直线的对称点 12.判断两条直线是否相交及求直线交点 13.判断线段是否相交，
PointInPolygon
- 这是一个判断点是否在多边形内的很漂亮的算法。-This is a point to determine whether the polygon is very beautiful algorithms.
PtInPolygon
- 采用射线法判断给定点与多边形的关系，数据文件存储在Excel文件中，判断结果直接回写Excel文件。-Ray method used to determine the relationship between fixed-point and polygon data file is stored in the Excel document, write-back to judge the results of Excel files directly.
test
- 点在多边形内判断，思想：点的做射线与多边形的交点个数。-Point in polygon judge thought: point to do ray intersection and the number of polygons.
area
- 实现计算多边形面积的功能。第一行输入多边形的顶点数。第二行以后按照次序依次输入坐标点（如“2 3”,代表X 坐标和Y 坐标，中间加入空格区分）-To achieve the function of calculating the polygon area. Enter the first line of the polygon vertices. After the second line followed in the order of the input coordinates of poi
maomao
- 判断点是否在多边形内的射线算法c++代码-To determine point-in-polygon-ray algorithm c++ code
TIN_Voronoi
- 构建离散点集的Voronoi图，算法大致流程:先构建Delaunay TIN,然后连接相邻三角形的重心记得Voronoi图，然后基于TIN的拓扑，构建Voronoi多边形的拓扑关系。-Construction of discrete point set Voronoi diagram algorithm for general processes: first, to build Delaunay TIN, then remember that the focus of a triangle c
InclusionTest
- 计算机图形学点在多边形内/外的判断，给出了一个例子，可以画任意的多边形，判断点是否在多边形内，可直接运行。-Computer graphics point in polygon inside/outside of the judge is given an example, you can draw an arbitrary polygon, point to determine whether the polygon can be directly run.
ninpoly
- 输入N个点的坐标，判断这N个点能否构成一个凸多边形-Enter the coordinates of N points, N points to determine whether this constitutes a convex polygon
apointandgiven
- 如何判断一个点与多边形的关系，的c语言实现过程-How to determine the relationship between a point and polygon
area
- 计算凸包面积，点集Q的凸包是指一个最小凸多边形，满足Q中的点或者在多边形边上或者在其内。-Calculate convex hull area。The convex hull of point set Q is a minimum convex polygon, to meet the Q of the point or polygon or in its inside edge
All
- 点在多边形内外的自动判断小程序，简单但是使用-Point in polygon automatically determine within and outside the applet, simple but with
dil
- 根据坐标 求出多边形面积的软件 只要输入个人点坐标 能求出多边形的面积-visual basic program of geography it is so easy to use
多边形扫描线填充原始算法
- 扫描线算法适合对矢量图形进行区域填充，只需要直到多边形区域的几何位置，不需要指定种子点，适合计算机自动进行图形处理的场合使用，比如电脑游戏和三维CAD软件的渲染等等。(The scan line algorithm for vector graphics regional filling, need only geometric position until the polygon, do not need to specify the seed point for automatic comp
JudgePointInPolygon
- 窗体实现多边形绘制并判断点是否在多边形内(Form to achieve polygon drawing, and determine whether the points in the polygon)
DrawPolygon
- 这是MFC界面画多边形，每点一次画一个点，双击完成画多边形。可以随意拉动多边形的角，改变多边形的形状，可用其来选中界面的一部分，多边形整体也可以移动。(This is the MFC interface drawing polygon, each point drawing one point at one time, double click to finish the polygon. The angle of the polygon can be pulled freely and the
判断点是否在多边形内
- matlab代码，判断二维空间中点是否在任意多边形内，包括凸多边形和凹多边形。
画可移动改变的多边形
- MFC界面画多边形，每点一次画一个点，双击完成画多边形。可以随意拉动多边形的角，改变多边形的形状，可用其来选中界面的一部分，多边形整体也可以移动。(MFC interface draws polygon, each point draws a point at a time, double-click to complete drawing polygon. You can pull the corners of the polygon at will to change the shape o