搜索资源列表
voronoi
- 一个绘制Voronoi图和Delauany三角剖分的程序，并且给出了求凸包的算法。该程序可以演示如何进行三角剖分，帮助你理解整个剖分过程。-a Voronoi diagram mapping and triangulation Delauany procedures, and is seeking a convex hull algorithms. The procedure can demonstrate how triangulation, and help you understand t
裁剪11
- 图形学中的裁剪算法。其中有矩形裁剪，和凸多边形裁剪。-Graphics cutting algorithm. These rectangular cutting, and cutting convex polygon.
xiaoyin
- 这个一个图形消隐的小程序，包括了凸多面体和远近法-the graphics blanking a small procedures, including a convex polygon and distances France
tuxingxueshiyan4
- 1.实验目的 1、通过本次实验，掌握三维图形的旋转等变换和消隐的基本概念和相关算法。 2、掌握凸多面体的消隐算法和实现。 3、进一步熟练和掌握编程环境中三维图形的绘制和消隐的程序设计方法。 2.实验内容 1、绘制一个三维几何图形，如：球、立方体、棱柱、棱锥等。 2、对绘制的三维几何图形实现平移、旋转、变比的基本变换。 3、编程实现凸多面体的隐藏面和隐藏线的消隐。 -1. The experiment was a passage of this experiment
PolygonDecompose
- 二维简单多边形凸分解源代码以及详细的使用说明-Two-dimensional simple convex polygon decomposition of the source code and instructions
a_simple_2d_cad_system_with_dynamic_capture_functi
- 一个具有动态捕捉功能的简易2dCAD系统，能灵活绘制一般的简单图形，同时能检测多边形的方向和凹凸性以及点和多边形的关系-A simple 2d CAD dynamic capture system, the flexibility to draw simple graphics in general, but can detect the direction and the concave and convex polygons, and the relationship between poi
shiqu
- 绘制任意凸多边形 逝去此凸多边形 对此凸多边形填色-Passing this to draw an arbitrary convex polygon convex polygon convex polygon fill this
CSharp-Draw
- 计算机图形学的vc++程序示例 含二维线画图元、二维线填充图元、线段裁切、多边形裁切、二维图形变换、三维图形变换、凸多面体的建模、透视投影，隐藏面的消除及基本图形变换（平移、旋转、缩放）、曲线移动、曲线清除等。-Computer graphics vc++ sample program with two-dimensional line drawing dollars, two-dimensional line fill pixel, line cutting, cutting polygo
333
- 求凸多边形最优三角剖分。用动态规划问题有效解决该问题。多边形是平面上一条分段线形封闭曲线。-Optimal convex polygon triangulation. Dynamic programming problem with an effective solution to the problem. Sub-polygon is a plane closed curve linear.
Two-dimensional
- 二维凸包程序算法历史进程 算法demo 比较 比较好的学习凸包算法资料-Two-dimensional convex hull program algorithm historical process algorithm demo better learning convex hull algorithm data
ConvexHull
- 多边形凸壳构造,方便快捷效率高，可以用于理算点、多边形图客构造-Polygon Convex Hull Construction
graham
- Graham s scan algorithm for finding convex hull using linked list.
jarvin
- Jarvis march algorithm for finding convex hull using linked list