A new algorithm for the minimal-area convex enclosure problem
type: Item
instance of: scholarly article
title: A new algorithm for the minimal-area convex enclosure problem
zbMATH Open document ID: 0918.90118
DOI: 10.1016/0377-2217(95)00020-Q
author: Roger B. Grinde
author: Tom M. Cavalier
published in: European Journal of Operational Research
publication date: 1999-08-19T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 65D18
zbMATH DE Number: 1189571
zbMATH Keywords: computational geometry
zbMATH Keywords: manufacturing
zbMATH Keywords: nesting
zbMATH Keywords: irregular pattern layout
zbMATH Keywords: cutting
zbMATH Keywords: minimal-area convex enclosure problem
MaRDI profile type: Publication
cites work: Q3999207
cites work: Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
cites work: Determining the minimum-area encasing rectangle for an arbitrary closed curve
cites work: Applied simulated annealing
cites work: Q4023849
Recommended article: Q5365105
Recommended article: Q4763392
Recommended article: Computing minimum-area rectilinear convex hull and \(L\)-shape
Recommended article: Q3123572
Recommended article: Convex programs for minimal-area problems
Recommended article: Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
Recommended article: An algorithm for concave integer minimization over a polyhedron
Recommended article: An optimal algorithm for computing a minimum nested nonconvex polygon
Recommended article: Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions
Recommended article: An optimal algorithm for finding minimal enclosing triangles
description: scientific article; zbMATH DE number 1189571