Corrigendum to: ``An algorithm to find maximum area polygons circumscribed about a convex polygon''
type: Item
instance of: scholarly article
title: Corrigendum to: ``An algorithm to find maximum area polygons circumscribed about a convex polygon''
zbMATH Open document ID: 1542.52009
author: Markus Ausserhofer
author: Susanna Dann
author: Zsolt Lángi
author: Géza Tóth
published in: Discrete Applied Mathematics
publication date: 2024-05-29T00:00:00Z
review text: Among polygons circumscribed about a given polygon \(P\), let \(Q\) have maximal area. Some sides of \(P\) lie on the boundary of \(Q\), but possibly not all do. Theorem 4 of the authors' 2019 paper [\textit{M. Ausserhofer} et al., Discrete Appl. Math. 255, 98--108 (2019; Zbl 1423.52008)] was intended to characterise which patterns of used and not-used sides, in cyclic order, can appear for some \(P,Q\). Unfortunately, the theorem and proof contained a rather subtle error, contradicting a 1975 theorem of \textit{S. K. Zaremba} [Discrete Math. 11, 79--92 (1975; Zbl 0298.65021)]. In this corrigendum, the authors use Zaremba's theorem to obtain a correct result.
reviewed by: Robert Dawson
Mathematics Subject Classification ID: 52A38
Mathematics Subject Classification ID: 52A10
zbMATH DE Number: 7855823
zbMATH Keywords: circumcribed polygons
zbMATH Keywords: maximum area
zbMATH Keywords: side sequence
MaRDI profile type: Publication
cites work: An algorithm to find maximum area polygons circumscribed about a convex polygon
cites work: Computing the isotropic discrepancy of point sets in two dimensions
DOI: 10.1016/J.DAM.2024.04.013
description: scientific article; zbMATH DE number 7855823