搜索资源列表
切割
- 这是一个分治解决的零件切割问题:给定一块宽度为W的矩形板,矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi,宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小?加上一个小界面-This is a solution to the partition cutting parts : a given width of the rectangular plate W, the height of rectangular plat
零件切割问题
- 给定一块宽度为W的矩形板,矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi,宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。要求求出一种切割法使得所使用的矩形板的高度h最小.用递归及分治法解此问题-given a width of the rectangular plate W, the height of rectangular plate unrestricted. Board is required from the respective cut ou
qg
- 递归与分治算法的应用.零件切割问题 给定一块宽度为W的矩形板,矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi,宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小? -recursive algorithm with the partition of the application. Parts mutilation given a width of the rectangular plate W, the h
回溯1
- 零件切割问题 给定一块宽度为W的矩形板,矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi,宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小? -parts mutilation to a fixed width of the rectangular plate W, the height of rectangular plate unrestricted. Board is required from the
分治
- 零件切割问题 给定一块宽度为W的矩形板,矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi,宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小? -parts mutilation to a fixed width of the rectangular plate W, the height of rectangular plate unrestricted. Board is required from the
fenzhi
- 零件切割问题: 给定一块宽度为W的矩形板,矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi,宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小? 任给一个输入实例,能输出切割所需要的实际高度并能用图形演示切割的过程-cutting parts : a given width of the rectangular plate W, the height of rectangular plate unrestri
batfilter
- 0.4db 截止频率为10khz, 30khz处最小阻带衰减为50db, 抽样频率为100khz的巴特沃兹滤波器.-0.4dB cut-off frequency of 10khz, 30khz Department minimum stopband attenuation for 50db, sampling frequency of 100kHz the巴特沃兹filter.
tanxin
- 算法设计与分析中贪心算法C++实现代码 包括但愿最短路径问题,哈弗曼编码,整数最有分解,最小生成树,最优分解,删数问题等-Algorithm Design and Analysis of greedy algorithm in C++ code, including the realization of hope that the shortest path problem,哈弗曼coding, the most integral decomposition, minimum spanning
M
- Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, endin
gco-v3.0
- 这是一种图割算法的实现,包含标签的设置、能量函数的构造以及最大流/最小割算法的实现-This is a graph cut algorithm, including the Settings tab, the structure and function of the maximum energy flow/minimum cut algorithm implementation
Puma-phase-unwrapping
- 利用图割方法(最大流最小割)进行相位解缠-Use graph cut method (maximum flow minimum cut) for phase unwrapping
active-graph-cuts
- 这是对最大流/最小割算法的改进方法的文献,希望对做这方面的有所启示-This is the maximum flow/minimum cut algorithm to improve the methods of literature, and I hope to do some inspiration in this regard
maxflowmincut
- 基于图论的图像分割——最大流最小割算法。内含最大流最小割算法通用matlab程序。-Maximum flow minimum cut algorithm- based on graph theory image segmentation. Maximum flow minimum cut algorithm contains generic matlab program.
maxflow-v2.22.src
- 由最大流最小割算法,求图的最大流。基于论文 “An Experimental Comparison of Min-Cut/Max-Flow Algorithms”-The maximum flow minimum cut algorithm, seeking maximum flow chart. Paper-based An Experimental Comparison of Min-Cut/Max-Flow Algorithms
match-.src
- 使用最小割最大流实现图割的立体匹配算法,建立匹配能量函数,构造网格图并求得最小值,匹配效率高时间短,内附说明文档及分析用法。 -The use of the maximum flow minimum cut graph cut algorithm for stereo matching, matching of energy function, and obtain the minimum mesh structure, high efficiency, short time, contai
Stoer-Wagner
- 一个新的求图的最小割的方法,Stoer-Wagner能够求得最佳分割方式,而且其速度很快。 -A new method for the minimum cut of the graph, Stoer-Wagner is able to get the best segmentation method, and its speed is very fast.
FindArt
- 求无向连通图的最小割点。用R.Tarjan发明的算法来实现的。该算法能够求出无向连通图中最小割点。-Seeking connected undirected graph minimum cut point. Algorithmically R.Tarjan invention to achieve. The algorithm can be obtained connected undirected graph minimum cut points.
maxflow
- 最大流分割程序,利用最大流最小割定理进行图像分割的matlab源码-Maximum flow segmentation program, using the maximum flow minimum cut theorem for image segmentation matlab source
3915745
- 在计算机视觉中的立体匹配算法 最大流最小割,最新的研究成果-In a stereo matching algorithm in computer vision, maximum flow minimum cut, the latest research results,,
最大流最小割算法算理
- 这是对图割graphcut的最大流最小割算法的讲解(This is the graph cut graphcut maximum flow minimum cut algorithm explained)