搜索资源列表
Bresenham算法
- Bresenham算法演示程序。该例程使用Bresenham算法画出一个凸四边形。-Bresenham algorithm demonstration program. Routine use of the Bresenham algorithm to identify a convex rectangular.
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
SortPoint
- 如何将无序的多边形顶点集合，排序成逆时针顺序!这个正是凸包算法前面的一些准备工作!-how to disorderly polygon vertex assembly, sequencing into a counter-clockwise order! This is why the convex hull algorithm front of some preparation work!
LMSJ技术
- 使学生掌握凸多面体的Roberts消隐法，掌握三维图形的深度缓存算法消隐技术，了解多边形区域的排序算法和列表优先算法的消隐技术。掌握利用简单光反射模型进行三维图形的明暗处理。了解整体光照模型、光透射模、光线跟踪算法，了解物体间的漫反射-enable students to master the convex polygon Roberts blanking France, grasp the depth of 3D graphics algorithms hidden cache technol
裁剪11
- 图形学中的裁剪算法。其中有矩形裁剪，和凸多边形裁剪。-Graphics cutting algorithm. These rectangular cutting, and cutting convex polygon.
TSP_G
- 利用凸包的原理,求解70个城市的旅行商问题.用Matlab实现-use of convex hull of principle, solving 70 cities in the TSP. Using Matlab
hulline
- 凸壳算法用了少许opengl,有交互界面，操作简单，用鼠标就可以完成。-convex hull algorithm with a bit opengl, interface, simple operation, using the mouse can be completed.
多个凸多面体
- 画凸多面体，看过之后你就懂得如何来实现那一个功能-painting convex polygon, after reading you know how to achieve it a functional
xiaoyin
- 这个一个图形消隐的小程序，包括了凸多面体和远近法-the graphics blanking a small procedures, including a convex polygon and distances France
geometry_algorithm
- 各种关于几何的算法实现。包括 计算几何学库函数（线相交，面积等等） 寻找凸包 graham 扫描法 判断点是否在多边形内。同时包含一些测试-on various geometric algorithm. In terms of geometry library functions (lines intersect, size, etc.) for convex hull graham scanning judgment and whether the polygon. Both co
ConvexHall
- ConvexHall实现 3D Convex Hall implementation: Given N points in the space, the algorithm display the construction of the convex hall.-ConvexHall Convex 3D Hall implementati on : Given N points in the space, the algorithm display the construction of t
Gramham-CH
- Gramham法求解凸包。从最基本数据结构定义开始实现，有图形界面和动画演示。全套代码。-Gramham method convex hull. Data from the most basic definition of the structure began to realize, graphics and animation interface demo. A full set of code.
Hullproduce
- 计算几何中凸包的生成，也是计算机图形学中的一个重要的算法实现-convex geometry calculation packet generation, as well as computer graphics of an important algorithm
CircleGiftWrap
- 计算几何中，用VC++实现的求点集凸包的包裹算法-computational geometry, with VC point for the collection of parcels convex hull algorithm
geometry_c++
- 计算几何学常用算法库 C++语言实现 代码内容 计算几何学常用算法库，包括以下算法： 确定两条线段是否相交 判断点p是否在线段上 判断点q是否在多边形Polygon内 计算多边形的面积 寻找凸包 graham 扫描法 -geometry calculation commonly used algorithm for C language code as calculated geometry commonly used algorithm li
tubaoTest
- 凸包算法的实现，用的控制台程序，不过已经能够说明问题了-convex hull algorithm for the realization of the console procedures, but has been able to illustrate the problem
bumpball
- 利用VC实现对凹凸影射的编程，使用的是DirextX开发包- Using the VC realization to the programming which concave-convex insinuated, the use is the DirextX development package
hull
- 一个相当不错的凸包生成程序，对大家学习有挺好的帮助-a pretty good convex hull generation procedures, we have very good learning with the help of
cvx-w64
- cvx是一个用于构建和解决严格凸规划的建模框架(CVX: A system for disciplined convex programming.)
Convex Optimization 习题及题解
- Additional Exercises for Convex Optimization Stephen Boyd Lieven Vandenberghe March 18, 2016 凸优化课后习题答案，包含17章共623页