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)

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
• 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

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)

Cites Work

• Applied simulated annealing
• Title not available (Why is that?)
• Determining the minimum-area encasing rectangle for an arbitrary closed curve
• Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
• Title not available (Why is that?)

Cited In (12)

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

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)