登录
首页 » Visual C++ » Project 1

Project 1

于 2018-03-07 发布 文件大小:1055KB
0 194
下载积分: 1 下载次数: 5

代码说明:

  1. Image reduction: ? Alternative line reduction ? Fractal linear reduction to reduce images to any smaller size 2. Use two images to perform image enlargement: ? Pixel replication ? Nearest enlargement ? Bilinear interpolation ? Bicubic interpolation ? Fractal linear expansion to expand images to any larger size 3. Perform negative image operation ? On gray images ? On color images(1. Image reduction. 2. Use two images to perform image enlargement. 3. Perform negative image operation.)

文件列表:

Project 1\main.cpp, 11544 , 2017-10-10
Project 1\main.h, 210 , 2017-10-10
Project 1\Project 1.pdf, 1094514 , 2017-10-09
Project 1, 0 , 2018-03-07

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Tetris
    说明:  vc++做的俄罗斯方块游戏,具有统计分数,级别 设置。(vc++ to do the Tetris game, with a statistical score, level setting.)
    2011-04-14 14:25:52下载
    积分:1
  • sdk_jyt
    说明:  用SDK写的劲乐团游戏 对学SDK很有帮助(using the SDK to write strong game Orchestra SDK helpful for school)
    2006-04-12 20:14:38下载
    积分:1
  • postdata
    获取multipart/form-data形式上传文件的函数(Get multipart/form-data forms to upload files function)
    2013-08-29 17:03:31下载
    积分:1
  • addressbook
    通讯录管理系统 ,c语言 ,动态链表和结构体,课程设计(Address Book)
    2011-06-19 11:54:58下载
    积分:1
  • closest_pair
    分治法思想,求最邻近点对,考虑将所给的n个点的集合S分成2个子集S1和S2,每个子集中约有n/2个点,然后在每个子集中递归地求其最接近的点对(Divide and conquer ideas, find the nearest point to consider given the set S of n points into two subsets S1 and S2, each subset of about n/2 points, and then recursively find its focus in each sub-the closest point)
    2013-12-07 16:46:26下载
    积分:1
  • IDM_Universal_Crack
    说明:  Lavxabhahab sjiius s d dwosisis dvvd
    2020-06-24 23:31:08下载
    积分:1
  • wei
    说明:  简单计算器.热爱C++,但还是学生,故来此向大家学习。谢谢。(simple calculator)
    2011-03-16 18:26:15下载
    积分:1
  • vb-supermario
    用VISUAL BASIC编写的超级马里奥(supermario by VISUAL BASIC)
    2013-10-15 12:06:00下载
    积分:1
  • 二维码
    说明:  用于视觉检测 使用前转换为docx格式以保证正常使用(Used in Visual Detection)
    2020-06-20 08:40:01下载
    积分:1
  • BT
    说明:  B树部分实现。在B-树中查找给定关键字的方法是,首先把根结点取来,在根结点所包含的关键字K1,…,Kn查找给定的关键字(可用顺序查找或二分查找法),若找到等于给定值的关键字,则查找成功;否则,一定可以确定要查找的关键字在Ki与Ki+1之间,Pi为指向子树根节点的指针,此时取指针Pi所指的结点继续查找,直至找到,或指针Pi为空时查找失败。(BTree data structrue)
    2017-12-09 22:03:02下载
    积分:1
  • 696518资源总数
  • 106268会员总数
  • 10今日下载