Description
Generate nonrotated integer rectangles for a fixed-width, unbounded-height strip with a feasible next-fit shelf placement; no minimum-height claim.
An optimization instance defines choices, constraints, and an objective. A feasible witness demonstrates that its stated constraints can be met; it establishes optimality only when the tool actually computes and verifies an optimum.
Generate nonrotated integer rectangles for a fixed-width, unbounded-height strip with a feasible next-fit shelf placement; no minimum-height claim.
When to use this tool
Use this generator to create reproducible strip packing instance cases from the supplied model or bank. Inspect the returned evidence before using cases in a test or exercise.
How to use the tool and how it works
- Supply rectangleCount, stripWidth, minimumWidth, maximumWidth, minimumHeight, maximumHeight in the field shapes below. Set seed when you need an explicit replay.
- Run the tool and correct any input error. For generated controls, distinguish a successful fixture containing an invalid case from failure to generate the fixture.
- Read stripWidth, rectangles, placements, usedHeight. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.
Draw integer rectangles and place them in input order using a nonrotated next-fit shelf. When the next rectangle exceeds remaining strip width, start a new shelf below the previous shelf height; return each placement and total used height.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| rectangleCount | Rectangle Count | Required. Safe integer; minimum 1; maximum 128. |
| stripWidth | Strip Width | Required. Safe integer; minimum 1; maximum 9007199254740991. |
| minimumWidth | Minimum Width | Required. Safe integer; minimum 1; maximum 9007199254740991. |
| maximumWidth | Maximum Width | Required. Safe integer; minimum 1; maximum 9007199254740991. |
| minimumHeight | Minimum Height | Required. Safe integer; minimum 1; maximum 9007199254740991. |
| maximumHeight | Maximum Height | Required. Safe integer; minimum 1; maximum 9007199254740991. |
| seed | Optional numeric seed; takes precedence over context randomness. Without either, use the fixed tool.io default seed. | Optional. Safe integer. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| stripWidth | Strip Width | Required. Safe integer; minimum 1; maximum 9007199254740991. |
| rectangles | Rectangles | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 128. |
| rectangles[].width | Width | Required. Safe integer; minimum 1; maximum 9007199254740991. |
| rectangles[].height | Height | Required. Safe integer; minimum 1; maximum 9007199254740991. |
| placements | Placements | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 128. |
| placements[].rectangle | Rectangle | Required. Safe integer; minimum 0; maximum 127. |
| placements[].x | X | Required. Safe integer; minimum 0; maximum 9007199254740991. |
| placements[].y | Y | Required. Safe integer; minimum 0; maximum 9007199254740991. |
| usedHeight | Used Height | Required. Safe integer; minimum 1; maximum 9007199254740991. |
| randomness | Replay metadata: source is seed or context; seed is the normalized 32-bit seed or null for a context source. | Required. Object; no unknown keys. |
| randomness.seed | Optional numeric replay seed; normalization and precedence are explained below. | Required. Safe integer. or Null. |
| randomness.source | Source | Required. Text; one of "context", "seed". |
An explicit safe-integer seed takes precedence over injected context randomness and is normalized to an unsigned 32-bit integer. With no seed and no context source, replay uses the fixed tool.io default seed. A context source must return finite values from zero inclusive to one exclusive; its advancing state must be retained separately. randomness records the source and normalized seed, or null for context. These generators are not cryptographic random sources.
{
"input": {
"rectangleCount": 5,
"stripWidth": 12,
"minimumWidth": 2,
"maximumWidth": 8,
"minimumHeight": 2,
"maximumHeight": 6,
"seed": 42
},
"output": {
"stripWidth": 12,
"rectangles": [
{
"width": 6,
"height": 4
},
{
"width": 7,
"height": 5
},
{
"width": 3,
"height": 4
},
{
"width": 3,
"height": 5
},
{
"width": 8,
"height": 4
}
],
"placements": [
{
"rectangle": 0,
"x": 0,
"y": 0
},
{
"rectangle": 1,
"x": 0,
"y": 4
},
{
"rectangle": 2,
"x": 7,
"y": 4
},
{
"rectangle": 3,
"x": 0,
"y": 9
},
{
"rectangle": 4,
"x": 3,
"y": 9
}
],
"usedHeight": 14,
"randomness": {
"seed": 42,
"source": "seed"
}
}
} Limitations and assumptions
- Every possible sampled width must fit the strip. Height is unbounded by the model. The witness is feasible for the stated shelf algorithm and is not a minimum-height packing.
- A replay requires the same complete input and implementation. Randomized construction does not guarantee uniform coverage of every feasible output; finite samples can repeat unless a distinct-selection rule is explicitly stated.
- The field tables state structural bounds; cross-field constraints and bounded search or output budgets also apply. Unknown keys are rejected where the object contract disallows them. Input errors are distinct from null fields and deliberate invalid controls in a successful output.
Alternative or Complementary methods
For a supplied example, inspect the returned construction or delegated check directly. To evaluate a consumer, also test cases chosen for its own boundaries; a generated finite corpus does not establish exhaustive coverage.
References
Similar or alternative tools
- Random Variable-Size Bin Packing Instance Generator
Generate integer item sizes for unlimited caller-defined capacity/cost bin types, with first-fit reuse and the cheapest fitting type for each new bin; no minimum-total-cost claim.
- Random Interval Scheduling Challenge Generator
Generate synthetic positive-duration half-open jobs and solve the declared count or weight objective exactly with finish-time dynamic programming, retaining one optimum with exclusion on objective ties.