A new algorithm for the minimal-area convex enclosure problem

DOI10.1016/0377-2217(95)00020-QzbMATH Open0918.90118MaRDI QIDQ1127205FDOQ1127205

Authors Roger B. Grinde, Tom M. Cavalier 

Publication date 19 August 1999

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

computational geometrynestingmanufacturingcuttingirregular pattern layoutminimal-area convex enclosure problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• New approximation algorithms for minimum enclosing convex shapes
• scientific article; zbMATH DE number 742951
• Computing minimum-area rectilinear convex hull and \(L\)-shape
• scientific article; zbMATH DE number 988752
• Convex programs for minimal-area problems
• Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
• An algorithm for concave integer minimization over a polyhedron
• An optimal algorithm for computing a minimum nested nonconvex polygon
• Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions
• An optimal algorithm for finding minimal enclosing triangles

Cites work

• scientific article; zbMATH DE number 48158 (Why is no real title available?)
• scientific article; zbMATH DE number 108390 (Why is no real title available?)
• Applied simulated annealing
• Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
• Determining the minimum-area encasing rectangle for an arbitrary closed curve

Cited in

(12)

• New area-minimizing Lawson-Osserman cones
• scientific article; zbMATH DE number 988752 (Why is no real title available?)
• Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
• scientific article; zbMATH DE number 742951 (Why is no real title available?)
• Periodic interlocking problems in \(\mathbb R\times[0,w]\)
• A beam search approach to solve the convex irregular bin packing problem with guillotine guts
• An object-based evolutionary algorithm for solving nesting problems
• scientific article; zbMATH DE number 146418 (Why is no real title available?)
• Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle
• Complete and robust no-fit polygon generation for the irregular stock cutting problem
• Implementation of linear minimum area enclosing triangle algorithm. Application note
• Optimal clustering of a pair of irregular objects

This page was built for publication: A new algorithm for the minimal-area convex enclosure problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127205)