Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition

DOI10.1016/0734-189X(83)90040-3zbMath0585.90095OpenAlexW2084642194MaRDI QIDQ3712146

Dov Dori, Moshe Ben-Bassat

Publication date: 1983

Published in: Computer Vision, Graphics, and Image Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0734-189x(83)90040-3

zbMATH Keywords

algorithmcutting stockrectangular boardcircumscribing a convex polygon by a polygon ofefficient nesting of arbitrary geometric shapesfewer sidesminimal area additiontriangle rotating side problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Production models (90B30) Inequalities and extremum problems involving convexity in convex geometry (52A40) Mathematical programming (90C99) Polytopes and polyhedra (52Bxx)

Related Items

A polynomial solution for the Potato-peeling problem ⋮ Finding minimal enclosing boxes ⋮ On Computing a Largest Empty Arbitrarily Oriented Rectangle ⋮ A new algorithm for the minimal-area convex enclosure problem ⋮ Largest triangle inside a terrain ⋮ An algorithm to find maximum area polygons circumscribed about a convex polygon ⋮ Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet ⋮ Optimal clustering of a pair of irregular objects ⋮ New approaches for the nesting of two-dimensional shapes for press tool design ⋮ An object-based evolutionary algorithm for solving nesting problems ⋮ Stock cutting to minimize cutting length ⋮ Minimum area circumscribing polygons ⋮ Finding minimal convex nested polygons ⋮ EFFICIENT APPROXIMATION OF CONVEX POLYGONS