Skip to main content
Glama

CutOptim Engine

Server Details

Cutting optimization: 2D panels, 1D bars, timber and true-shape nesting via the CutOptim API.

If you are the author of this connector, you can claim ownership. Claimed connector authors can inspect health checks, view analytics, and manage their listing.
Status
Healthy
Uptime
100.0% over the last 24 hours
Last Tested
Transport
Streamable HTTP · MCP 2025-11-25
URL
Repository
cutoptim/engine-mcp
GitHub Stars
0
ChatGPT
–
Claude
–

TDQS

A4.3/5.0

Scored across 10 tools

Disambiguation5/5

The surface forms a clean matrix: {optimize, validate} × {1d, 2d, nest, wood} plus two utilities, so each tool targets a distinct mode+action. The only potentially overlapping pair (optimize_1d vs optimize_wood) is explicitly delineated — cross-section-aware matching vs every-bar-serves-every-part — and the validators are named to mirror their optimizer exactly.

Naming Consistency5/5

Every tool follows a consistent snake_case verb_noun pattern (optimize_1d, validate_nest, get_job, get_usage). The parallel optimize_*/validate_* pairs make the convention fully predictable, with no camelCase or style mixing.

Tool Count5/5

Ten tools is well-scoped for a cutting-optimization engine: four solve modes, four matching validators, and two account/async utilities. Every tool earns its place, with no redundancy and nothing padding the set.

Completeness4/5

Coverage is strong — all four optimization modes have solvers and free validators, async jobs are pollable, and quota is queryable. Minor gaps remain (no job cancellation/listing, no standalone import or health tool), though multi-part import is folded into optimize_nest and the async lifecycle is otherwise complete.

Available Tools

10 tools
get_jobGet an async jobA
Read-onlyIdempotent
Inspect

Free (needs the key that submitted the job). Reads an engine "max" job; when it succeeded, the plan is in result. Poll an async max-engine job. Fetch the status (and, when finished, the plan) of a job submitted with engine: "max". A job is queued, then running, then succeeded (with result = the same response shape a synchronous solve of that mode returns, carrying engine: "max" — a 2D plan for mode: "2d", a nest for mode: "nest") or failed (with error). Polling spends no quota, but the key must still be usable: a revoked key or a lapsed API subscription is refused with 403 here exactly as it is on every other authenticated path. A caller sees only its own jobs — a job id belonging to another account is reported as 401 "job not found", indistinguishable from one that does not exist, so ids cannot be probed.

Inputs: jobId (required). Returns: mode, error, jobId, engine, +4 more

get_usageGet API usageA
Read-onlyIdempotent
Inspect

Free (needs an API key). Shows the plan, the calls used and left this month, and when the period ends. The account's current-month usage and quota. Read-only. Does not consume quota and does not send rate-limit headers. The period is the UTC calendar month.

Inputs: no named parameters. Returns: env, plan, used, limit, +6 more

optimize_1dOptimize 1D barsAInspect

Metered: one Engine API call. Cut lengths from bars, tubes, profiles or rolls and get the cutting pattern per bar. 1D / linear optimization (bars, profiles, tube). Cut parts of a given length from stock bars. Returns the rods used, the position of every part along each rod, the leftover length and the yield metrics.

Inputs: parts (required), stock (required), async, engine, +2 more. Returns: object

optimize_2dOptimize 2D panelsAInspect

Metered: one Engine API call. Cut rectangular parts from sheets (panels, plywood, glass, sheet metal) and get the layout, cut plan and yield. 2D panel optimization. Nest rectangular parts into rectangular sheets. Returns the placement of every part, the remaining offcuts, the guillotine cut plan and the yield metrics. Parts named in matchedSets (grain matching) are cut side by side from one piece of board, one kerf apart; each placed member says which set and position it is.

Inputs: parts (required), stock (required), async, engine, +3 more. Returns: object

optimize_nestNest true shapesAInspect

Metered: one Engine API call (needs an API key; not available with the demo key). Nest free-form polygon parts on sheets. True-shape (irregular / polygon) nesting. Pack ARBITRARY POLYGONS onto fixed sheets, letting parts interlock into each other's concave pockets — an L-bracket, a gasket, a laser-cut profile. This is a different class from the rectangular modes: a part is an outline (polygon, optional interior holes), not a width×height, so a bounding-box packer's notch-air is reclaimed. On a representative 272-part job it uses 6 sheets where the same parts by bounding box need 9 (−33 % material).

Two things the rectangular API cannot express come for free here: per-sheet EXCLUSION ZONES (stock[].exclusions — a defect, a clamp footprint, a pre-printed area; a quality-0 zone is a no-go region for any part), and true-shape holes. Material partition (material) and the opaque meta passthrough work exactly as on the other modes.

⚠️ density is the placed POLYGON area over used sheet area — the honest fill, with concave pockets counted as empty. It is NOT comparable to a rectangular packer's yieldPct (which counts each bounding box as solid and so reads higher for a worse result); the cross-comparable metric is sheetCount on the same parts.

A placed part carries the rigid transform (rotation in degrees, then x/y translation), NOT a re-emitted polygon: your input outline plus that transform reconstructs the placement exactly. Deterministic (a pinned seed); set options.seed to reproduce a layout.

Engines: lbf (default) is synchronous and instant. Besides its own pass it tries the parts restricted to the right angles they allow, and their bounding boxes packed by an exact rectangle packer — which finds grids a sampling search misses (three 500-wide parts on a 1500-wide sheet at zero spacing) — and keeps whichever ranks best; on a tie, the plan that fills its sheets front to back, then the one with fewer parts off the right angles. max is ASYNCHRONOUS: the call answers 202 with a jobId, and you poll GET /v1/jobs/{id} for the result — the same response shape, with engine: "max". It runs the lbf pass first and then a time-budgeted search (options.timeBudgetMs, default 60 s, 10–180 s) that fills sheets one at a time looking for a layout with FEWER sheets; it never returns more sheets than lbf would — nor a plan that ranks worse by the sheet-size ranking below — and says in warnings when it kept the lbf layout. Several sheet sizes per material and respectStock are modelled; a polygon sheet or exclusions (which its strip search cannot model) are served by the lbf pass inside the job, with a warning — never refused. sparrow is a deprecated alias of max.

Sheet sizes and cost. With two or more stock rows for a material, both engines compare arrangements (your order, each row alone, cheapest-first) and then re-nest each sheet — the least-filled first — onto the cheaper or smaller rows, so a plan may MIX sizes (e.g. two large sheets and a small last one). Ranking: most must-cut (priority) parts placed → most parts placed → (with minimizeCost) lowest total price → least total sheet area → fewest sheets. sheets[].stock and stockUsage[] say which row each sheet came from. Used area. sheets[].usedWidth / usedHeight are the farthest extent of any placed part from the sheet origin (the corner the parts are packed into), usedArea their product, and stockUsage[].usedArea the sum per row — the numbers an ERP needs to charge a partial sheet (full sheet, a horizontal or vertical cut, or the bounding box; the charging rule stays yours). Both engines compact the least-filled sheet of each material: its parts are re-nested on the same sheet with rotation SUBSETS of what each part allows ({0,180}, {0,90,180,270}, a single orientation — never a new angle) and the variant with the smallest used area is kept; with max that sheet is then also re-packed by the search itself, along the sheet's height and (on a one-sheet plan) along its width, and the tighter layout is kept under the same rule. Sheet count, sizes, price and placed parts never change. options.compact: false returns the uncompacted layout, and options.compactFor (box · horizontal · vertical) picks the measure to minimise when you charge a full-width or full-height strip. metrics.cutLength / sheets[].cutLength is the summed perimeter of the placed parts' outlines and holes; pierces counts one per closed contour (no common-line cutting, lead-ins or micro-joints — your CAM adds those).

Parts from CAD files. A part may carry source — an SVG or DXF document — instead of polygon coordinates; the server reads the outline (and its holes) out of the file with the same parser the CutOptim app uses. The file replaces ONLY the geometry, and the response then carries an imported block saying what the files contributed. One file describes ONE part; POST /v1/import/nest splits a multi-part drawing first. Nothing is stored: the bytes are parsed in memory and gone with the response. Because a drawing is far larger than a JSON parts list, this path accepts a 10 MB body (the rectangular endpoints keep 1 MB), with per-file and per-request character caps on source.content.

Inputs: parts (required), stock (required), engine, include, +1 more. Returns: object

optimize_woodOptimize timberAInspect

Metered: one Engine API call. Cut timber parts grouped by cross-section from matching stock lengths. Timber optimization (cross-section-aware 1D). Cut lengths from bars that have a CROSS-SECTION. Unlike /v1/optimize/1d, where every bar can serve every part, a 50×150 part can only come out of 50×150 stock — so the job is split by cross-section, each section is matched to its own stock and solved separately, and the response carries both per-section and job-wide totals.

Fanning the same job out into several /v1/optimize/1d calls is not equivalent: it costs one call per section against your quota, moves the stock matching to your code, and cannot distinguish "no material of this section" from "did not fit" — which this endpoint reports separately as unmatched and unplaced.

sw and sh may be given in either order: 50×100 and 100×50 are the same bar turned over and are matched as one section. The response reports the normalised short/long form.

Inputs: parts (required), stock (required), async, engine, +2 more. Returns: object

validate_1dValidate a 1D requestA
Read-onlyIdempotent
Inspect

Free, no key needed: checks a 1D request without solving it. Same arguments as optimize_1d (field descriptions there). Validate a 1D request — free, no key, no quota, no solve. Schema-validate the SAME body /v1/optimize/1d takes, WITHOUT solving or spending a call. See /v1/validate/2d.

Inputs: parts (required), stock (required), async, engine, +2 more. Returns: mode, parts, stock, valid, +3 more

validate_2dValidate a 2D requestA
Read-onlyIdempotent
Inspect

Free, no key needed: checks a 2D request without solving it. Same arguments as optimize_2d (field descriptions there). Validate a 2D request — free, no key, no quota, no solve. Schema-validate the SAME body /v1/optimize/2d takes, WITHOUT solving or spending a call. 200 {valid:true, warnings} (warnings flag parts that fit no stock — an approximate, solve-free probe), or 400 with the exact bad field path. Open like /v1/health: validate payloads during integration before you even have a key. The engine verdict matches the optimize path exactly, engine: "max" included: a body this endpoint accepts is one /v1/optimize/2d will accept, and one it refuses (400 for an option the max tier cannot model, 503 where that tier is not enabled) is refused there too.

Inputs: parts (required), stock (required), async, engine, +3 more. Returns: mode, parts, stock, valid, +3 more

validate_nestValidate a nesting requestA
Read-onlyIdempotent
Inspect

Free, no key needed: checks a nesting request without solving it. Same arguments as optimize_nest (field descriptions there). Validate a nest request — free, no key, no quota, no solve. Schema-validate the SAME body /v1/optimize/nest takes, WITHOUT solving or spending a call. Reports engineEnabled (whether the nesting engine is built into this deployment) and warns about parts whose bounding box fits no stock sheet. For engine: "max" the verdict matches the optimize path exactly: 400 for anything outside the preview scope, 503 where the async tier is not enabled, and otherwise a warning that the job will be asynchronous. See /v1/validate/2d.

Inputs: parts (required), stock (required), engine, include, +1 more. Returns: mode, parts, stock, valid, +3 more

validate_woodValidate a timber requestA
Read-onlyIdempotent
Inspect

Free, no key needed: checks a timber request without solving it. Same arguments as optimize_wood (field descriptions there). Validate a wood request — free, no key, no quota, no solve. Schema-validate the SAME body /v1/optimize/wood takes, WITHOUT solving or spending a call. Warnings flag parts with no matching-section stock long enough. See /v1/validate/2d.

Inputs: parts (required), stock (required), async, engine, +2 more. Returns: mode, parts, stock, valid, +3 more

Tool Schema Changelog

Recent tool additions, removals, and schema changes observed during successful MCP inspections.

Loading tool schema changelog…

    Related MCP Connectors

    Related MCP Servers

    • F
      license
      Not graded
      quality
      D
      maintenance
      SmartCut is a hosted cutting-optimisation API. It turns a list of parts and available stock into machine-ready cutting patterns for sheet materials (plywood, MDF, glass, plastic, sheet metal), linear stock (timber, bar, pipe, extrusion) and roll goods. Guillotine and true-shape nesting modes, with grain direction, per-part orientation locks, edge banding, blade kerf and stock trim.
      3
      -
    • A
      license
      A
      quality
      B
      maintenance
      Enables programmatically creating, validating, nesting, previewing, and exporting vector cut designs in millimetres, with DXF/SVG/PNG outputs and direct opening in the target cutting application.
      28
      MIT
    • A
      license
      Not graded
      quality
      D
      maintenance
      Enables 2D irregular polygon nesting (bin-packing) with tools to design, preview, get reports, and export DXF files for laser cutting or CNC routing.
      MIT
    • A
      license
      Not graded
      quality
      B
      maintenance
      Enables an agent to turn furniture measurements into parametric module parts, optimize panel cutting layouts, and export cut lists, labels, PDF/SVG, CSV, or DXF.
      1
      MIT
    Try in Browser

    Glama MCP Gateway

    Add one secure layer between your agents and this server.