Finding minimum area simple pentagons

DOI10.1016/S0167-6377(97)00051-5MaRDI QIDQ1267196zbMATH OpenWikidataFDO

Authors Jean-François Hêche, Thomas M. Liebling

Publication date 6 October 1998

Published in Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

polynomial algorithmspentagonminimum area

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Abstract computational complexity for mathematical programming problems (90C60) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• The minimum area of a simple polygon with given side lengths
• Finding minimum area \(k\)-gons
• Minimum area circumscribing polygons
• scientific article; zbMATH DE number 3927286
• Minimum area polyomino Venn diagrams
• scientific article; zbMATH DE number 7650309
• Area minimization of special polygons
• Perimeter-minimizing pentagonal tilings
• Rectilinear convex hull with minimum area
• MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS

Cites work

• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 742951 (Why is no real title available?)
• Finding minimum area \(k\)-gons
• Searching for empty convex polygons
• Topologically sweeping an arrangement

Cited in

(1)

• On rainbow quadrilaterals in colored point sets

This page was built for publication: Finding minimum area simple pentagons

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