-
1111222223333334444445533332345554
VC计算机图形学原理及算法教程
VC计算机图形学入门教程(VC theory and algorithms of computer graphics computer graphics tutorial Tutorial VC)
- 2013-11-18 15:30:26下载
- 积分：1
-
MyGraphBrian
我改写后的graphbrian类，原本支持柱状图饼图和折线图的，现在添加了对这些图的风格调整，主要是增加了调整绘图区背景色和文本背景的功能，还增加了把图片保存为bmp文件的功能，以便用其他软件方便的打印。(I would then graphbrian category, which originally supported the pie chart histogram and line graph, and now added to adjust the style of these plans, the main adjustment is to increase the drawing area background color and text background function, but also an increase of the picture saved as bmp files, in order to use other software to facilitate printing.)
- 2008-01-30 11:27:56下载
- 积分：1
-
imagejiansuo
图像处理的简单程序，适合初学者，自己好好看看(Simple image processing procedures, suitable for beginners, its a good look)
- 2010-05-28 16:14:09下载
- 积分：1
-
Camdemo
Camshift算法，即"Continuously Adaptive Mean-Shift"算法，是一种自适应的运动跟踪算法。它主要通过视频图像中运动物体的颜色信息来达到跟踪目的。(Camshift algorithm, namely " Continuously Adaptive Mean-Shift" algorithm is an adaptive motion tracking algorithm. It is primarily the color information of the object' s movement through the video images to achieve tracking purposes.)
- 2014-01-11 19:45:29下载
- 积分：1
-
wylovezbsf
一个用MFC实现的图象缩放程序,也有测试图片!(MFC with a picture zoom procedures, tests have pictures!)
- 2007-01-10 20:47:09下载
- 积分：1
-
yepian
为了研究植物的生长规律，应用数字摄影图像处理法对山楂叶面积进行无损测量，该方法采用数码相机在田间获取山楂叶子的数字图像，对所拍图像进行背景去除、二值化及中值滤波处理，然后利用Matlab软件编程．快速计算出叶子的面积。把这一面积同常用的叶纸称重法所测面积进行比较．结果基本相同，由此可见，数字摄影图像法测量叶面积，具有简单、准确、方便快捷的特点．这对数字农业的植物信息快速采集和利用具有重要的意义。 (
In order to study the growth pattern of plants, the application of digital photography and image processing method for nondestructive measurement of hawthorn leaf area, this method using a digital camera to obtain digital images of hawthorn leaves in the field, on the film image background removal, binarization and medianfiltered, and then using the Matlab software programming. Quickly calculate the area of the leaves. This area with the common leaf paper weighing measured by the area to compare. The results are basically the same, shows, digital photographic images method to measure leaf area, with a simple, accurate, and convenient features. This rapid acquisition and use of digital agricultural plant is of great significance.
In order to study the growth pattern of plants, the application of digital photography and image processing method for nondestructive measurement of hawthorn leaf area, this method using a digital camera to obtain digital images of )
- 2012-02-19 11:20:50下载
- 积分：1
-
IFC读写代码
说明： IFC文件格式读取和写出源码，目前该源码是1.0版本(IFC file format reads and writes the source code, which is currently version 1.0)
- 2020-09-16 14:17:55下载
- 积分：1
-
GA-FCM
遗传算法与FCM算法相结合实现图像分割，分割精度较好，速度较快(A combination of genetic algorithm and FCM algorithm to achieve image segmentation, segmentation accuracy is better, faster)
- 2012-06-05 09:06:01下载
- 积分：1
-
Sutherland_Cohen--Straight-cut
计算机图形学中小例子，MFC下实现Sutherland_Cohen直线段裁剪算法(Computer graphics small example)
- 2011-12-21 19:05:50下载
- 积分：1
-
algorithm-of-findpath
绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区
域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行
定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解
决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻
接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每
个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(In the process of embroidering, needle can not hang up for changing to a different area. Therefore, Embroider
problem could be abstract as a continuous area-filling work. Considering disperse area-filling methods can not process this
problem well. Based on geometry computing and graph theory, an algorithm of finding path of embroidering needle are
proposed in this paper. First, outline orientations are defined, and finding all local extreme points of inner outline on their
gravitational orientation to build sectioning lines so as to divide the picture. By using intersection point character the
overlap point problem was solved perfectly. Therefore, the picture is divided into some nodes which can be finished alone.
Then, based on connections of these nodes, an adjacency graph of nodes was built. Using half-Hamilton path or depth-first
search method, both embroidering sequence and direction of these nodes could be got from the graph. Finally, from a
defined start-point, end-point)
- 2012-12-09 23:26:22下载
- 积分：1
