The \(n\)-point and six-partite point of a convex polygon
type: Item
instance of: scholarly article
title: The \(n\)-point and six-partite point of a convex polygon
zbMATH Open document ID: 0962.65013
DOI: 10.1016/S0895-7177(00)00173-4
author: Mark J. Kaiser
published in: Mathematical and Computer Modelling
publication date: 2001-01-14T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65D18
Mathematics Subject Classification ID: 52B45
zbMATH DE Number: 1550614
zbMATH Keywords: balance functional
zbMATH Keywords: constructive convex geometry
zbMATH Keywords: geometric optimization
zbMATH Keywords: convex polygon
zbMATH Keywords: \(n\)-point
zbMATH Keywords: six-particle point
zbMATH Keywords: enumerative search strategies
reviewed by: H. P. Dikshit
MaRDI profile type: Publication
cites work: Q5517554
cites work: Green eggs and ham
cites work: Q3278735
full work available at URL: s0895-7177(00)00173-4
OpenAlex ID: W2040236067
description: scientific article; zbMATH DE number 1550614