The \(n\)-point and six-partite point of a convex polygon
The six-partite point for a bounded planar convex set has been introduced by \textit{R. C. Buck} and \textit{E. F. Buck} [Math. Mag. 22, 195-198 (1948/49)]. The \(n\)-point of a planar convex polygon is defined here through a geometric optimization problem. The author provides solutions for the \(n\)-point and the six-partite point through enumerative search strategies.
scientific article; zbMATH DE number 1550614