资源列表
Voronoi1
- Voronoi图是以两点间线段的长度作为距离 ,对平面的一种分割。然而 ,在地理环境中 ,存在着许多自然的或人为的障碍 ,使得从一点到另一点不能直线到达。为了扩大Voronoi图的应用领域 ,本文对传统的Voronoi图进行扩充 ,给出了障碍Voronoi图的定义、性质 ,以及离散生成线段障碍Voronoi图的方法-Voronoi diagram based on the length of line between two points as the distance from a parti
101259358imgMathMorph
- 形态学运算的实现，包括腐蚀，膨胀，开启等运算。-xing tai xue
Monotone_polygon_partition
- 给定一个单调多边形，基于割耳朵算法，我们可以将这个多边形三角剖分-given a monotone polygon,based on the ear-cutting method, we can get a triangle partition.
boolPolygonInsection
- 用vc6.0实现的平面多边形布尔求交，任意输入两个多边形，可以求出它们的公共部分。-based on vc6.0,the bool intersection of two polygon is obtained,input two polygon,we can get their comcom parts.
OCR
- image processing show OCR
DirectFB-1.3.0.tar
- DirectFB 1.3. It relates to frame buffer driver.-DirectFB
B_Tree
- program b tree by C. you can run it on Borlan C 5.0
graphics
- pnx1500的2D图形处理，版本是NDK4.3-pnx1500 the 2D graphics processing
2D-graphics
- 演示使用矩阵实现二维图形的变换，没有很深的讲解，朋友们仅作参考-Demonstration of the realization of two-dimensional graphics using the matrix transformation
curve-surface
- 演示了几种常用的曲线和曲面，包括贝塞尔、B样条等，仅作参考-Demonstration of several commonly used curves and surfaces, including Bezier, B-spline and so on, only for reference
seedfilling
- 计算机图形学的种子填充，可实现种子填充算法。-Computer graphics filled seeds, seed fill algorithm can be realized.
midpoint
- 计算机图形学的区域填充的中点填充，算法可实现-Computer graphics to fill the mid-point of the region filling algorithm can be realized