搜索资源列表
mypolygon
- 多边形常用算法模块 1. 判断多边形是否简单多边形2. 检查多边形顶点的凸凹性 3. 判断多边形是否凸多边形 4. 求多边形面积5. 判断多边形顶点的排列方向，方法一 6. 判断多边形顶点的排列方向，方法二 7. 射线法判断点是否在多边形内8. 判断点是否在凸多边形内-Does the polygon commonly used algorithm module 1. judgements polygons whether simple polygon. 2. inspections polyg
mypolygon2
- 8. 判断点是否在凸多边形内 9. 寻找点集的graham算法 10.寻找点集凸包的卷包裹法 11.判断线段是否在多边形内 12.求简单多边形的重心 13.求凸多边形的重心14.求肯定在给定多边形内的一个点15.求从多边形外一点出发到该多边形的切线16.判断多边形的核是否存在-8. In judging whether a convex polygon 9. Find points of graham algorithm 10. Find point set of convex hull vol
Fillin
- 区域填充法填充多边形。鼠标交互输入多边形边界。无解压密码-filled polygon. Mouse interactive input polygon boundary. Without extracting passwords
scanexample
- 基于opengl的多边形扫描算法演示系统，可以演示出多边形填充过程中扫描线扫描的结果，动态的演示出来。-on opengl polygon scan algorithm demonstration system that can demonstrate Polygon Fill out the process of scanning line scan results, dynamic demo out.
gfdds
- 本原代码集是对计算机图形学的编程实践，包括画直线、反走样直线、画圆、画椭圆、画矩形、画多边形、矩形填充、多边形填充、3D变换、光照、贴图等。出于简化编程的考虑，许多地方指定了常数，未做通用处理。解压缩后建立gui16目录，在其下有原代码和工程文件。在gui16下建立release目录，其下有一可执行文件及其所须的位图及模型文件。如在release目录之外执行程序，必须复制所需位图及模型文件。内含-primitive code of computer graphics programming pr
polygon-union
- 求两个多边形交集的程序，使用计算几何实现的，值得学习-intersection of polygons for the two procedures, the use of computational geometry to achieve, and worth learning
任意多边形关于任意直线的对称变换
- 这是关于任意正多边形关于任意直线的对称变换，打破了以前的只能对于一个固定的直线的对称变换，省去了关于固定直线对称时每次都要输入的麻烦-of arbitrary isogon of arbitrary linear symmetry transformation, breaking the former only for a fixed linear symmetry transformation, eliminating the symmetry of the fixed line every
任意多边形的平移变换和旋转变换
- 此程序主要是根据实际的需要，把对于一个任意正多边形的平移变换和旋转变换集合在一起，省去了每次变换时调用多个程序的麻烦-this procedure is mainly based on actual needs, and for an arbitrary isogon transform the translation and rotation transform get together to save a time when the transformation of a number of
kqf
- 关于vc里画图形的程序。包括画多边形，错切，裁剪，旋转，变换，填充等等的操作。还包括中点画线算法等。-on vc Lane painting graphics procedures. Polygon, including painting, wrong cutting, cutting, rotating, transform, filled out the operation. Also included were dotted line algorithm.
apoly
- renyiduobianxing 任意多边形面积-It uses for calculating the area of any polygon.
DDA_line
- 与计算机图形学有关，DDA划线法，可以划直线，调用可划多边形-with the computer graphics, DDA crossed, we could draw a straight line, polygon call to be designated
Chap4
- vc编写三惟投影变换以及二为线段以及多边形裁减！-A 3D projection transform,2D segment of line and polygon cut down programed with vc
二维图形系统
- 二维绘图程序，可实现基本的绘图，如直线，圆，多边形等等，可对图形填充、移动等基本操作-2D mapping, which enables the basic graphics, such as straight lines, circles, polygons, etc., can be filled right graphics, mobile and other basic operation
tianchong
- 任意多边形的填充,只要输入N个点,然后用鼠标实现.-arbitrary polygon filling, as long as the importation of N points, and then use the mouse to achieve.
184526345
- 本原代码集是对计算机图形学的编程实践，包括画直线、反走样直线、画圆、画椭圆、画矩形、画多边形、矩形填充、多边形填充、3D变换、光照、贴图等。出于简化编程的考虑，许多地方指定了常数，未做通用处理。解压缩后建立gui16目录，在其下有原代码和工程文件。在gui16下建立release目录，其下有一可执行文件及其所须的位图及模型文件。如在release目录之外执行程序，必须复制所需位图及模型文件。内含r-primitive code of computer graphics programming p
完整的画图程序
- 二维画图程序，包括画直线，圆，多边形，曲线，随手画等，还可以写文本。是图形学很好的演示程序。-2D drawing program, including painting straight lines, circles, polygons, curves, such as finger painting, but also wrote the text. Graphics is a good demonstration program.
计算机图形算法演
- 计算机图形算法演示 包括画直线、反走样直线、画圆、画椭圆、画矩形、画多边形、矩形填充、多边形填充、3D变换、光照、贴图等。-computer graphics algorithms demonstration included painting line, anti-aliasing straight Circle, painted oval, rectangular painting, drawing polygon, rectangle filling, polygon filling, 3
CPolygonLib
- 一个封装了GPC（经典的多边形逻辑运算的库），并且包含求多边形方向、重心、多边形面积、点与多边形关系的功能-a package of GPC (Polygon classic logic operation of the library), and contains polygon seeking direction and the center, polygon area, point and polygon relations function
多变形填充
- 本程序是一个填充多边形的程序，采用逐行扫描，并判断是否在多边形内，若是，则填充颜色，反之不填充。-this procedure is a process filled polygons, progressive scan and determine whether the polygon, and if so, were filled with color, contrast not filled.
三.非自交多边形扫描转换及区域填充扫描线算法
- 二维非自交多边型的扫描转换算法及区域填充算法-two-dimensional self multilateral type of scan conversion algorithm and regional filling algorithm