Extremal antipodal polygons and polytopes

arXiv1301.6667MaRDI QIDQ6239154FDOQ6239154

Authors: Oswin Aichholzer, L. E. Caraballo, J. M. Díaz-Báñez, R. Fabila-Monroy, Claudio Ochoa, P. Nigsch 

Publication date: 28 January 2013

Abstract: Let $S$ be a set of $2n$ points on a circle such that for each point $pinS$ also its antipodal (mirrored with respect to the circle center) point $p^{\prime }$ belongs to $S$. A polygon $P$ of size $n$ is called emph{antipodal} if it consists of precisely one point of each antipodal pair $(p,p^{\prime })$ of $S$. We provide a complete characterization of antipodal polygons which maximize (minimize, respectively) the area among all antipodal polygons of $S$. Based on this characterization, a simple linear time algorithm is presented for computing extremal antipodal polygons. Moreover, for the generalization of antipodal polygons to higher dimensions we show that a similar characterization does not exist.

This page was built for publication: Extremal antipodal polygons and polytopes

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