A new algorithm for the minimal-area convex enclosure problem (Q1127205): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3999207 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Determining the minimum-area encasing rectangle for an arbitrary closed curve / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Applied simulated annealing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4023849 / rank | |||
Normal rank | |||
Latest revision as of 15:39, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm for the minimal-area convex enclosure problem |
scientific article |
Statements
A new algorithm for the minimal-area convex enclosure problem (English)
0 references
19 August 1999
0 references
computational geometry
0 references
manufacturing
0 references
nesting
0 references
irregular pattern layout
0 references
cutting
0 references
minimal-area convex enclosure problem
0 references
