A new algorithm for the minimal-area convex enclosure problem

DOI10.1016/0377-2217(95)00020-QzbMath0918.90118MaRDI QIDQ1127205

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

manufacturingcomputational geometrycuttingnestingirregular 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)

Related Items

Complete and robust no-fit polygon generation for the irregular stock cutting problem ⋮ A beam search approach to solve the convex irregular bin packing problem with guillotine guts ⋮ Optimal clustering of a pair of irregular objects ⋮ An object-based evolutionary algorithm for solving nesting problems ⋮ Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle

Cites Work

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