搜索资源列表
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.
Draw
- 基于Visual C++ 6.0开发系统,仿制Windows画图软件,实现如下功能: 1. 动态绘制文本、直线、矩形、圆(椭圆)、多边形等基本图形; 2. 可以改变图形的颜色、粗细、线型(实线、虚线、点划线等); 3. 可以实现图形的剪切、复制、粘贴、缩放(全部或指定区域)等基本编辑功能; 4. 基本的图形保存、打开、显示等功能;-Based on Visual C++ 6.0 development system, generic Windows drawing softwar
exer2
- 多边形有效边表填充算法的实现,设计了活性边表、桶的数据结构,利用动态链表实现了填充算法。在VC6.0下实现。-Effective edge polygon fill algorithm implementation table, side table designed activity, the data structure barrels, the use of dynamic linked list implementation of the filling algorithm. At un
liang-barsky
- Weiler-Atherton算法实现多边形裁剪-Weiler-Atherton polygon clipping algorithm
TestMinvexCore
- 求点集的最小凸包Graham算法。给定平面上的一个点集,找出一个最小点集顺次连结形成一个凸多边形,使得点集中的点皆在此多边形内或此多边形上,这个凸多边形就是给定点集的 二维凸包。-The smallest point set for convex hull algorithms Graham. Given a planar point set, find a link to the smallest sequence set to form a convex polygon, the po
ScanLineFillAlgorithm
- 扫描线填充算法画多边形 说明: 可以是边相交的多边形-Scan Line Fill Algorithm
image
- 对图像进行处理,直接在RGB图片上画直线,矩形,多边形,写字。-Image processing, including the pictures directly on the RGB lines, rectangles, polygons, write.
PolygonFill
- 使用C++和OpenGL实现的多边形填充。 -The use of C++ and OpenGL Polygon Fill realize.
points
- 给出平面上一组顶点的坐标,计算出它们所围成的凸多边形的面积-failed to translate
doublefox_petrel-poly
- 用于石油地质,可将双狐中的断层多边形转化为petrel可识别加载的Polygen-Used in petroleum geology can be double-fault of Fox polygon into identifiable petrel loaded Polygen
2
- openGL 编写的多边形应用程序,可以存储和调入多边形,能移动选择的多边形的位置-openGL polygon write applications that can be stored and transferred to polygons, the polygons can move the location of choice
Graphic
- 计算机图形学中用经典算法实现的绘图程序,包括直线生成、圆弧生成、线段裁剪、多边形裁剪等-Computer graphics with the classic algorithm of mapping procedures, including a straight-line generation, arc formation, line cutting, cutting, such as polygon
tianchong
- 实现多边形区域扫描线填充的有序边表算法,并将实现的算法应用于任意多边形的填充,多边形的顶点可由键盘输入或鼠标拾取,填充要准确,不能多填也不能少填。 要求掌握边形区域扫描线填充的有序边表算法的基本原理和算法设计,画出算法实现的程序流程图,使用C或者VC++实现算法,并演示。 -Scan-line polygon fill the region to achieve the orderly side of the table algorithm, and the algorithm is a
test
- 点在多边形内判断,思想:点的做射线与多边形的交点个数。-Point in polygon judge thought: point to do ray intersection and the number of polygons.
Todeterminewhetherthepolygonpoints
- 利用射线法判断点是否在多边形内,算法的执行效率高-To determine whether the polygon points
GetArea
- 一个球求多边形面积的VC++源码,求多边形的面积有梯形法和三角形法,本程序采用梯形法-Polygon area of a ball for the VC++ source code, and the area of polygons and triangle trapezoid method, trapezoidal method using the procedure
polygonfill
- 晕线多边形填充,课堂实验题目,可以画多边形,也可以加载多边形文件-Halo line polygon fill, classroom test subject, you can draw polygons, you can also load the polygon file
MyPolyStock
- 实现凸多边形排样,使用临界多边形NFP判断两个凸多边形是否相交,使用启发式算法提高效率-It s a good implement of convex polygon stock.
PolygonFill
- 实现多边形的种子及扫描线的填充算法,同时实现画圆 、直线的功能-To realize Polygon fill and Ellipse 、Line