Corrigendum to: ``An algorithm to find maximum area polygons circumscribed about a convex polygon''
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.
scientific article; zbMATH DE number 7855823