Description: 一个非常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, the picture
region packing. Platform: |
Size: 222208 |
Author:none |
Hits:
Description: In the rectangle packing problem, encoding schemes
to represent the placements of rectangles are the key
factors determining the efficiency of algorithms. SEQP
AIR is one of the most sophisticated encoding sheme,
which has been considered to have a small solution
space Platform: |
Size: 280576 |
Author:aditi2000 |
Hits:
Description: 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 found except the original one called “gridding”. Platform: |
Size: 101376 |
Author:aditi2000 |
Hits:
Description: 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 /// analyzed to find the position where the rectangle would achieve the lowest
44 /// placement possible in the packing area.- 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 /// analyzed to find the position where the rectangle would achieve the lowest
44 /// placement possible in the packing area. Platform: |
Size: 22528 |
Author:shaky |
Hits:
Description: 矩形条带装箱问题(RSPP)是指将一组矩形装入在一个宽度固定高度不限的矩形容器中，以期
获得最小装箱高度．RSPP理论上属于NP难问题，在新闻组版、布料下料以及金属切割等工业领域中
有着广泛的应用．为解决该问题，采用了一种混合算法，即将一种新的启发式算法—— 动态匹配算
法—— 与遗传算法结合起来．混合算法中，动态匹配算法能根据4类启发式规则动态选择与装填区域相
匹配的下一个待装矩形，同时将装箱后所需容器高度用遗传算法的进化策略进行优化．对2组标准测试
问题的计算结果表明，相对于文献中的已有算法，提出的算法更加有效．-Given a set of small rectangular pieces of different sizes and a rectangular container of fixed
width and infinite length，the rectangular strip packing problem (RSPP) consists of orthogonally
placing all the pieces within the container，without overlapping，such that the overall length of the
packing is minimized． RSPP belongs to NP—hard problem in theory and has many industrial
applications such as the composition of news，the cutting of elothing and the cutting of metal，etc．To
solve the rectangular strip packing problem ，a hybrid algorithm ，which combines a novel heuristic
algorithm- dynamic—fit heuristic algorithm (DFHA)，with the genetic algorithm，is adopted． The
DFHA algorithm can dynamically select the better-fit rectangle for packing，according to the width—fit
first(W FF)rule，the height—fit first(HFF) rule，the placeable first(PF) rule，and the biggest—
rectangle first(BRF)rule，and the evolutionary capability of genetic algorithm is used to optimize the
height of the packing Platform: |
Size: 477184 |
Author:郭事业 |
Hits:
Description: 斐波那契装箱问题：给出以连续的前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 the size and output of each rectangle the coordinates of the upper left corner of the square, any one can Platform: |
Size: 233472 |
Author:junshow |
Hits:
Description: 针对二维矩形条带装箱问题提出了一种启发式布局算法，即底部左齐择优匹配算法（lowest—level left align bestfit，简称LLABF）．LLABF算法遵循最佳匹配优先原则，该原则综合考虑完全匹配优先、宽度匹配优先、高度匹配优先、组合宽度匹配优先及可装入优先等启发式规则．与BL（bottom-left），IBL（improved-bottom-left）与BLF（bottom—left-fill）等启发算法不同的是，LLABF能够在矩形装入过程中自动选择与可装区域匹配的下一个待装矩形．计算结果表明，LLABF结合遗传算法（genetie algorithm,简称GA）解决二维条带装箱问题更加有效．(A heuristic placement algorithm for two-dimensional rectangular strip packing problem is proposed, which is called bottom-level left align best fit algorithm (LLABF). Different from BL (bottom-left), IBL (improved-bottom-left) and BLF (bottom-left-fill) heuristic algorithms, LLABF can automatically select the next rectangle to be loaded that matches the mountable region during the rectangular loading process. Genetie algorithm (GA) is more effective to solve the two-dimensional strip packing problem.) Platform: |
Size: 580608 |
Author:Mr_WX |
Hits:
Search - rectangle packing