An algorithm to find maximum area polygons circumscribed about a convex polygon

DOI10.1016/j.dam.2018.08.017zbMath1423.52008arXiv1706.08152OpenAlexW2963334470WikidataQ129096153 ScholiaQ129096153MaRDI QIDQ1727731

Géza Tóth, Zsolt Lángi, Susanna Dann, Markus Ausserhofer

Publication date: 20 February 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.08152

zbMATH Keywords

areaGini indexcircumscribed polygon

Mathematics Subject Classification ID

Length, area, volume and convex sets (aspects of convex geometry) (52A38) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (1)

Extremal convex polygons inscribed in a given convex polygon

Cites Work

• Unnamed Item
• Minimum-area enclosing triangle with a fixed angle
• Finding the largest area rectangle of arbitrary orientation in a closed contour
• Minimum-perimeter enclosures
• Finding minimum area \(k\)-gons
• Extremal polygon containment problems
• Minimum area circumscribing polygons
• Computer science today. Recent trends and developments
• The Gini Index and Measures of Inequality
• Finding Extremal Polygons
• Finding the smallest triangles containing a given convex polygon
• Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
• An optimal algorithm for finding minimal enclosing triangles

This page was built for publication: An algorithm to find maximum area polygons circumscribed about a convex polygon