搜索资源列表
RectanglePacker
- To quickly discover these locations, the packer uses a sophisticated 41 /// data structure that stores the upper silhouette of the packing area. When 42 /// a new rectangle needs to be added, only the silouette edges need to be 43 /// analy
packing
- Rectangle Packing NP难问题求解，二维装箱问题代码-Rectangle Packing
cool picture editor
- 一个非常Cool的图像编辑软件，支持在图像中画椭圆、矩形、锥体、圆柱、不规则曲线，支持输入文本，使用橡皮擦，图像区域填充。- Extremely Cool image editing software, supports in the picture the picture ellipse, the rectangle, the cone, the column, the irregular curve, supports the input text, uses the eraser, t
ENCODINGMETHOD
- The sequence-pair was proposed to represent a rectangle packing and a placement, and is used to place modules automatically in VLSI layout design. Several decoding methods of sequence-pair were proposed. However, encoding methods are not foun
Knap
- 矩形条带装箱问题(RSPP)是指将一组矩形装入在一个宽度固定高度不限的矩形容器中，以期 获得最小装箱高度．RSPP理论上属于NP难问题，在新闻组版、布料下料以及金属切割等工业领域中 有着广泛的应用．为解决该问题，采用了一种混合算法，即将一种新的启发式算法—— 动态匹配算 法—— 与遗传算法结合起来．混合算法中，动态匹配算法能根据4类启发式规则动态选择与装填区域相 匹配的下一个待装矩形，同时将装箱后所需容器高度用遗传算法的进化策略进行优化．对2组标准测试 问题的计算结果表明，相
RectGreedy
- RSPP-矩形Packing算法的贪心算法求解-RSPP-Rectangle Packing Algorithm greedy algorithm
fibonacci-Packing
- 斐波那契装箱问题：给出以连续的前N个斐波那契数为边长的正方形，需要把他们装在一个长方形中，不允许有任何空隙，然后输出矩形的大小和每个正方形的左上角坐标，任意一个即可-Fibonacci packing problem: given a continuous first N Fibonacci side length of the square, they need to be installed in a rectangle, not allowed to have any gaps, then
RectangleBinPack
- More about rectangle bin packing
Rectangle Pack
- Rectangle Packing texture
二维矩形条带装箱问题的底部左齐择优匹配算法
- 针对二维矩形条带装箱问题提出了一种启发式布局算法，即底部左齐择优匹配算法（lowest—level left align bestfit，简称LLABF）．LLABF算法遵循最佳匹配优先原则，该原则综合考虑完全匹配优先、宽度匹配优先、高度匹配优先、组合宽度匹配优先及可装入优先等启发式规则．与BL（bottom-left），IBL（improved-bottom-left）与BLF（bottom—left-fill）等启发算法不同的是，LLABF能够在矩形装入过程中自动选择与可装区域匹配的下一个待